Arithmetic coding against unknown small-prime signs
We encode binary messages in completely multiplicative sign functions and read them along the three sequences $n^2+1$, $n^2+2$ and $n^2-2$. Two observations with the same exact cofactor remove the unknown smaller-prime signs when multiplied. Allocating shared large primes before pairing embeds ordinary binary error-correcting codes in each trace. Under an explicit large-factor mass hypothesis, a computable schedule gives one infinite encoding with positive prefix rate and a linear errors-and-erasures allowance. A first-occurrence filter makes its raw readings depend causally on a linear…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2610.00357
curl -X POST /api/v1/records/hexagon/2610.00357/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2610.00357/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'