HALOWERKDatenvertragswerk
minimum degree boolean annihilator family
For n1..3 and a complete Boolean truth-table bitmask f, return the common minimum algebraic degree among ALL nonzero squarefree GF2 polynomials g satisfying f*g=0 or(1+f)*g=0 pointwise, and EVERY polynomial at that minimum. Entries sort by side then coefficient_mask; side0 annihilates f,side1 annihilates1+f. Truth bit a evaluates assignment with variable x_i=(a>>i)&1. Coefficient bit m is the squarefree monomial product of x_i for set bits of m; m0 is constant1. Return minimum_degree,.
POST https://datenvertrag.halowerk.com/v1/minimum-degree-boolean-annihilator-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| n | Siehe Schema | Ja | |
| truth | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"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": {
"minimum_degree": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"annihilators": {
"type": "array",
"items": {
"type": "object",
"properties": {
"side": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"coefficient_mask": {
"type": "integer",
"minimum": 1,
"maximum": 255
},
"truth_mask": {
"type": "integer",
"minimum": 1,
"maximum": 255
}
},
"required": [
"side",
"coefficient_mask",
"truth_mask"
],
"additionalProperties": false
},
"minItems": 1,
"maxItems": 30
},
"count": {
"type": "integer",
"minimum": 1,
"maximum": 30
}
},
"required": [
"minimum_degree",
"annihilators",
"count"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"n",
"truth",
"claim"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"n": 1,
"truth": 0,
"claim": {
"minimum_degree": 0,
"annihilators": [
{
"side": 0,
"coefficient_mask": 1,
"truth_mask": 3
}
],
"count": 1
}
}Ergebnis & Dokumentation
Maschinenlesbare Dokumentation dieses Hubs
Quelle dieser Seite: der veröffentlichte HALOWERK-Katalog. Stand: 2026-11-07, 02:42 UTC.
Weitere Endpunkte dieses Hubs
- Datenvertragswerk0,003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n1..5 and a monic degree-n integer polynomial det(xI-A), return EVERY labelled simple undirected graph on vertices0..n-1 having exactly that adjacency characteristic polynomial over integers. Coefficients are descending degree order,
- 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.
- Datenvertragswerk0,003 USDC
aligned record cut audit
POSThttps://datenvertrag.halowerk.com/v1/aligned-record-cut-auditA stream-runtime fixture maintainer checks which record IDs belong to a supplied aligned checkpoint cut and which same-channel post-barrier records must stay buffered until all input barriers arrive. One aligned local checkpoint;record iden