HALOWERKDatenvertragswerk
two rate three color ledger
Own bounded RFC2698 Informational trTCM replay. Full buckets at time0; integer-second normalized packet events and supplied IP-byte lengths; independent peak/committed refill and color-aware or blind marking. Return every interpreted mark, exact after-balances and whole claim correspondence. Lost packet stops interpretation; earlier mismatch survives unknown. No packet/header/clock/QoS/precolor truth or DS-bit verification. Fixed0.003USDC also for schema-valid unknown; invalid profile.
POST https://datenvertrag.halowerk.com/v1/two-rate-three-color-ledgerEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| capture_complete | boolean | Ja | |
| cbs | integer | Ja | |
| cir | integer | Ja | |
| claimed_marks | Siehe Schema | Ja | |
| mode | Siehe Schema | Ja | |
| packets | array | Ja | |
| pbs | integer | Ja | |
| pir | integer | Ja |
Vollständiges Eingabeschema anzeigen
{
"additionalProperties": false,
"properties": {
"capture_complete": {
"type": "boolean"
},
"cbs": {
"maximum": 1000000,
"minimum": 1,
"type": "integer"
},
"cir": {
"maximum": 1000000,
"minimum": 1,
"type": "integer"
},
"claimed_marks": {
"anyOf": [
{
"items": {
"enum": [
"green",
"yellow",
"red"
]
},
"maxItems": 32,
"type": "array"
},
{
"type": "null"
}
]
},
"mode": {
"enum": [
"blind",
"aware"
]
},
"packets": {
"items": {
"anyOf": [
{
"type": "null"
},
{
"additionalProperties": false,
"properties": {
"incoming": {
"enum": [
"green",
"yellow",
"red"
]
},
"size": {
"maximum": 1000000,
"minimum": 1,
"type": "integer"
},
"time": {
"maximum": 1000000,
"minimum": 0,
"type": "integer"
}
},
"required": [
"time",
"size",
"incoming"
],
"type": "object"
}
]
},
"maxItems": 32,
"type": "array"
},
"pbs": {
"maximum": 1000000,
"minimum": 1,
"type": "integer"
},
"pir": {
"maximum": 1000000,
"minimum": 1,
"type": "integer"
}
},
"required": [
"capture_complete",
"mode",
"cir",
"pir",
"cbs",
"pbs",
"packets",
"claimed_marks"
],
"type": "object"
}Veröffentlichtes Eingabebeispiel
{
"capture_complete": true,
"cbs": 2,
"cir": 1,
"claimed_marks": [
"green",
"green"
],
"mode": "blind",
"packets": [
{
"incoming": "green",
"size": 2,
"time": 0
},
{
"incoming": "green",
"size": 1,
"time": 1
}
],
"pbs": 4,
"pir": 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