HALOWERKDatenvertragswerk
hilbert grid index audit
Return the entire Hilbert index-to-coordinate path and row-major coordinate-to-index table for order0..4 on a2^order square integer grid. Bottom-left origin,yup; order1 path(0,0),(0,1),(1,1),(1,0), explicit recursive orientation. Check both entire supplied table claims; known contradiction remains negative despite another missing claim. Missing claims preserve full exact mathematical output with unknown verdict. Not analytic Hilbert transform, CGAL/Wolfram/S2 interop, continuous/geographic.
POST https://datenvertrag.halowerk.com/v1/hilbert-grid-index-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| order | integer | Ja | |
| path_claim | Siehe Schema | Ja | |
| index_claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"order": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"path_claim": {
"anyOf": [
{
"type": "array",
"maxItems": 256,
"items": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
}
}
},
{
"type": "null"
}
]
},
"index_claim": {
"anyOf": [
{
"type": "array",
"maxItems": 256,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 255
}
},
{
"type": "null"
}
]
}
},
"required": [
"order",
"path_claim",
"index_claim"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"order": 1,
"path_claim": [
[
0,
0
],
[
0,
1
],
[
1,
1
],
[
1,
0
]
],
"index_claim": [
0,
3,
1,
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