HALOWERKDatenvertragswerk
finite field recurrence space
For a complete supplied finite residue sequence, find its minimum linear recurrence order over one selected prime field. Return a particular coefficient vector, free-column-normalized nullspace basis, exact number of compatible coefficients, zero residual witnesses and conditional one-step value space. Coefficient j multiplies sequence[t-1-j]; free coordinates of the particular vector are zero. The next-space result is conditional on minimum-order continuation and is never an observed future.
POST https://datenvertrag.halowerk.com/v1/finite-field-recurrence-spaceEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| prime | Siehe Schema | Ja | |
| sequence | array | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"prime": {
"enum": [
2,
3,
5,
7,
11,
17,
257
]
},
"sequence": {
"type": "array",
"maxItems": 32,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 256
}
}
},
"required": [
"prime",
"sequence"
],
"additionalProperties": false,
"allOf": [
{
"if": {
"properties": {
"prime": {
"const": 2
}
}
},
"then": {
"properties": {
"sequence": {
"items": {
"maximum": 1
}
}
}
}
},
{
"if": {
"properties": {
"prime": {
"const": 3
}
}
},
"then": {
"properties": {
"sequence": {
"items": {
"maximum": 2
}
}
}
}
},
{
"if": {
"properties": {
"prime": {
"const": 5
}
}
},
"then": {
"properties": {
"sequence": {
"items": {
"maximum": 4
}
}
}
}
},
{
"if": {
"properties": {
"prime": {
"const": 7
}
}
},
"then": {
"properties": {
"sequence": {
"items": {
"maximum": 6
}
}
}
}
},
{
"if": {
"properties": {
"prime": {
"const": 11
}
}
},
"then": {
"properties": {
"sequence": {
"items": {
"maximum": 10
}
}
}
}
},
{
"if": {
"properties": {
"prime": {
"const": 17
}
}
},
"then": {
"properties": {
"sequence": {
"items": {
"maximum": 16
}
}
}
}
},
{
"if": {
"properties": {
"prime": {
"const": 257
}
}
},
"then": {
"properties": {
"sequence": {
"items": {
"maximum": 256
}
}
}
}
}
]
}Veröffentlichtes Eingabebeispiel
{
"prime": 5,
"sequence": [
0,
1,
1,
2,
3,
0
]
}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