Datenvertragswerk
finite crossed module nonabelian cohomology
For a captured crossed module boundary:H->P of finite groups each order1..3 with identity0 and left action A:P->Aut(H), compute the COMPLETE normalized weak C2-cocycle orbit operator for TRIVIAL external C2 action. Tables retain original labels and must be square closed groups; validate boundary homomorphism, action automorphisms/homomorphism, boundary equivariance and Peiffer A(boundary(h))(k)=h*k*h^-1. Cocycle(a,b) in P x H satisfies boundary(b)=a*a and A(a)(b)=b. Gauge(p,r) sends it to.
POST https://datenvertrag.halowerk.com/v1/finite-crossed-module-nonabelian-cohomologyInputs
| Field | Type | Required | Description |
|---|---|---|---|
| crossed_module | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"crossed_module": {
"anyOf": [
{
"type": "object",
"properties": {
"h_table": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 1,
"maxItems": 3
},
"minItems": 1,
"maxItems": 3
},
"p_table": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 1,
"maxItems": 3
},
"minItems": 1,
"maxItems": 3
},
"boundary": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 1,
"maxItems": 3
},
"left_action": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 1,
"maxItems": 3
},
"minItems": 1,
"maxItems": 3
}
},
"required": [
"h_table",
"p_table",
"boundary",
"left_action"
],
"additionalProperties": false
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"cocycles": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 2,
"maxItems": 2
},
"minItems": 1,
"maxItems": 9
},
"gauges": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 2,
"maxItems": 2
},
"minItems": 1,
"maxItems": 9
},
"gauge_action": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 8
},
"minItems": 1,
"maxItems": 9
},
"minItems": 1,
"maxItems": 9
},
"classes": {
"type": "array",
"items": {
"type": "object",
"properties": {
"representative_index": {
"type": "integer",
"minimum": 0,
"maximum": 8
},
"member_indices": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 8
},
"minItems": 1,
"maxItems": 9
},
"gauge_witness_indices": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 8
},
"minItems": 1,
"maxItems": 9
},
"stabilizer_gauge_indices": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 8
},
"minItems": 1,
"maxItems": 9
}
},
"required": [
"representative_index",
"member_indices",
"gauge_witness_indices",
"stabilizer_gauge_indices"
],
"additionalProperties": false
},
"minItems": 1,
"maxItems": 9
},
"cohomology_class_count": {
"type": "integer",
"minimum": 1,
"maximum": 9
},
"basepoint_class_index": {
"const": 0,
"type": "integer"
}
},
"required": [
"cocycles",
"gauges",
"gauge_action",
"classes",
"cohomology_class_count",
"basepoint_class_index"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"crossed_module",
"claim"
],
"additionalProperties": false
}Published input example
{
"crossed_module": {
"h_table": [
[
0,
1,
2
],
[
1,
2,
0
],
[
2,
0,
1
]
],
"p_table": [
[
0,
1
],
[
1,
0
]
],
"boundary": [
0,
0,
0
],
"left_action": [
[
0,
1,
2
],
[
0,
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.