HALOWERKDatenvertragswerk
cyclic elimination order audit
For anonymous labels0..size-1, count every step-th live item starting with the supplied start label, remove it from the abstract circle and resume at its next live successor. Return the entire Josephus selection order, inverse zero-based removal-round vector, final label and every live-rank transition, and compare the whole claimed order. Size1..64,step1..1e9. Missing size/step leaves result unknown; missing claim preserves exact computed artifact with unknown verdict. Own zero-based start.
POST https://datenvertrag.halowerk.com/v1/cyclic-elimination-order-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| size | Siehe Schema | Ja | |
| step | Siehe Schema | Ja | |
| start | integer | Ja | |
| claimed_order | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"size": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 64
},
{
"type": "null"
}
]
},
"step": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 1000000000
},
{
"type": "null"
}
]
},
"start": {
"type": "integer",
"minimum": 0,
"maximum": 63
},
"claimed_order": {
"anyOf": [
{
"type": "array",
"maxItems": 64,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 63
}
},
{
"type": "null"
}
]
}
},
"required": [
"size",
"step",
"start",
"claimed_order"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"size": 4,
"step": 2,
"start": 0,
"claimed_order": [
1,
3,
2,
0
]
}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