HALOWERKDatenvertragswerk
permutation square root inventory audit
For a supplied permutation of1..7anonymous labels0..n-1, reconstruct every permutation q with q[q[i]]=p[i], lexicographically sorted, complete canonical source cycles and root count. Compare the entire ordered claimed-root inventory; null input or missing claim is unknown. No random sampling, cryptographic or observed external state. Fixed0.003USDC also for valid unknown.
POST https://datenvertrag.halowerk.com/v1/permutation-square-root-inventory-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| permutation | Siehe Schema | Ja | |
| claimed_roots | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"permutation",
"claimed_roots"
],
"properties": {
"permutation": {
"anyOf": [
{
"type": "array",
"minItems": 1,
"maxItems": 7,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 6
}
},
{
"type": "null"
}
]
},
"claimed_roots": {
"anyOf": [
{
"type": "array",
"maxItems": 232,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 7,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 6
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"permutation": [
1,
0,
3,
2
],
"claimed_roots": [
[
2,
3,
1,
0
],
[
3,
2,
0,
1
]
]
}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