HALOWERKDatenvertragswerk
ducci orbit cycle ledger
For an original tuple of0..4nonnegative integers0..15, iterate simultaneouscyclic Ducci differences new[i]=abs(old[i]-old[(i+1)modn]) until first repeated entire tuple. Return whole ordered transient and cycle beginning at first cycleentry, repeatedstate, exact transientlength/leastperiod/distinctcount and eventualzero flag. Emptytuple is an explicitly owned fixedpoint convention; arities1/2 follow same rule. All69905allowed originals independentlyscanned beforeCore to establish profile max.
POST https://datenvertrag.halowerk.com/v1/ducci-orbit-cycle-ledgerEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| initial | Siehe Schema | Ja | |
| claimed_orbit | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"initial",
"claimed_orbit"
],
"properties": {
"initial": {
"anyOf": [
{
"type": "array",
"maxItems": 4,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
}
},
{
"type": "null"
}
]
},
"claimed_orbit": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"transient",
"cycle"
],
"properties": {
"transient": {
"type": "array",
"maxItems": 32,
"items": {
"type": "array",
"maxItems": 4,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
}
}
},
"cycle": {
"type": "array",
"maxItems": 32,
"items": {
"type": "array",
"maxItems": 4,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
}
}
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"initial": [
0,
1,
1
],
"claimed_orbit": {
"transient": [],
"cycle": [
[
0,
1,
1
],
[
1,
0,
1
],
[
1,
1,
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