Datenvertragswerk
two square lattice shell inventory
For an integer norm from 0 to 1024, return every ordered signed integer pair (x,y) satisfying x*x+y*y=norm, sorted by x then y. Partition points by sign changes and coordinate exchange, with canonical nonnegative representative a<=b; return each full orbit, coordinate gcd and primitive flag(gcd=1), and total/primitive point counts. Zero has exactly point(0,0), gcd0 and nonprimitive flag. A norm with no representation has a known empty shell. Compare the entire ordered canonical signed point.
POST https://datenvertrag.halowerk.com/v1/two-square-lattice-shell-inventoryEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| norm | Siehe Schema | Ja | |
| claimed_points | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"norm",
"claimed_points"
],
"properties": {
"norm": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 1024
},
{
"type": "null"
}
]
},
"claimed_points": {
"anyOf": [
{
"type": "array",
"maxItems": 24,
"items": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"type": "integer",
"minimum": -32,
"maximum": 32
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"norm": 325,
"claimed_points": [
[
-18,
-1
],
[
-18,
1
],
[
-17,
-6
],
[
-17,
6
],
[
-15,
-10
],
[
-15,
10
],
[
-10,
-15
],
[
-10,
15
],
[
-6,
-17
],
[
-6,
17
],
[
-1,
-18
],
[
-1,
18
],
[
1,
-18
],
[
1,
18
],
[
6,
-17
],
[
6,
17
],
[
10,
-15
],
[
10,
15
],
[
15,
-10
],
[
15,
10
],
[
17,
-6
],
[
17,
6
],
[
18,
-1
],
[
18,
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