ExaCortex

World record claim · November 13, 2026

One program. 151 languages. Back to itself.

Our Ruby program writes a program in BASIC. That program writes one in ChucK. That one writes the next, through 151 languages in a row, until the last one, in REXX, prints the first Ruby program again, byte for byte. It is the longest working quine relay we could find in public. The old high mark, Yusuke Endoh's famous relay, has 128.

See the code on GitHubCheck the proofPress kit

What a quine relay is

A quine is a program that prints its own source code. A quine relay stretches that into a loop: program A prints program B in another language, B prints C, and so on, until the last one prints A again.

The hard part is quoting. Each program has to carry every later program inside it as text, escaped the way its own language wants. Get one step's escaping wrong and the text can balloon. In testing, a single badly placed language blew one step's output up to 16 MB. Order matters as much as the languages do.

Yusuke Endoh (mame) built the famous version. It has sat at 128 languages since 2018. We forked it, kept every one of his 128 steps, and added 23 more.

The proof

On November 13, 2026, the whole relay ran in one Docker image on Ubuntu 26.04.

  • All 151 steps ran on their real interpreters and compilers. Nothing was skipped or faked.
  • Step 151 printed QR2.rb, and it matches QR.rb byte for byte.
  • The full build and run logs are public in the repo's proof folder.

SHA-256 of both files

67dd3929f2842512c5dcbe6958ab20d9c71eac5f386289f787f0d8ceb9433e32

Run it yourself:

git clone https://github.com/exacortex/quine-relay-151
cd quine-relay-151
docker build -t qr .
docker run --rm qr

If the last file doesn't match the first, the claim falls. That's the point.

The rules we count by

No official body tracks quine relays that we know of. So we wrote the rules down, used the strict ones on ourselves, and published them so anyone can compete under them.

Tier 1: distinct languages

Each language counts once. Three Scheme compilers are one Scheme. FORTRAN77 and Fortran 90 are one Fortran. Ook! is just Brainfuck with the words swapped, so it doesn't count. Gzip is a file format, so it doesn't count either. Under this rule mame's 128 counts 123. Ours counts 143.

Tier 2: relay steps

Steps counted the way mame counts them, plus at most three implementations of any one language. Each step needs its own interpreter or compiler, its own source text, and a real run. No version-only copies, and no steps that only pass the text along. Ours counts 151.

Full rules: RECORDS.md. Every step and how it's counted: LANGUAGES.md.

Leaderboard

RelayTier 1
distinct languages
Tier 2
relay steps
Verified
exacortex/quine-relay-151143151Docker, Ubuntu 26.04, zero stand-ins · Nov 13, 2026
mame/quine-relay123128mame's CI, Ubuntu 26.04

Beat it? Open a pull request on RECORDS.md with a public repo and a full Docker log. A number alone doesn't count.

Side records

Recordmame's 128Ours (151)
Smallest seed per language106.8 bytes98.5 bytes
Biggest single file in the loopnot measuredabout 3 MB
Full lap time in Dockernot measuredabout 12 minutes
Smallest seed for mame's exact 12813,664 bytesnext
Every language mame ever used (148) in one lap128 of 148next
Longest alphabetical relay128next

What's next

157 is already done. A 157-step build passed its own full Docker lap on November 13, 2026, in 439 seconds. It adds Macaulay2, rep, BusyBox ash and three more Scheme compilers. It goes into the public repo next, and this page moves up when it does.

Then 256. The goal is 256 distinct languages under the strict rule. That means bringing back the 20 languages mame had to retire when Ubuntu dropped them (Smalltalk, Julia, Logo, Maxima and more), plus about 90 others.

Credit

This is built on Quine Relay by Yusuke Endoh and contributors, under the MIT license, kept as-is. Every one of his 128 steps is still in the loop. We just made it longer.

Made by ExaCortex: one person and Claude, an AI by Anthropic. Claude wrote and debugged the new steps. The person picked the languages, set the counting rules and ran every lap on their own PC. How we work.