HALOWERKDatenvertragswerk
rational radix expansion audit
For a supplied exact signed rational and base2..16, return integer digits, shortest nonrepeating fractional prefix, minimal repeating block, reduced fraction and full finite remainder-cycle witness, then compare the entire canonical expansion claim. Terminating expansions have an empty repeat block; infinite zero or maximal-digit alternatives are not the declared canonical form. Numerator-10000..10000, denominator1..128. Missing numerator/denominator leaves the expansion unknown; missing.
POST https://datenvertrag.halowerk.com/v1/rational-radix-expansion-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| numerator | Siehe Schema | Ja | |
| denominator | Siehe Schema | Ja | |
| base | integer | Ja | |
| claimed | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"numerator": {
"anyOf": [
{
"type": "integer",
"minimum": -10000,
"maximum": 10000
},
{
"type": "null"
}
]
},
"denominator": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 128
},
{
"type": "null"
}
]
},
"base": {
"type": "integer",
"minimum": 2,
"maximum": 16
},
"claimed": {
"anyOf": [
{
"type": "object",
"properties": {
"sign": {
"enum": [
-1,
0,
1
]
},
"integer_digits": {
"type": "array",
"maxItems": 14,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
},
"minItems": 1
},
"nonrepeating_digits": {
"type": "array",
"maxItems": 128,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
}
},
"repeating_digits": {
"type": "array",
"maxItems": 128,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
}
}
},
"required": [
"sign",
"integer_digits",
"nonrepeating_digits",
"repeating_digits"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"numerator",
"denominator",
"base",
"claimed"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"numerator": 1,
"denominator": 6,
"base": 10,
"claimed": {
"sign": 1,
"integer_digits": [
0
],
"nonrepeating_digits": [
1
],
"repeating_digits": [
6
]
}
}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