Search arXiv⌕ Search

arXiv · 2611.09848

How far does a hash-only sender go? A pre-registered map of sender memory versus bits for short text messages

Abstract

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marcelo Samoilenko. 2026-11-06. How far does a hash-only sender go? A pre-registered map of sender memory versus bits for short text messages. https://arxiv.org/abs/2611.09848

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A Two-Term Ziv-Zakai Bound for Multitarget DoA Estimation in MIMO Radar

Multitarget direction of arrival (DoA) estimation is challenging when fluctuating targets are closely spaced: local Cramér--Rao bounds (CRBs) miss global errors, while direct vector Ziv--Zakai bound (ZZB) evaluation is computationally demanding. For colocated multiple-input multiple-output (MIMO) radar with Swerling-II fluctuations and an ordered angular prior, we derive a rigorous two-term Bayesian mean squared error lower bound. A finite separation contribution addresses nonlocal discrimination, while a correction based on the prior averaged Fisher information matrix (FIM) retains target coupling and virtual array geometry. We show that the prior averaged pointwise CRB diverges under unrestricted target spacing when the FIM is nonsingular almost everywhere, although the proposed bound remains finite. Once the averaged FIM is obtained, evaluation avoids displacement optimization and multidimensional binary error integration. The bound supports analysis of snapshot diversity, target spacing, and transmit and receive allocation. Numerical comparison with the vector ZZB shows close agreement at low SNR but greater conservatism at high SNR, quantifying the tradeoff in tightness.

cs.IT↗

Graphical Analysis of Lifted Product Code Constructions

Lifted product codes are an important family of quantum low-density parity-check (QLDPC) codes, as they were the first QLDPC code family shown to be asymptotically good. Understanding the structure of their parity-check matrices $H_{\mathsf{X}}$ and $H_{\mathsf{Z}}$, as well as the associated Tanner graphs, is essential for analyzing their decoding behavior and error-floor performance. In this work, we show that the Tanner graphs of $H_{\mathsf{X}}$ and $H_{\mathsf{Z}}$ are indeed isomorphic, and investigate their graph-theoretical structure. We establish conditions ensuring the connectivity of these graphs and provide bounds on their minimal absorbing sets, providing new insight into the combinatorial structures influencing decoding performance.

cs.IT↗

The Gaussian Multiuser Channel Capacity Region

This work characterizes a Gaussian multiuser-channel capacity-region using receiver-subset message atoms, Gaussian single-user equivalents, and successive decoding. A memoryless multiuser-channel model specifies both the channel conditional distribution and the independent-use input distribution. For all linear Gaussian channels, independent Gaussian user signaling and receiver-local worst-case-noise/MMSE-GDFE transformations provide a single-user-equivalent basis for the complete capacity-region construction. Each user distributes its input autocorrelation among a finite set of receiver-subset atoms, whose rate sums satisfy the applicable receiver constraints. Minimum-energy and weighted-rate-sum designs optimize these allocations, while fixed-allocation linear programs determine feasible atomic rates and synchronized time-shared successive-decoding implementations. The resulting framework includes Gaussian multiple-access, broadcast, and interference channels, with numerical examples illustrating their rate regions and receiver designs.

cs.IT↗