HALOWERKDatenvertragswerk
lz78 phrase dictionary ledger
For an original word of0..48symbols each0..15, reconstruct every LZ78 phrase boundary, prefix-index/next-symbol pair, dictionary entry and independent decoded word. Dictionary starts at index0 empty; longest existing prefix extends by next symbol. Explicit local EOF convention: if the remaining suffix already exists, emit(prefix,null), no new dictionary entry. Check entire claimed pairlist; missing word/claim unknown with known results retained. This is symbolic LZ78 encoding, no bit.
POST https://datenvertrag.halowerk.com/v1/lz78-phrase-dictionary-ledgerEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| word | Siehe Schema | Ja | |
| claimed_pairs | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"word",
"claimed_pairs"
],
"properties": {
"word": {
"anyOf": [
{
"type": "array",
"maxItems": 48,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
}
},
{
"type": "null"
}
]
},
"claimed_pairs": {
"anyOf": [
{
"type": "array",
"maxItems": 48,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"prefix",
"symbol"
],
"properties": {
"prefix": {
"type": "integer",
"minimum": 0,
"maximum": 48
},
"symbol": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 15
},
{
"type": "null"
}
]
}
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"word": [
0,
1,
0,
1,
0,
1
],
"claimed_pairs": [
{
"prefix": 0,
"symbol": 0
},
{
"prefix": 0,
"symbol": 1
},
{
"prefix": 1,
"symbol": 1
},
{
"prefix": 3,
"symbol": null
}
]
}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