HALOWERKDatenvertragswerk
prime field discrete log ledger
For supplied prime modulus2..251, nonzero basis and target residue, returns exact multiplicative order, all powers in exponent order0..order-1, target subgroup membership and canonical least nonnegative discrete logarithm if one exists. Targetzero is a known no-solution; null facts remain unknown. A whole order/existence/exponent claim is checked. Uses own factor-based order reduction and baby-step giant-step, not a library call. Anonymous tiny integers only: no keys, accounts, wallets or.
POST https://datenvertrag.halowerk.com/v1/prime-field-discrete-log-ledgerEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| modulus | Siehe Schema | Ja | |
| base | Siehe Schema | Ja | |
| target | Siehe Schema | Ja | |
| claimed | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"modulus": {
"enum": [
2,
3,
5,
7,
11,
13,
17,
19,
23,
29,
31,
37,
41,
43,
47,
53,
59,
61,
67,
71,
73,
79,
83,
89,
97,
101,
103,
107,
109,
113,
127,
131,
137,
139,
149,
151,
157,
163,
167,
173,
179,
181,
191,
193,
197,
199,
211,
223,
227,
229,
233,
239,
241,
251,
null
]
},
"base": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 250
},
{
"type": "null"
}
]
},
"target": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 250
},
{
"type": "null"
}
]
},
"claimed": {
"anyOf": [
{
"type": "null"
},
{
"type": "object",
"properties": {
"order": {
"type": "integer",
"minimum": 1,
"maximum": 250
},
"has_solution": {
"const": false
},
"least_exponent": {
"type": "null"
}
},
"required": [
"order",
"has_solution",
"least_exponent"
],
"additionalProperties": false
},
{
"type": "object",
"properties": {
"order": {
"type": "integer",
"minimum": 1,
"maximum": 250
},
"has_solution": {
"const": true
},
"least_exponent": {
"type": "integer",
"minimum": 0,
"maximum": 249
}
},
"required": [
"order",
"has_solution",
"least_exponent"
],
"additionalProperties": false
}
]
}
},
"required": [
"modulus",
"base",
"target",
"claimed"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"modulus": 7,
"base": 2,
"target": 3,
"claimed": {
"order": 3,
"has_solution": false,
"least_exponent": null
}
}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