Datenvertragswerk
boolean walsh slice preimage family
Reconstructs every Boolean truth table compatible with 0..2 exact signed Walsh coefficients, for n in 1..3 input bits. Truth mask bit x equals f(x); an observation with frequency s and coefficient c means W_f(s) = SUM over x of (-1)^(f(x) XOR parity(x&s)) equals c, with no absolute value, binning or normalization. Returns all truth_masks ascending, count and feasible. An empty list returns all 2^(2^n) functions; incompatible coefficients give a known empty family.
POST https://datenvertrag.halowerk.com/v1/boolean-walsh-slice-preimage-familyInputs
| Field | Type | Required | Description |
|---|---|---|---|
| n | See schema | Yes | |
| observations | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"n": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 3
},
{
"type": "null"
}
]
},
"observations": {
"anyOf": [
{
"type": "array",
"items": {
"type": "object",
"properties": {
"frequency": {
"type": "integer",
"minimum": 0,
"maximum": 7
},
"coefficient": {
"type": "integer",
"minimum": -8,
"maximum": 8,
"multipleOf": 2
}
},
"required": [
"frequency",
"coefficient"
],
"additionalProperties": false
},
"minItems": 0,
"maxItems": 2
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"truth_masks": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 255
},
"minItems": 0,
"maxItems": 256
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 257
},
"feasible": {
"type": "boolean"
}
},
"required": [
"truth_masks",
"count",
"feasible"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"n",
"observations",
"claim"
],
"additionalProperties": false
}Published input example
{
"n": 1,
"observations": [],
"claim": {
"truth_masks": [
0,
1,
2,
3
],
"count": 4,
"feasible": true
}
}Result & documentation
Machine-readable documentation of this hub
Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.
More endpoints in this hub
- Datenvertragswerk0.003 USDC
acyclic automata probabilistic refinement witness
POSThttps://datenvertrag.halowerk.com/v1/acyclic-automata-probabilistic-refinement-witnessFor two finite action-labelled nondeterministic probabilistic automata return the WHOLE greatest DIRECTED STRONG SIMULATION relation, canonical single-transition matching couplings and exhaustive local negative Hall obstructions. Each of 1.
- Datenvertragswerk0.003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n in 1..5 and a monic degree-n integer polynomial det(xI-A), returns every labelled simple undirected graph on vertices 0..n-1 with exactly that adjacency characteristic polynomial. Coefficients are in descending degree order, n+1 ent
- Datenvertragswerk0.003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.