HALOWERKDatenvertragswerk
aligned record cut audit
A 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 identities are source(channel,position) occurrences. No compiled peer machine or actual Flink/state-backend execution. Missing capture remains unknown;invalid profile HTTP400 before settlement. Successful unknown also costs0.003USDC. A schema-valid unknown is.
POST https://datenvertrag.halowerk.com/v1/aligned-record-cut-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| channels | array | Ja | |
| reads | array | Ja | |
| reads_complete | boolean | Ja | |
| trigger_claim | Siehe Schema | Ja | |
| cut_claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"properties": {
"channels": {
"type": "array",
"items": {
"type": "object",
"additionalProperties": false,
"properties": {
"complete": {
"type": "boolean"
},
"items": {
"type": "array",
"items": {
"enum": [
"record",
"barrier"
]
},
"minItems": 0,
"maxItems": 16
}
},
"required": [
"complete",
"items"
]
},
"minItems": 2,
"maxItems": 4
},
"reads": {
"type": "array",
"items": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 3
},
{
"type": "null"
}
]
},
"minItems": 0,
"maxItems": 32
},
"reads_complete": {
"type": "boolean"
},
"trigger_claim": {
"oneOf": [
{
"type": "object",
"additionalProperties": false,
"properties": {
"known": {
"const": true
},
"value": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 63
},
{
"type": "null"
}
]
}
},
"required": [
"known",
"value"
]
},
{
"type": "object",
"additionalProperties": false,
"properties": {
"known": {
"const": false
},
"value": {
"type": "null"
}
},
"required": [
"known",
"value"
]
}
]
},
"cut_claim": {
"oneOf": [
{
"type": "object",
"additionalProperties": false,
"properties": {
"known": {
"const": true
},
"value": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": [
{
"type": "integer",
"minimum": 0,
"maximum": 3
},
{
"type": "integer",
"minimum": 0,
"maximum": 31
}
],
"minItems": 2,
"maxItems": 2,
"additionalItems": false
},
"minItems": 0,
"maxItems": 128
},
{
"type": "null"
}
]
}
},
"required": [
"known",
"value"
]
},
{
"type": "object",
"additionalProperties": false,
"properties": {
"known": {
"const": false
},
"value": {
"type": "null"
}
},
"required": [
"known",
"value"
]
}
]
}
},
"required": [
"channels",
"reads",
"reads_complete",
"trigger_claim",
"cut_claim"
],
"$schema": "http://json-schema.org/draft-07/schema#"
}Veröffentlichtes Eingabebeispiel
{
"channels": [
{
"complete": true,
"items": [
"record",
"barrier",
"record"
]
},
{
"complete": true,
"items": [
"record",
"barrier",
"record"
]
}
],
"reads": [
0,
0,
1,
1
],
"reads_complete": true,
"trigger_claim": {
"known": true,
"value": 3
},
"cut_claim": {
"known": true,
"value": [
[
0,
0
],
[
1,
0
]
]
}
}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
array subscript section trace
POSThttps://datenvertrag.halowerk.com/v1/array-subscript-section-traceFrom an already decoded rectangular integer-or-null array with explicit lower bounds, resolve PostgreSQL-style element or mixed rectangular slice access and return complete source offsets, coordinates and selected values. A colon switches e