Datenvertragswerk
affine floor sum lattice ledger
Reconstruct the complete AFFINE FLOOR-SUM lattice ledger for original integers n0..8,m1..8,a0..8,b0..8. For each original column i=0..n-1, quotients[i]=floor((a*i+b)/m) and remainders[i]=a*i+b-m*quotients[i], with0<=remainder<m. prefix_sums contains n+1 entries: prefix_sums[0]=0 and prefix_sums[k]=SUM for i0..k-1 of quotients[i]. total=prefix_sums[n]. Equivalently total counts ALL integer pairs(i,y) with0<=i<n and1<=y and m*y<=a*i+b; boundary points INCLUDED and y=0 EXCLUDED. Thus.
POST https://datenvertrag.halowerk.com/v1/affine-floor-sum-lattice-ledgerInputs
| Field | Type | Required | Description |
|---|---|---|---|
| n | See schema | Yes | |
| m | See schema | Yes | |
| a | See schema | Yes | |
| b | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"n": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 8
},
{
"type": "null"
}
]
},
"m": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 8
},
{
"type": "null"
}
]
},
"a": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 8
},
{
"type": "null"
}
]
},
"b": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 8
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"quotients": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 64
},
"minItems": 0,
"maxItems": 8
},
"remainders": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 7
},
"minItems": 0,
"maxItems": 8
},
"prefix_sums": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 288
},
"minItems": 1,
"maxItems": 9
},
"total": {
"type": "integer",
"minimum": 0,
"maximum": 289
}
},
"required": [
"quotients",
"remainders",
"prefix_sums",
"total"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"n",
"m",
"a",
"b",
"claim"
],
"additionalProperties": false
}Published input example
{
"n": 0,
"m": 1,
"a": 0,
"b": 0,
"claim": {
"quotients": [],
"remainders": [],
"prefix_sums": [
0
],
"total": 0
}
}Result & documentation
Machine-readable documentation of this hub
Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.
More endpoints in this hub
- Datenvertragswerk0.003 USDC
acyclic automata probabilistic refinement witness
POSThttps://datenvertrag.halowerk.com/v1/acyclic-automata-probabilistic-refinement-witnessFor two finite action-labelled nondeterministic probabilistic automata return the WHOLE greatest DIRECTED STRONG SIMULATION relation, canonical single-transition matching couplings and exhaustive local negative Hall obstructions. Each of 1.
- Datenvertragswerk0.003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n in 1..5 and a monic degree-n integer polynomial det(xI-A), returns every labelled simple undirected graph on vertices 0..n-1 with exactly that adjacency characteristic polynomial. Coefficients are in descending degree order, n+1 ent
- 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.