HALOWERKDatenvertragswerk
transaction fragment rank audit
Check a supplied multi-collection CDC transaction fragment set against END event counts and coupled global/per-collection ordinal positions before downstream assembly. Caller groups normalized fragments first;raw BEGIN/END IDs are never inferred. Missing evidence remains unknown;known rank/count contradictions take precedence. Schema-valid unknown has the same fixed price;invalid input requires nativeHTTP400 before settlement. A schema-valid unknown is a successful result at the same fixed.
POST https://datenvertrag.halowerk.com/v1/transaction-fragment-rank-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| transaction | string | Ja | |
| fragments_complete | boolean | Ja | |
| end | Siehe Schema | Ja | |
| fragments | array | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"properties": {
"transaction": {
"type": "string",
"pattern": "^[A-Za-z0-9_-]{1,16}$"
},
"fragments_complete": {
"type": "boolean"
},
"end": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"properties": {
"event_count": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 64
},
{
"type": "null"
}
]
},
"data_collections": {
"anyOf": [
{
"type": "array",
"items": {
"type": "object",
"additionalProperties": false,
"properties": {
"collection": {
"type": "string",
"pattern": "^[A-Za-z0-9_-]{1,16}$"
},
"event_count": {
"type": "integer",
"minimum": 1,
"maximum": 64
}
},
"required": [
"collection",
"event_count"
]
},
"minItems": 0,
"maxItems": 16
},
{
"type": "null"
}
]
}
},
"required": [
"event_count",
"data_collections"
]
},
{
"type": "null"
}
]
},
"fragments": {
"type": "array",
"items": {
"type": "object",
"additionalProperties": false,
"properties": {
"id": {
"type": "string",
"pattern": "^[A-Za-z0-9_-]{1,16}$"
},
"collection": {
"anyOf": [
{
"type": "string",
"pattern": "^[A-Za-z0-9_-]{1,16}$"
},
{
"type": "null"
}
]
},
"total_order": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 64
},
{
"type": "null"
}
]
},
"data_collection_order": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 64
},
{
"type": "null"
}
]
}
},
"required": [
"id",
"collection",
"total_order",
"data_collection_order"
]
},
"minItems": 0,
"maxItems": 64
}
},
"required": [
"transaction",
"fragments_complete",
"end",
"fragments"
]
}Veröffentlichtes Eingabebeispiel
{
"transaction": "TX",
"fragments_complete": true,
"end": {
"event_count": 3,
"data_collections": [
{
"collection": "A",
"event_count": 2
},
{
"collection": "B",
"event_count": 1
}
]
},
"fragments": [
{
"id": "F1",
"collection": "A",
"total_order": 1,
"data_collection_order": 1
},
{
"id": "F2",
"collection": "B",
"total_order": 2,
"data_collection_order": 1
},
{
"id": "F3",
"collection": "A",
"total_order": 3,
"data_collection_order": 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