HALOWERKDatenvertragswerk
farey neighbor inventory
For an order from 1 to 24, return every reduced rational in the closed interval [0,1] whose denominator is at most the order, in increasing numeric order. Return all consecutive index pairs, their determinant and their exact reduced gap. Compare the entire ordered canonical numerator-denominator claim. No floating-point approximation or modular-residue reconstruction. Missing order or claim stays unknown, retaining any computable inventory. Malformed input returns native400 before.
POST https://datenvertrag.halowerk.com/v1/farey-neighbor-inventoryEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| order | Siehe Schema | Ja | |
| claimed_terms | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"order",
"claimed_terms"
],
"properties": {
"order": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 24
},
{
"type": "null"
}
]
},
"claimed_terms": {
"anyOf": [
{
"type": "array",
"maxItems": 181,
"items": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": [
{
"type": "integer",
"minimum": 0,
"maximum": 24
},
{
"type": "integer",
"minimum": 1,
"maximum": 24
}
],
"additionalItems": false
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"order": 5,
"claimed_terms": [
[
0,
1
],
[
1,
5
],
[
1,
4
],
[
1,
3
],
[
2,
5
],
[
1,
2
],
[
3,
5
],
[
2,
3
],
[
3,
4
],
[
4,
5
],
[
1,
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