HALOWERKDatenvertragswerk
binary tree rotation geodesic ledger
Given two ordered full binary trees encoded as 0 or (LR), with equal counts of at most five internal nodes, reconstruct their undirected elementary rotation distance, exact number of shortest vertex paths, and lexicographically first whole shortest path with removed and added convex-polygon diagonals at every step. The claim checks distance only; the full path, count and witnesses are delivered. Missing source, target or claim remains unknown. Own exact finite profile, without labels,.
POST https://datenvertrag.halowerk.com/v1/binary-tree-rotation-geodesic-ledgerEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| from | Siehe Schema | Ja | |
| to | Siehe Schema | Ja | |
| claimed_distance | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"from",
"to",
"claimed_distance"
],
"properties": {
"from": {
"anyOf": [
{
"type": "string",
"minLength": 1,
"maxLength": 16,
"pattern": "^[0()]+$"
},
{
"type": "null"
}
]
},
"to": {
"anyOf": [
{
"type": "string",
"minLength": 1,
"maxLength": 16,
"pattern": "^[0()]+$"
},
{
"type": "null"
}
]
},
"claimed_distance": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 10
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"from": "(((00)0)0)",
"to": "(0((00)0))",
"claimed_distance": 2
}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