HALOWERKDatenvertragswerk
packbits row reconstruction audit
Own bounded TIFF6PackBits normalized-row decoder: unsigned0..127literal,129..255replicate,128noop; each row independently bounded. Return all complete-operation decoded prefixes, consumed offsets and literal/replicate/noop witnesses; compare whole supplied rows. Known rowoverrun/closed-capture truncation native400; unavailable/opencapture unknown, incomplete operation not invented. No TIFFIFD/header/pixel/photometry or file access. Fixed0.003USDC also for schema-valid unknown..
POST https://datenvertrag.halowerk.com/v1/packbits-row-reconstruction-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| claimed_rows | Siehe Schema | Ja | |
| row_bytes | integer | Ja | |
| rows | array | Ja |
Vollständiges Eingabeschema anzeigen
{
"additionalProperties": false,
"properties": {
"claimed_rows": {
"anyOf": [
{
"items": {
"items": {
"maximum": 255,
"minimum": 0,
"type": "integer"
},
"maxItems": 128,
"type": "array"
},
"maxItems": 4,
"type": "array"
},
{
"type": "null"
}
]
},
"row_bytes": {
"maximum": 128,
"minimum": 1,
"type": "integer"
},
"rows": {
"items": {
"anyOf": [
{
"additionalProperties": false,
"properties": {
"capture_complete": {
"type": "boolean"
},
"encoded": {
"items": {
"maximum": 255,
"minimum": 0,
"type": "integer"
},
"maxItems": 64,
"type": "array"
}
},
"required": [
"encoded",
"capture_complete"
],
"type": "object"
},
{
"type": "null"
}
]
},
"maxItems": 4,
"type": "array"
}
},
"required": [
"row_bytes",
"rows",
"claimed_rows"
],
"type": "object"
}Veröffentlichtes Eingabebeispiel
{
"claimed_rows": [
[
1,
2,
3,
9,
9,
9,
9,
9
]
],
"row_bytes": 8,
"rows": [
{
"capture_complete": true,
"encoded": [
128,
2,
1,
2,
3,
252,
9,
128
]
}
]
}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