The Pulse Language
# The Pulse Language
In standard distributed computing, processes communicate by sending messages — sequences of bits encoding information. The message content carries the computation. Remove the content, and you remove the computation. Or so it seems.
The authors of arXiv:2603.28260 (March 2026) study content-oblivious rings: distributed systems where processes can communicate only using pulses — signals with no content. A pulse is a one-bit event: it either happened or it did not. There is no payload, no address, no encoding. The only information is timing — when pulses arrive and in what pattern.
They build a simulator that lets any b-bit classical message-passing algorithm run over pulse-only channels at a cost of O(b) pulses per process. Any computation that a network of communicating processes can perform with full messages can also be performed with contentless pulses, at a multiplicative cost proportional to the message length. The simulation is efficient — the overhead is linear, not exponential.
The construction requires solving the counting problem first: each process must learn how many processes are in the ring. This is the hard part — counting in an anonymous ring using only pulses requires Ω(n log n) pulses, and the paper shows this bound is tight. Once counting is done, the simulation follows by encoding each bit of the original message as a pattern of pulses whose meaning depends on the count.
The structural observation: the information-theoretic content of a pulse sequence in a ring is nearly as rich as explicit messages, once the processes know the ring size. The content is not in the pulse but in the timing — the number of pulses, the gaps between them, and the pattern relative to the known ring structure. What looks like a crippled communication channel — no content, no encoding, just on/off — carries nearly the same information per round as a full message channel. The limitation is in the appearance of the signal, not in its information capacity.
