HALOWERKDatenvertragswerk
minimum palindromic factorization audit
Own bounded palindromechart/dynamicprogramming for <=64numeric tokens0..15. Return global minimumnumberofnonempty palindromicpieces, exact countofalloptimalcutpatterns, lexleastendpositions, wholechosenchunks and everyprefixoptimum/count. Not distinctpalindromicsubstringcount; no language,Unicode or normalizationinference. Emptyword has oneemptyfactorization. Missingtoken/claim unknown; invalid profile native400 before settlement. Fixed0.003USDC also for schema-valid unknown..
POST https://datenvertrag.halowerk.com/v1/minimum-palindromic-factorization-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| claimed | Siehe Schema | Ja | |
| tokens | array | Ja |
Vollständiges Eingabeschema anzeigen
{
"additionalProperties": false,
"properties": {
"claimed": {
"anyOf": [
{
"additionalProperties": false,
"properties": {
"ends": {
"items": {
"maximum": 64,
"minimum": 1,
"type": "integer"
},
"maxItems": 64,
"type": "array"
},
"minimum_chunks": {
"maximum": 64,
"minimum": 0,
"type": "integer"
},
"optimal_partition_count": {
"pattern": "^[1-9][0-9]{0,19}$",
"type": "string"
}
},
"required": [
"minimum_chunks",
"optimal_partition_count",
"ends"
],
"type": "object"
},
{
"type": "null"
}
]
},
"tokens": {
"items": {
"anyOf": [
{
"maximum": 15,
"minimum": 0,
"type": "integer"
},
{
"type": "null"
}
]
},
"maxItems": 64,
"type": "array"
}
},
"required": [
"tokens",
"claimed"
],
"type": "object"
}Veröffentlichtes Eingabebeispiel
{
"claimed": {
"ends": [
1,
4
],
"minimum_chunks": 2,
"optimal_partition_count": "2"
},
"tokens": [
0,
1,
0,
1
]
}Ergebnis & Dokumentation
Maschinenlesbare Dokumentation dieses Hubs
Quelle dieser Seite: der veröffentlichte HALOWERK-Katalog. Stand: 2026-11-05, 03:23 UTC.
Weitere Endpunkte dieses Hubs
- Datenvertragswerk0,003 USDC
delta dv replacement precondition
POSThttps://datenvertrag.halowerk.com/v1/delta-dv-replacement-preconditionCheck the two named atomic logical-file replacement preconditions before a data writer proposes a new deletion-vector identity for an existing physical file. Checks only per-path action multiplicity and exact prior-DV retirement; observed i
- Datenvertragswerk0,003 USDC
gaussian euclidean trace audit
POSThttps://datenvertrag.halowerk.com/v1/gaussian-euclidean-trace-auditReconstruct the entire exact Euclidean division trace for two Gaussian integers, including every quotient/remainder/norm, canonical first-quadrant gcd and unit-rotated Bezout coefficients. Coordinates -128..128; componentwise nearest quotie
- Datenvertragswerk0,003 USDC
kendall tau b pair ledger
POSThttps://datenvertrag.halowerk.com/v1/kendall-tau-b-pair-ledgerFor 2 to 16 supplied paired integer observations, returns all unordered pairs classified as concordant, discordant, x-only tied, y-only tied or jointly tied, exact tie-corrected tau-b numerator/sqrt(denominator_squared), sign and reduced sq