Datenvertragswerk
geodesic seed hull ledger
Construct the COMPLETE GEODESIC CONVEX HULL H_G(S) of ONE independently supplied original seed vertex set S in a connected simple undirected labelled graph G. Original n=1..4, labels0..n-1, edge_mask uses lexicographic pairs(0,1),(0,2),.,(n-2,n-1); seed_mask bitv denotes original vertexv. H is the smallest superset of S closed under EVERY vertex on EVERY shortest path between EACH pair of its vertices; apply closure to fixedpoint, not arbitrary single shortest paths. Empty seed has empty.
POST https://datenvertrag.halowerk.com/v1/geodesic-seed-hull-ledgerInputs
| Field | Type | Required | Description |
|---|---|---|---|
| n | See schema | Yes | |
| edge_mask | See schema | Yes | |
| seed_mask | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"n": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 4
},
{
"type": "null"
}
]
},
"edge_mask": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 63
},
{
"type": "null"
}
]
},
"seed_mask": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 15
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 15
},
{
"type": "null"
}
]
}
},
"required": [
"n",
"edge_mask",
"seed_mask",
"claim"
],
"additionalProperties": false
}Published input example
{
"n": 1,
"edge_mask": 0,
"seed_mask": 0,
"claim": 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.