HALOWERKDatenvertragswerk
minimum final observation suite family
Given two permutation actions on n1..4 original states0..n-1 and binary Mooreoutputs, use the FIXED ordered wordcatalog [empty,0,1,00,01,10,11], indexed0..6. Each testword starts independently at the same hypothetical originalstate and observes ONLY its finalstate output; no intermediate outputs or realdevice reset/execution. A suite is an ascending set of distinct wordindices; its state signature concatenates these finalbits. Synthesize ALL suites of minimum CARDINALITY whose signatures.
POST https://datenvertrag.halowerk.com/v1/minimum-final-observation-suite-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| actions | Siehe Schema | Ja | |
| outputs | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"actions": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 1,
"maxItems": 4
},
"minItems": 2,
"maxItems": 2
},
{
"type": "null"
}
]
},
"outputs": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"minItems": 1,
"maxItems": 4
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"families": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 6
},
"minItems": 0,
"maxItems": 7
},
"minItems": 0,
"maxItems": 20
},
"signatures": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"minItems": 0,
"maxItems": 7
},
"minItems": 1,
"maxItems": 4
},
"minItems": 0,
"maxItems": 20
},
"minimum_size": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 7
},
{
"type": "null"
}
]
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 20
}
},
"required": [
"families",
"signatures",
"minimum_size",
"count"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"actions",
"outputs",
"claim"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"actions": [
[
0
],
[
0
]
],
"outputs": [
0
],
"claim": {
"families": [
[]
],
"signatures": [
[
[]
]
],
"minimum_size": 0,
"count": 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