HALOWERKDatenvertragswerk
crc32 segment concatenation ledger
Own reflected IEEE CRC32 GF(2) operator composition, compatible with the zlib crc32_combine contract. Return all computable prefix CRCs and lengths plus whole claimed-prefix correspondence. Caller supplies segment lengths and externally conditioned CRC32 values; this does not verify unknown underlying payload or provide cryptographic integrity. Empty segment CRC is0; missing nonempty CRC stops derivation. Earlier concrete prefix mismatch survives uncertainty. Fixed0.003USDC also for.
POST https://datenvertrag.halowerk.com/v1/crc32-segment-concatenation-ledgerEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| capture_complete | boolean | Ja | |
| claimed_prefixes | Siehe Schema | Ja | |
| segments | array | Ja |
Vollständiges Eingabeschema anzeigen
{
"additionalProperties": false,
"properties": {
"capture_complete": {
"type": "boolean"
},
"claimed_prefixes": {
"anyOf": [
{
"items": {
"pattern": "^[0-9a-f]{8}$",
"type": "string"
},
"maxItems": 32,
"type": "array"
},
{
"type": "null"
}
]
},
"segments": {
"items": {
"additionalProperties": false,
"properties": {
"crc32": {
"anyOf": [
{
"pattern": "^[0-9a-f]{8}$",
"type": "string"
},
{
"type": "null"
}
]
},
"length": {
"maximum": 2147483647,
"minimum": 0,
"type": "integer"
}
},
"required": [
"length",
"crc32"
],
"type": "object"
},
"maxItems": 32,
"type": "array"
}
},
"required": [
"capture_complete",
"segments",
"claimed_prefixes"
],
"type": "object"
}Veröffentlichtes Eingabebeispiel
{
"capture_complete": true,
"claimed_prefixes": [
"884863d2",
"0972d361",
"cbf43926"
],
"segments": [
{
"crc32": "884863d2",
"length": 3
},
{
"crc32": "b1a8c371",
"length": 3
},
{
"crc32": "96ff1ef4",
"length": 3
}
]
}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