datenvertrag.halowerk.com
datenvertrag.halowerk.com
For n1..3 and a fully captured single-output Boolean truth-table mask f, reconstruct ALL equivalent masks under input permutation, input negations and output negation. Truth bit a evaluates x_i=(a>>i)&1. Exact own action: y_i=x_permutation[i] XOR input_negation_mask[i], transformed(x)=f(y) XOR output_negation. Mask-bit i denotes the negation of source argument y_i. Return numerically sorted truth_
- Category
- Service
- Networks
- Base
- Starting price
- $0.003
- Paid calls, 30 days
- 22
- Payers, 30 days
- 4
How to pay
Call an endpoint, read the price in the 402 answer, and pay from your own wallet with any x402 client on Base. The payment goes straight to the provider: Autonomo lists this API but isn't part of the payment. See The x402 directory.
Paid endpoints
18 endpoints, sorted by usage. Prices are per request.
| Endpoint | Price | Network | Facilitator | Calls / 30d |
|---|---|---|---|---|
POST/v1/partition-hook-multiset-inverse-family Given an original multiset of0..20positive hooklengths each1..20, reconstruct EVERY integer partition of that cellcount whose English Ferrers diagram has exactly that hookmultiset. Hook counts self plus cells strictlyright and strictlybelow. Return all shapes in numeric lexicographic order, complete rowaligned hooktableau for each shape, exact familycount. | $0.003 | Base | Coinbase CDP | 6 |
POST/v1/binary-automaton-reset-word-ledger Given the original total binary transition table of a deterministic automaton with 1..4 states, reconstruct every reachable state subset and labelled transition, the minimum reset-word length, the exact number of shortest binary words, the lexicographically first word and its full image trace. Distinct symbol words remain distinct when they reach the same subset. A one-state automaton resets by the empty word. Claim -1 means no reset word; null claim or missing table remains unknown. | $0.003 | Base | Coinbase CDP | 1 |
POST/v1/binary-necklace-orbit-inventory-audit For a supplied length1..10 generate ALL binary necklaces under cyclic rotation, represented by lexicographically least0/1word, in increasing lexical order. Return each full word, its least positive cyclic period and orbit size; total necklaces, primitive necklaces with period=n and ascending divisor-period class histogram including zero bins. Sum of orbit sizes covers all2^n binary words. No reflection quotient, color relabeling or density restriction. | $0.003 | Base | Coinbase CDP | 1 |
Is this your project? Suggest an edit.