HALOWERKDatenvertragswerk
multiset permutation index audit
Own bounded exact multinomial-prefix rank/unrank for numeric labels0..k-1, total multiplicity<=12. Return distinct permutation count, supplied wholeword rank, selected word at requested rank and complete selection-block trace; compare entire claim. Missing word/request leaves separate known fields and unknownstate unless another claim field contradicts them. No Sage,collation,locale or program execution. Fixed0.003USDC also for schema-valid unknown; invalid counts/wordmultiset/rank native400.
POST https://datenvertrag.halowerk.com/v1/multiset-permutation-index-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| claimed | Siehe Schema | Ja | |
| counts | array | Ja | |
| requested_rank | Siehe Schema | Ja | |
| word | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"additionalProperties": false,
"properties": {
"claimed": {
"anyOf": [
{
"additionalProperties": false,
"properties": {
"cardinality": {
"maximum": 479001600,
"minimum": 1,
"type": "integer"
},
"selected_word": {
"anyOf": [
{
"items": {
"maximum": 11,
"minimum": 0,
"type": "integer"
},
"maxItems": 12,
"type": "array"
},
{
"type": "null"
}
]
},
"word_rank": {
"anyOf": [
{
"maximum": 479001599,
"minimum": 0,
"type": "integer"
},
{
"type": "null"
}
]
}
},
"required": [
"cardinality",
"word_rank",
"selected_word"
],
"type": "object"
},
{
"type": "null"
}
]
},
"counts": {
"items": {
"maximum": 12,
"minimum": 0,
"type": "integer"
},
"maxItems": 12,
"type": "array"
},
"requested_rank": {
"anyOf": [
{
"maximum": 479001599,
"minimum": 0,
"type": "integer"
},
{
"type": "null"
}
]
},
"word": {
"anyOf": [
{
"items": {
"maximum": 11,
"minimum": 0,
"type": "integer"
},
"maxItems": 12,
"type": "array"
},
{
"type": "null"
}
]
}
},
"required": [
"counts",
"word",
"requested_rank",
"claimed"
],
"type": "object"
}Veröffentlichtes Eingabebeispiel
{
"claimed": {
"cardinality": 3,
"selected_word": [
1,
0,
0
],
"word_rank": 1
},
"counts": [
2,
1
],
"requested_rank": 2,
"word": [
0,
1,
0
]
}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