HALOWERKDatenvertragswerk
precedence order index ledger
For0..8anonymousvertices and completeDAGprecedenceedges, rank suppliedpermutation among alllexsortedtopologicalorders and independentlyunrank suppliedindex. Return exacttotal, fullorders and everycandidatevertex/completioncount at eachprefix. Cycles/inconsistentprovidedorders invalid400; missingedges/word/index/claim staysunknown retaininganyavailableoperation. Claimcomparesrankonly. Fixed.003USDC alsovalidunknown; no execution/schedulingqualityclaim.
POST https://datenvertrag.halowerk.com/v1/precedence-order-index-ledgerEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| vertices | integer | Ja | |
| edges | Siehe Schema | Ja | |
| word | Siehe Schema | Ja | |
| index | Siehe Schema | Ja | |
| claimed_rank | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"vertices",
"edges",
"word",
"index",
"claimed_rank"
],
"properties": {
"vertices": {
"type": "integer",
"minimum": 0,
"maximum": 8
},
"edges": {
"anyOf": [
{
"type": "array",
"maxItems": 28,
"items": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 7
}
}
},
{
"type": "null"
}
]
},
"word": {
"anyOf": [
{
"type": "array",
"maxItems": 8,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 7
}
},
{
"type": "null"
}
]
},
"index": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 40319
},
{
"type": "null"
}
]
},
"claimed_rank": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 40319
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"vertices": 4,
"edges": [
[
0,
2
],
[
1,
2
],
[
1,
3
]
],
"word": [
1,
0,
2,
3
],
"index": 3,
"claimed_rank": 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