HALOWERKDatenvertragswerk
shortest addition chain audit
Own complete all-pair-addition breadth-first search for target1..16. Return globally minimum multiplicationcount, countofdistinct optimal exponentsequences, lexleastoptimalchain and leastindexpair perstep. Operanddecomposition alternatives do not multiply the chaincount; no star-chain restriction. Compare whole length/count/chainclaim. No OEISprogram/tablelookup, actual exponentiation,crypto,key or externalexecution. Missingtarget/claim unknown. Fixed0.003USDC also for schema-valid unknown;.
POST https://datenvertrag.halowerk.com/v1/shortest-addition-chain-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| claimed | Siehe Schema | Ja | |
| target | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"additionalProperties": false,
"properties": {
"claimed": {
"anyOf": [
{
"additionalProperties": false,
"properties": {
"chain": {
"items": {
"maximum": 16,
"minimum": 1,
"type": "integer"
},
"maxItems": 16,
"type": "array"
},
"multiplications": {
"maximum": 15,
"minimum": 0,
"type": "integer"
},
"optimal_chain_count": {
"maximum": 16384,
"minimum": 1,
"type": "integer"
}
},
"required": [
"multiplications",
"optimal_chain_count",
"chain"
],
"type": "object"
},
{
"type": "null"
}
]
},
"target": {
"anyOf": [
{
"maximum": 16,
"minimum": 1,
"type": "integer"
},
{
"type": "null"
}
]
}
},
"required": [
"target",
"claimed"
],
"type": "object"
}Veröffentlichtes Eingabebeispiel
{
"claimed": {
"chain": [
1,
2,
4,
8,
16
],
"multiplications": 4,
"optimal_chain_count": 1
},
"target": 16
}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