HALOWERKDatenvertragswerk
hereditary goodstein prefix ledger
From an original start integer0..15 and requested0..5steps, construct the classical Goodstein prefix starting base2: write each current value in hereditary base b, replace b by b+1 everywhere including nested exponents, then subtract1. Canonical expression uses literal B, descending nonzero coefficient terms c*B^(recursive exponent), zero as0; actual b is separate. Return ALL intermediate bases/current expressions, exact bumped values before subtraction, next values, full decimal sequence.
POST https://datenvertrag.halowerk.com/v1/hereditary-goodstein-prefix-ledgerEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| start | Siehe Schema | Ja | |
| steps | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"start",
"steps",
"claim"
],
"properties": {
"start": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 15
},
{
"type": "null"
}
]
},
"steps": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 5
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "array",
"maxItems": 6,
"items": {
"type": "string",
"maxLength": 128,
"pattern": "^(0|[1-9][0-9]*)$"
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"start": 6,
"steps": 1,
"claim": [
"6",
"29"
]
}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