Datenvertragswerk
rational point configuration secondary fan
Construct the ENTIRE pointed secondary fan of an ordered strictly convex rational planar4..6point configuration, modulo affine height functions: all primitive hinge-lift rays, every regular triangulation chamber, exact GKZ twice-area coordinates, strict interior height witnesses, every cone face and chamber incidence, and full cover relations. Gauge fixes first3heights to0; use lower-hull/minimization convention. Retain all regular triangulations, not just one Euclidean Delaunay.
POST https://datenvertrag.halowerk.com/v1/rational-point-configuration-secondary-fanInputs
| Field | Type | Required | Description |
|---|---|---|---|
| points | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"additionalProperties": false,
"required": [
"points",
"claim"
],
"properties": {
"points": {
"anyOf": [
{
"type": "array",
"minItems": 4,
"maxItems": 6,
"items": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"enum": [
"-1/1",
"-1/2",
"-2/1",
"-3/1",
"-3/2",
"0/1",
"1/1",
"1/2",
"2/1",
"3/1",
"3/2"
]
}
}
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"dimension",
"diagonals",
"rays",
"chambers",
"faces",
"covers",
"f_vector",
"complete"
],
"properties": {
"dimension": {
"type": "integer",
"minimum": 1,
"maximum": 3
},
"diagonals": {
"type": "array",
"minItems": 2,
"maxItems": 9,
"items": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
}
}
},
"rays": {
"type": "array",
"minItems": 2,
"maxItems": 9,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"type": "integer",
"minimum": -200000,
"maximum": 200000
}
}
},
"chambers": {
"type": "array",
"minItems": 2,
"maxItems": 14,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"triangles",
"gkz_twice_area",
"rays",
"height_witness"
],
"properties": {
"triangles": {
"type": "array",
"minItems": 2,
"maxItems": 4,
"items": {
"type": "array",
"minItems": 3,
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
}
}
},
"gkz_twice_area": {
"type": "array",
"minItems": 4,
"maxItems": 6,
"items": {
"type": "string",
"maxLength": 8,
"pattern": "^(0|-?[1-9][0-9]*)/[1-9][0-9]*$"
}
},
"rays": {
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 8
}
},
"height_witness": {
"type": "array",
"minItems": 4,
"maxItems": 6,
"items": {
"type": "integer",
"minimum": -600000,
"maximum": 600000
}
}
}
}
},
"faces": {
"type": "array",
"minItems": 3,
"maxItems": 45,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"rays",
"dimension",
"chambers"
],
"properties": {
"rays": {
"type": "array",
"minItems": 0,
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 8
}
},
"dimension": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"chambers": {
"type": "array",
"minItems": 1,
"maxItems": 14,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 13
}
}
}
}
},
"covers": {
"type": "array",
"minItems": 2,
"maxItems": 100,
"items": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 44
}
}
},
"f_vector": {
"type": "array",
"minItems": 2,
"maxItems": 4,
"items": {
"type": "integer",
"minimum": 1,
"maximum": 45
}
},
"complete": {
"const": true
}
}
},
{
"type": "null"
}
]
}
}
}Published input example
{
"points": [
[
"0/1",
"0/1"
],
[
"2/1",
"0/1"
],
[
"2/1",
"2/1"
],
[
"0/1",
"2/1"
]
],
"claim": null
}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.