HALOWERKDatenvertragswerk
ipv4 embedded address bit mapping
Apply RFC6052 structural IPv4-embedded address layouts for prefix lengths32/40/48/56/64/96 from a caller-supplied canonical128bit prefix. Embed four IPv4 octets or extract them from a32lowercase-hex IPv6 address, checking prefix and reserved u octet, reporting ignored nonzero suffix and canonical zero-suffix address. Structural mismatch is a known not_observed result. Fixed hexadecimal input/output only: no IPv6 text parser. This task does not assess WKP/global-address eligibility, prefix.
POST https://datenvertrag.halowerk.com/v1/ipv4-embedded-address-bit-mappingEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| prefix_hex | string | Ja | |
| prefix_length | Siehe Schema | Ja | |
| mode | Siehe Schema | Ja | |
| address | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"prefix_hex": {
"type": "string",
"minLength": 32,
"maxLength": 32,
"pattern": "^[0-9a-f]{32}$"
},
"prefix_length": {
"enum": [
32,
40,
48,
56,
64,
96
]
},
"mode": {
"enum": [
"embed",
"extract"
]
},
"address": {
"anyOf": [
{
"type": "array",
"minItems": 4,
"maxItems": 4,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 255
}
},
{
"type": "string",
"minLength": 32,
"maxLength": 32,
"pattern": "^[0-9a-f]{32}$"
}
]
}
},
"required": [
"prefix_hex",
"prefix_length",
"mode",
"address"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"prefix_hex": "20010db8000000000000000000000000",
"prefix_length": 32,
"mode": "embed",
"address": [
192,
0,
2,
33
]
}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