HALOWERKDatenvertragswerk
pgoutput transaction scope audit
Reconstruct bounded nonstreaming Begin/Commit transaction scopes and check Origin-before-DML plus announced-relation use in supplied normalized pgoutput messages. Null capture stops interpretation; earlier contradictions survive. No binary parsing,streaming,two-phase or database execution. Fixed0.003USDC also for schema-valid unknown; invalid input is native400 before settlement. Serialized input16KiB/data32KiB.
POST https://datenvertrag.halowerk.com/v1/pgoutput-transaction-scope-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| capture_complete | boolean | Ja | |
| initial_relations | array | Ja | |
| messages | array | Ja |
Vollständiges Eingabeschema anzeigen
{
"additionalProperties": false,
"properties": {
"capture_complete": {
"type": "boolean"
},
"initial_relations": {
"items": {
"pattern": "^[A-Za-z0-9_-]{1,16}$",
"type": "string"
},
"maxItems": 8,
"type": "array",
"uniqueItems": true
},
"messages": {
"items": {
"anyOf": [
{
"type": "null"
},
{
"additionalProperties": false,
"properties": {
"kind": {
"enum": [
"begin",
"relation",
"origin",
"dml",
"commit"
]
},
"token": {
"anyOf": [
{
"pattern": "^[A-Za-z0-9_-]{1,16}$",
"type": "string"
},
{
"type": "null"
}
]
}
},
"required": [
"kind",
"token"
],
"type": "object"
}
]
},
"maxItems": 32,
"type": "array"
}
},
"required": [
"capture_complete",
"initial_relations",
"messages"
],
"type": "object"
}Veröffentlichtes Eingabebeispiel
{
"capture_complete": true,
"initial_relations": [],
"messages": [
{
"kind": "begin",
"token": "T"
},
{
"kind": "relation",
"token": "R"
},
{
"kind": "origin",
"token": "O"
},
{
"kind": "dml",
"token": "R"
},
{
"kind": "commit",
"token": null
}
]
}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