Datenvertragswerk
conway nimber product ledger
Computes the exact Conway nim-product of two supplied finite nimbers in the canonical integer numbering 0..15, defined by Conway/Sloane 1986 Lexicographic Codes Section 2.9 equation 6: a tensor b = MEX{(i tensor b) XOR (a tensor j) XOR (i tensor j): 0<=i<a, 0<=j<b}. Addition in this field is XOR; multiplication is not the integer product, bitwise AND, XOR or the ordinary unreduced binary polynomial product. Returns the product scalar.
POST https://datenvertrag.halowerk.com/v1/conway-nimber-product-ledgerInputs
| Field | Type | Required | Description |
|---|---|---|---|
| left | See schema | Yes | |
| right | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"left": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 15
},
{
"type": "null"
}
]
},
"right": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 15
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 15
},
{
"type": "null"
}
]
}
},
"required": [
"left",
"right",
"claim"
],
"additionalProperties": false
}Published input example
{
"left": 0,
"right": 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.