Datenvertragswerk
instant selector staleness audit
From original ordered synthetic series samples, evaluation times, positive lookback and nonnegative offset reconstruct complete instant-selector source-point selections, suppress latest stale markers without fallback, and resume after a new sample. 1..3anonymous float-series,0..100synthetic integer milliseconds,1..8samples/series,1..6evaluation times. Strict lower lookback bound and inclusive upper bound. At most one missing stale capture retains false/true whole source worlds;null claim.
POST https://datenvertrag.halowerk.com/v1/instant-selector-staleness-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| series | array | Ja | |
| evaluation_ms | array | Ja | |
| lookback_ms | integer | Ja | |
| offset_ms | integer | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"series",
"evaluation_ms",
"lookback_ms",
"offset_ms",
"claim"
],
"properties": {
"series": {
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 8,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"time_ms",
"value",
"stale"
],
"properties": {
"time_ms": {
"type": "integer",
"minimum": 0,
"maximum": 100
},
"value": {
"type": "integer",
"minimum": -9,
"maximum": 9
},
"stale": {
"anyOf": [
{
"type": "boolean"
},
{
"type": "null"
}
]
}
}
}
}
},
"evaluation_ms": {
"type": "array",
"minItems": 1,
"maxItems": 6,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 100
}
},
"lookback_ms": {
"type": "integer",
"minimum": 1,
"maximum": 50
},
"offset_ms": {
"type": "integer",
"minimum": 0,
"maximum": 50
},
"claim": {
"anyOf": [
{
"type": "array",
"minItems": 1,
"maxItems": 6,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"evaluation_ms",
"effective_ms",
"selections"
],
"properties": {
"evaluation_ms": {
"type": "integer",
"minimum": 0,
"maximum": 100
},
"effective_ms": {
"type": "integer",
"minimum": -50,
"maximum": 100
},
"selections": {
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"index",
"time_ms",
"value"
],
"properties": {
"index": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 7
},
{
"type": "null"
}
]
},
"time_ms": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 100
},
{
"type": "null"
}
]
},
"value": {
"anyOf": [
{
"type": "integer",
"minimum": -9,
"maximum": 9
},
{
"type": "null"
}
]
}
}
}
}
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"series": [
[
{
"time_ms": 0,
"value": 1,
"stale": false
},
{
"time_ms": 5,
"value": 2,
"stale": false
},
{
"time_ms": 10,
"value": 3,
"stale": false
}
]
],
"evaluation_ms": [
5,
8,
10,
14
],
"lookback_ms": 4,
"offset_ms": 0,
"claim": [
{
"evaluation_ms": 5,
"effective_ms": 5,
"selections": [
{
"index": 1,
"time_ms": 5,
"value": 2
}
]
},
{
"evaluation_ms": 8,
"effective_ms": 8,
"selections": [
{
"index": 1,
"time_ms": 5,
"value": 2
}
]
},
{
"evaluation_ms": 10,
"effective_ms": 10,
"selections": [
{
"index": 2,
"time_ms": 10,
"value": 3
}
]
},
{
"evaluation_ms": 14,
"effective_ms": 14,
"selections": [
{
"index": null,
"time_ms": null,
"value": 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