RELAY

Five bytes per block. Four unconfirmed blocks in the sending window. Eleven demonstration seconds before retry. At most four sends per block, with a 64-second round deadline.

Six junctions form two alternative paths. A closed channel refuses new traffic in either direction; a block already travelling finishes that hop. Queued blocks choose another open path or wait. The speed control changes the queue's admission interval, not the propagation delay or a real TCP congestion window.

The receiver checks each block's round, range and byte payload, ignores duplicate content and acknowledges it again. Only complete characters before the first byte gap are displayed. Exhausted blocks remain retained but release a window place so later blocks can still travel.

Every event has a simulation timestamp and stable sequence. A seed and the same timed operations produce the same result, independent of scrolling and refresh rate. A hidden tab pauses; returning never catches up.

RFC 9293 §2.2 informs the ideas of ordering, detection and retransmission. The routes, chunks, acknowledgement strategy and timing here are original demonstration rules, not an implementation of TCP, QUIC or BGP.

Ryoji Ikeda · datamatics is a methodological reference for making data perceptible. No image, sound or code from the artwork is used.

Code-native SVG and live typography. Lenis and GSAP / ScrollTrigger share one animation ticker. Archivo and IBM Plex Mono are bundled locally under the SIL Open Font License. AI-generated studies informed the original sculpture; their records are included with the source.