HALOWERKDatenvertragswerk
serial order cycle audit
Reconstruct complete RFC1982 serial comparisons from original finite snapshot-value domains: equal/less/greater/undefined, every half-circle incomparable pair, every directed triangle witness and indices not older than every value under defined comparisons. 2..32serialbits,1..8 original indexed snapshots,one value each except atmost1explicit2-value capture domain. No DNSserver/IXFR/zoneupdate/serial increment execution or universal chronology. Triangle witnesses are not claimed to enumerate.
POST https://datenvertrag.halowerk.com/v1/serial-order-cycle-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| bits | integer | Ja | |
| domains | array | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"bits",
"domains",
"claim"
],
"properties": {
"bits": {
"type": "integer",
"minimum": 2,
"maximum": 32
},
"domains": {
"type": "array",
"minItems": 1,
"maxItems": 8,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 2,
"uniqueItems": true,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4294967295
}
}
},
"claim": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"relations",
"half_pairs",
"triangles",
"dominant_indices"
],
"properties": {
"relations": {
"type": "array",
"items": {
"type": "array",
"minItems": 1,
"maxItems": 8,
"items": {
"enum": [
"eq",
"lt",
"gt",
"undefined"
]
}
},
"minItems": 1,
"maxItems": 8
},
"half_pairs": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 7
},
"minItems": 2,
"maxItems": 2
},
"maxItems": 28
},
"triangles": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 7
},
"minItems": 3,
"maxItems": 3
},
"maxItems": 56
},
"dominant_indices": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 7
},
"maxItems": 8
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"bits": 3,
"domains": [
[
0
],
[
3
],
[
6
]
],
"claim": {
"relations": [
[
"eq",
"lt",
"gt"
],
[
"gt",
"eq",
"lt"
],
[
"lt",
"gt",
"eq"
]
],
"half_pairs": [],
"triangles": [
[
0,
1,
2
]
],
"dominant_indices": []
}
}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