Datenvertragswerk
boolean npn orbit stabilizer
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_masks, smallest canonical_truth, orbit_size, all original stabilizers, and.
POST https://datenvertrag.halowerk.com/v1/boolean-npn-orbit-stabilizerInputs
| Field | Type | Required | Description |
|---|---|---|---|
| n | See schema | Yes | |
| truth | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"n": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 3
},
{
"type": "null"
}
]
},
"truth": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 255
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"truth_masks": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 255
},
"minItems": 1,
"maxItems": 96
},
"canonical_truth": {
"type": "integer",
"minimum": 0,
"maximum": 255
},
"orbit_size": {
"type": "integer",
"minimum": 1,
"maximum": 96
},
"stabilizers": {
"type": "array",
"items": {
"type": "object",
"properties": {
"permutation": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 1,
"maxItems": 3
},
"input_negation_mask": {
"type": "integer",
"minimum": 0,
"maximum": 7
},
"output_negation": {
"type": "boolean"
}
},
"required": [
"permutation",
"input_negation_mask",
"output_negation"
],
"additionalProperties": false
},
"minItems": 1,
"maxItems": 96
},
"group_order": {
"type": "integer",
"minimum": 4,
"maximum": 96
}
},
"required": [
"truth_masks",
"canonical_truth",
"orbit_size",
"stabilizers",
"group_order"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"n",
"truth",
"claim"
],
"additionalProperties": false
}Published input example
{
"n": 1,
"truth": 0,
"claim": {
"truth_masks": [
0,
3
],
"canonical_truth": 0,
"orbit_size": 2,
"stabilizers": [
{
"permutation": [
0
],
"input_negation_mask": 0,
"output_negation": false
},
{
"permutation": [
0
],
"input_negation_mask": 1,
"output_negation": false
}
],
"group_order": 4
}
}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.