HALOWERKDatenvertragswerk
prime power root forest audit
For integerpolynomial coefficients in ascendingpowers, p2/3/5 and exponents1..3, reconstruct ALL residue roots at everyprimepower, including singular0/1/p-child branches and deadends. Return orderedlevels and everyparent with derivative/quotient modulo p, childdigits and children. Compare wholeordered finalrootclaim. Nullcoefficients or claim is unknown. Fixed0.003USDC alsovalidunknown; no cryptographic or infinitep-adicclaim.
POST https://datenvertrag.halowerk.com/v1/prime-power-root-forest-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| prime | Siehe Schema | Ja | |
| exponent | integer | Ja | |
| coefficients | 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": [
"prime",
"exponent",
"coefficients",
"claimed_roots"
],
"properties": {
"prime": {
"enum": [
2,
3,
5
]
},
"exponent": {
"type": "integer",
"minimum": 1,
"maximum": 3
},
"coefficients": {
"anyOf": [
{
"type": "array",
"minItems": 1,
"maxItems": 5,
"items": {
"type": "integer",
"minimum": -20,
"maximum": 20
}
},
{
"type": "null"
}
]
},
"claimed_roots": {
"anyOf": [
{
"type": "array",
"maxItems": 125,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 124
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"prime": 3,
"exponent": 3,
"coefficients": [
13,
-4,
1
],
"claimed_roots": []
}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