HALOWERKDatenvertragswerk
binary code coset leader ledger
For supplied0..4 paritycheck rowmasks on1..6bits(least-significant-bit=coordinate0), return allsyndrome cosets, everyminimumweight leader, cosetweightcounts, canonicalnumeric kernelbasis/codewords and coveringradius. Includes unreachable syndromes for dependentchecks. Compare wholeordered claimed_leaders array. Nullchecks or claim is unknown. Fixed0.003USDC also validunknown. Finitebinaryalgebra,no physicalerror/securityclaim.
POST https://datenvertrag.halowerk.com/v1/binary-code-coset-leader-ledgerEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| length | integer | Ja | |
| check_rows | Siehe Schema | Ja | |
| claimed_leaders | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"length",
"check_rows",
"claimed_leaders"
],
"properties": {
"length": {
"type": "integer",
"minimum": 1,
"maximum": 6
},
"check_rows": {
"anyOf": [
{
"type": "array",
"maxItems": 4,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 63
}
},
{
"type": "null"
}
]
},
"claimed_leaders": {
"anyOf": [
{
"type": "array",
"maxItems": 16,
"items": {
"type": "array",
"maxItems": 64,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 63
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"length": 4,
"check_rows": [
15,
15
],
"claimed_leaders": [
[
0
],
[],
[],
[
1,
2,
4,
8
]
]
}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