SHRED RELAY BUY $SHRED
SHRED RELAY / SLOT 001

SHRED RELAY

A BLOCK TRAVELS IN PIECES AND ARRIVES WHOLE.

An experiment in packets, redundancy, and the art of passing things along.

SHRED RELAY / TRANSIT STATUS TURBINE L1-L3
block cut
shreds in flight
some lost
block rebuilt
Visual illustration, not live telemetry.
[SECTION 01 / THESIS]
FIELD MANUAL REF: FEC-SOL

BIG THINGS DON'T FIT THROUGH THE DOOR.

Networks carry small packets, and they drop some of them. Anything large that needs to be everywhere at once has to be cut up first, and whoever cuts it has to plan for pieces that never arrive.

Asking for a resend costs time a fast chain does not have. The alternative is to send a little extra, so the receiver can work out what is missing without asking.

WHOLE → PIECES → WHOLE
SIGNATURE INTERACTION

TYPE SOMETHING. LOSE A PIECE. GET IT BACK.

Client-side XOR erasure coding parity demonstration.

REASSEMBLED PAYLOAD STATUS MATCH
Original SHA-256 Digest
—
Rebuilt SHA-256 Digest
—

Caption: Four pieces of data, one spare. Drop any one and the rest can rebuild it. Drop two and they cannot.

Note: This demo uses a single XOR parity piece, the simplest erasure code, which survives one loss per group. Solana uses Reed-Solomon coding, which adds many recovery shreds per batch and survives many losses. The principle is the same and the arithmetic is not. Everything runs client-side.

PROTOCOL FLOW

CUT. SPARE. PASS.

01 — THE CUT

THE CUT

The leader splits the block into shreds, each sized for one packet.

02 — THE SPARES

THE SPARES

Recovery shreds are computed from the data, so any sufficient set rebuilds the batch.

03 — THE RELAY

THE RELAY

Each validator forwards shreds to a few others, layer by layer, so nobody sends to everyone.

ENOUGH PIECES → THE WHOLE BATCH

Protocol Boundaries & Limits: Erasure coding repairs loss, and only up to the number of spare pieces: lose more than that and the batch must be fetched again by a separate repair request. It does not encrypt anything. It does not check that the block's transactions are valid, and it does not decide which block the network accepts; that is the job of replay and consensus voting. The leader's signature shows who sent a shred, not that its contents are correct. Exact protocol parameters are subject to change.

PACKET LOSS, ACCEPTED.

shred-cli v0.1.0-mock
$shred send ./block
data shreds: cut
recovery shreds: added
sent: all of them
arrived: most of them
block: fine
> three of them never arrived.
noted.
> should I resend?
did you get enough?
> yes.
then you got all of it.
THE OPERATING CODE

RULES OF THE RELAY.

01.
Nothing large travels whole.
02.
Plan for the piece that never arrives.
03.
Pass it on before you ask where it came from. Then check the signature.
04.
Redundancy is a budget, not a miracle.
05.
Count what arrived.
MEME COIN CONCEPT

SHRED RELAY / $SHRED

Shred Relay is a community-driven Solana meme coin inspired by shreds and the way a block gets across a lossy network. The token is the cultural artifact. The relay is the story.

PROJECT Shred Relay
SYMBOL $SHRED
NETWORK Solana
MINT ADDRESS
4TZg6EyZZjg38fRPjyGkXxSVyCKyrZgkP3nXgfTqpump
Disclaimer: Shred Relay is a meme coin and community experiment. It provides no product, relay service, network speed-up or guarantee of future utility. The token is speculative and may lose all its value.
NARRATIVE HOPS

THE TRIP NARRATIVE

Hop 0

The Cut

An idea is broken into pieces small enough to send.

Hop 1

The First Layer

A few people pass it on.

Hop 2

The Wide Layer

More hands than anyone can count.

Hop 3

Unknown

Whatever gets rebuilt at the far end.

PASS IT ON.

FOLLOW ON X
01
02
03
04
05

A BLOCK TRAVELS IN PIECES AND ARRIVES WHOLE.

Count what arrived.