HALOWERKDatenvertragswerk
cbor shareable array graph audit
Reconstruct the complete array-identity graph and pre-order shareable slots from supplied normalized CBOR tag28/tag29 array events, including aliases to a currently open array. Single item;arrays only;open-array shared flag denotes tag28 immediately wrapping that array;ref denotes tag29 unsigned slot. No maps,other values,tags296/stringref,binary decoding,canonical byte-layout or fullCBOR conformance. Fresh table per invocation. Max8arrays,4shareables,depth4,24events. One missing index is.
POST https://datenvertrag.halowerk.com/v1/cbor-shareable-array-graph-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| events | array | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"events",
"claim"
],
"properties": {
"events": {
"type": "array",
"minItems": 2,
"maxItems": 24,
"items": {
"oneOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"op",
"shared"
],
"properties": {
"op": {
"const": "open"
},
"shared": {
"type": "boolean"
}
}
},
{
"type": "object",
"additionalProperties": false,
"required": [
"op",
"index"
],
"properties": {
"op": {
"const": "ref"
},
"index": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 3
},
{
"type": "null"
}
]
}
}
},
{
"type": "object",
"additionalProperties": false,
"required": [
"op"
],
"properties": {
"op": {
"const": "close"
}
}
}
]
}
},
"claim": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"nodes",
"shared"
],
"properties": {
"nodes": {
"type": "array",
"minItems": 1,
"maxItems": 8,
"items": {
"type": "array",
"maxItems": 23,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 7
}
}
},
"shared": {
"type": "array",
"maxItems": 4,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 7
}
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"events": [
{
"op": "open",
"shared": true
},
{
"op": "open",
"shared": true
},
{
"op": "close"
},
{
"op": "open",
"shared": false
},
{
"op": "close"
},
{
"op": "ref",
"index": 0
},
{
"op": "ref",
"index": 0
},
{
"op": "close"
}
],
"claim": {
"nodes": [
[
1,
2,
0,
0
],
[],
[]
],
"shared": [
0,
1
]
}
}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