HALOWERKDatenvertragswerk
minimal universal window cycle audit
For numeric alphabet0..k-1 with k1..4 and order1..4, construct the entire lexicographically least de Bruijn cycle containing each order-length word exactly once cyclically. Return full cycle, linearization obtained by cyclically appending order-1 symbols, every lexicographic word-rank position and exact window count. Unary degeneracy and order1 explicit. Compare the complete supplied artifact by field names; arrays retain semantic order. Missing alphabet/order gives unknown; missing claim.
POST https://datenvertrag.halowerk.com/v1/minimal-universal-window-cycle-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| alphabet_size | Siehe Schema | Ja | |
| order | Siehe Schema | Ja | |
| claimed_value | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"alphabet_size": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 4
},
{
"type": "null"
}
]
},
"order": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 4
},
{
"type": "null"
}
]
},
"claimed_value": {
"anyOf": [
{
"type": "object",
"properties": {
"cycle": {
"type": "array",
"maxItems": 256,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
}
},
"linearization": {
"type": "array",
"maxItems": 259,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
}
},
"window_positions_by_rank": {
"type": "array",
"maxItems": 256,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 256
}
},
"window_count": {
"type": "integer",
"minimum": 1,
"maximum": 256
}
},
"required": [
"cycle",
"linearization",
"window_positions_by_rank",
"window_count"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"alphabet_size",
"order",
"claimed_value"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"alphabet_size": 2,
"order": 3,
"claimed_value": {
"cycle": [
0,
0,
0,
1,
0,
1,
1,
1
],
"linearization": [
0,
0,
0,
1,
0,
1,
1,
1,
0,
0
],
"window_positions_by_rank": [
0,
1,
2,
4,
7,
3,
6,
5
],
"window_count": 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