HALOWERKDatenvertragswerk
pointstamp completion audit
A streaming-runtime fixture maintainer checks whether claimed blocked/unblocked completion requests follow from a reconciled global capability/message stock and a supplied finite graph of product-time location summaries. Additive two-coordinate model only; no delivery or real-runtime claim. Missing evidence remains unknown. Fixed price also for schema-valid unknown; invalid profile HTTP400 before settlement. A schema-valid unknown is a successful result at the same fixed price; requests are.
POST https://datenvertrag.halowerk.com/v1/pointstamp-completion-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| snapshot_kind | Siehe Schema | Ja | |
| locations | integer | Ja | |
| graph_complete | boolean | Ja | |
| stock_complete | boolean | Ja | |
| edges | array | Ja | |
| stocks | array | Ja | |
| queries | array | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"properties": {
"snapshot_kind": {
"const": "reconciled_global_stock"
},
"locations": {
"type": "integer",
"minimum": 1,
"maximum": 6
},
"graph_complete": {
"type": "boolean"
},
"stock_complete": {
"type": "boolean"
},
"edges": {
"type": "array",
"items": {
"type": "object",
"additionalProperties": false,
"properties": {
"id": {
"type": "string",
"pattern": "^[A-Za-z0-9_-]{1,16}$"
},
"from": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"to": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"advance": {
"type": "array",
"items": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 8
},
{
"type": "null"
}
]
},
"minItems": 2,
"maxItems": 2
}
},
"required": [
"id",
"from",
"to",
"advance"
]
},
"minItems": 0,
"maxItems": 16
},
"stocks": {
"type": "array",
"items": {
"type": "object",
"additionalProperties": false,
"properties": {
"id": {
"type": "string",
"pattern": "^[A-Za-z0-9_-]{1,16}$"
},
"location": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"time": {
"type": "array",
"items": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 32
},
{
"type": "null"
}
]
},
"minItems": 2,
"maxItems": 2
},
"count": {
"anyOf": [
{
"type": "integer",
"minimum": -1000000,
"maximum": 1000000
},
{
"type": "null"
}
]
}
},
"required": [
"id",
"location",
"time",
"count"
]
},
"minItems": 0,
"maxItems": 16
},
"queries": {
"type": "array",
"items": {
"type": "object",
"additionalProperties": false,
"properties": {
"id": {
"type": "string",
"pattern": "^[A-Za-z0-9_-]{1,16}$"
},
"location": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"time": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 128
},
"minItems": 2,
"maxItems": 2
},
"claimed_blocked": {
"type": "boolean"
}
},
"required": [
"id",
"location",
"time",
"claimed_blocked"
]
},
"minItems": 1,
"maxItems": 16
}
},
"required": [
"snapshot_kind",
"locations",
"graph_complete",
"stock_complete",
"edges",
"stocks",
"queries"
]
}Veröffentlichtes Eingabebeispiel
{
"snapshot_kind": "reconciled_global_stock",
"locations": 3,
"graph_complete": true,
"stock_complete": true,
"edges": [
{
"id": "a",
"from": 0,
"to": 1,
"advance": [
1,
0
]
},
{
"id": "b",
"from": 1,
"to": 2,
"advance": [
0,
2
]
}
],
"stocks": [
{
"id": "s",
"location": 0,
"time": [
1,
1
],
"count": 1
}
],
"queries": [
{
"id": "q",
"location": 2,
"time": [
2,
3
],
"claimed_blocked": true
}
]
}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