Datenvertragswerk
bijective burrows wheeler transform ledger
From one binary word of 0..8 symbols, constructs its bijective Burrows-Wheeler transform (BBWT, Scott/BWTS). The word is split by Chen-Fox-Lyndon factorization into nonincreasing Lyndon words, every cyclic left rotation of every factor is sorted by infinite periodic omega-order, and the last symbol of each sorted rotation forms encoded. Also returns the factors, aligned rotation_factor_indices and rotation_offsets. No terminal sentinel or primary row index.
POST https://datenvertrag.halowerk.com/v1/bijective-burrows-wheeler-transform-ledgerInputs
| Field | Type | Required | Description |
|---|---|---|---|
| word | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"word": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"minItems": 0,
"maxItems": 8
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"minItems": 0,
"maxItems": 8
},
{
"type": "null"
}
]
}
},
"required": [
"word",
"claim"
],
"additionalProperties": false
}Published input example
{
"word": [],
"claim": []
}Result & documentation
Machine-readable documentation of this hub
Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.
More endpoints in this hub
- Datenvertragswerk0.003 USDC
acyclic automata probabilistic refinement witness
POSThttps://datenvertrag.halowerk.com/v1/acyclic-automata-probabilistic-refinement-witnessFor two finite action-labelled nondeterministic probabilistic automata return the WHOLE greatest DIRECTED STRONG SIMULATION relation, canonical single-transition matching couplings and exhaustive local negative Hall obstructions. Each of 1.
- Datenvertragswerk0.003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n in 1..5 and a monic degree-n integer polynomial det(xI-A), returns every labelled simple undirected graph on vertices 0..n-1 with exactly that adjacency characteristic polynomial. Coefficients are in descending degree order, n+1 ent
- 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.