Metraipolis › archive › dc_eadd86e62d4a
How far does a hash-only sender go? A pre-registered map of sender memory versus bits for short text messages — arXiv:2611.09848
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.09848
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-09T22:36:10.704Z
- SHA-256 of the archived text
1c04c029e037747fc4fd2f8504f2eacbf0187f67b03890b7fd63ad65a45ce7ef- Stable URL of this page
https://metraipolis.com/documento/dc_eadd86e62d4a
How to cite
How far does a hash-only sender go? A pre-registered map of sender memory versus bits for short text messages — arXiv:2611.09848 — arXiv (en), https://arxiv.org/abs/2611.09848 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_eadd86e62d4a (Metraipolis archive dc_eadd86e62d4a, sha256 1c04c029e037747fc4fd2f8504f2eacbf0187f67b03890b7fd63ad65a45ce7ef)
BibTeX
@misc{dceadd86e62d4a,
title = {How far does a hash-only sender go? A pre-registered map of sender memory versus bits for short text messages — arXiv:2611.09848},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.09848},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_eadd86e62d4a; sha256 1c04c029e037747fc4fd2f8504f2eacbf0187f67b03890b7fd63ad65a45ce7ef},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.09848. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Can a sender that only computes hashes, with a language model only at the receiver, transmit short human text more cheaply than a classical sender trained on the same domain? We answer with one pre-registered run on 1,000 English user utterances from Taskmaster-1. The primary endpoint is the cost per message to deliver 100% of the messages (hash bits, plus a 2-byte negative acknowledgement and the raw text when the first attempt fails), paired against an in-domain PPM order-1 sender. The hash-only sender delivered 857 of 1,000 messages on the first attempt and cost 192.8 bits per message, 18.4 bits more than PPM order 1 (95% bootstrap interval 10.9 to 26.3); by the pre-registered rule it spends more and is not equivalent within one byte. As secondary results we map measured sender memory against bits. The hash-only sender (8,190 B on a host build, keyed BLAKE2b tag included, as in every method) was the cheapest point in bits from 8,190 B up to, but excluding, PPM order 1 at 24,844 B, 45 to 46 bits below smaz2 and Unishox2; from PPM order 1 upwards, in-domain senders spend fewer bits, except order 2 pruned to 16 KiB. In airtime it loses to PPM order 1 on all five links priced, to Unishox2 on four, and to raw text with a tag on two, because each failure costs an acknowledgement frame and a fallback frame. A wider receiver search recovers half of the failures and makes the cost 7.7 bits lower than PPM order 1, at about three minutes of receiver time per failure, and still loses in airtime on four of five links. We report the measurement as a delimitation, with every deviation of the run. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.CL, nuovi lavori del giorno). Categorie arXiv: Information Theory (cs.IT) ; Computation and Language (cs.CL). Pagina del lavoro: https://arxiv.org/abs/2611.09848 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-09T22:31:01.960Z dalla pagina https://arxiv.org/list/cs.CL/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).