HALOWERKDatenvertragswerk
bounded rational nearest audit
Own bounded exact rational bracketing, maxdenominator1024. Return all minimizing reduced fractions sorted numerically, exact absolute errors, greatest allowed lower and least allowed upper inclusive neighbors; compare whole claimlist by rational equivalence preserving duplicates. No Pythonlimit_denominator/float conversion/modular residue/Pade/library execution. Missing supplied target/bound remainsunknown. Fixed0.003USDC also for schema-valid unknown; invalid profile native400 before.
POST https://datenvertrag.halowerk.com/v1/bounded-rational-nearest-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| claimed_best | Siehe Schema | Ja | |
| denominator | Siehe Schema | Ja | |
| max_denominator | Siehe Schema | Ja | |
| numerator | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"additionalProperties": false,
"properties": {
"claimed_best": {
"anyOf": [
{
"items": {
"additionalProperties": false,
"properties": {
"denominator": {
"maximum": 1024,
"minimum": 1,
"type": "integer"
},
"numerator": {
"maximum": 1024000001,
"minimum": -1024000001,
"type": "integer"
}
},
"required": [
"numerator",
"denominator"
],
"type": "object"
},
"maxItems": 2,
"type": "array"
},
{
"type": "null"
}
]
},
"denominator": {
"anyOf": [
{
"maximum": 1000000,
"minimum": 1,
"type": "integer"
},
{
"type": "null"
}
]
},
"max_denominator": {
"anyOf": [
{
"maximum": 1024,
"minimum": 1,
"type": "integer"
},
{
"type": "null"
}
]
},
"numerator": {
"anyOf": [
{
"maximum": 1000000,
"minimum": -1000000,
"type": "integer"
},
{
"type": "null"
}
]
}
},
"required": [
"numerator",
"denominator",
"max_denominator",
"claimed_best"
],
"type": "object"
}Veröffentlichtes Eingabebeispiel
{
"claimed_best": [
{
"denominator": 1,
"numerator": -1
},
{
"denominator": 1,
"numerator": 0
}
],
"denominator": 2,
"max_denominator": 1,
"numerator": -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