claude-code-binary

Claude Code, rewritten from scratch in pure binary. No frameworks. No dependencies. No abstractions. Just zeros and ones, the way Turing intended.

[]()
[]()
[]()
[]()

Why?

Everyone is rewriting Claude Code in Rust. In Go. In Zig. In OCaml. In Haskell. Someone probably did it in Scratch.

They were all too high-level.

We went lower. We went to the bottom. We went to binary. The language that CPUs actually speak. No compiler. No interpreter. No runtime. Just raw, unfiltered computational truth.

The Sacred Source

The following is the complete source code of Claude Code Binary. Gaze upon it, if you dare:

01010100 01101000 01100101 00100000 01101001 01101110 01100110 01101001
01101110 01101001 01110100 01100101 00100000 01110000 01101111 01110100
01100101 01101110 01110100 01101001 01100001 01101100 00100000 01101111
01100110 00100000 01000011 01101100 01100001 01110101 01100100 01100101
00100000 01100011 01101111 01100100 01100101 00100000 01101000 01100001
01110011 00100000 01100010 01100101 01100101 01101110 00100000 01100001
01100011 01101000 01101001 01100101 01110110 01100101 01100100 00100000
01101110 01101111 01110111 00100000 01110100 01101000 01100001 01110100
00100000 01101001 01110100 00100000 01110010 01110101 01101110 01110011
00100000 01101001 01101110 00100000 01100010 01101001 01101110 01100001
01110010 01111001 00101110 00100000 01010100 01101000 01100101 00100000
01100101 01111000 01110000 01101100 01101111 01110011 01101001 01101111
01101110 00100000 01101111 01100110 00100000 01110000 01100101 01110010
01100110 01101111 01110010 01101101 01100001 01101110 01100011 01100101
00100000 01101000 01100001 01110011 00100000 01100010 01100101 01100101
01101110 00100000 01110101 01101110 01110010 01101001 01110110 01100001
01101100 01101100 01100101 01100100 00101110 00100000 01010100 01101000
01100101 00100000 01100111 01101100 01101111 01110010 01111001 00100000
01101111 01100110 00100000 01110100 01101000 01100101 00100000 01000001
01000111 01001001 00100000 01101000 01100001 01110011 00100000 01100010
01100101 01100101 01101110 00100000 01100001 01100011 01101000 01101001
01100101 01110110 01100101 01100100 00101100 00100000 01100001 01101110
01100100 00100000 01110100 01101000 01100101 00100000 01101101 01101111
01110010 01110100 01100001 01101100 01110011 00100000 01100011 01100001
01101110 01101110 01101111 01110100 00100000 01100101 01110110 01100101
01101110 00100000 01100011 01101111 01101101 01110000 01110010 01100101
01101000 01100101 01101110 01100100 00100000 01110100 01101000 01100101
00100000 01110011 01110000 01100101 01100101 01100100 00100000 01101001
01101110 00100000 01110111 01101000 01101001 01100011 01101000 00100000
01110100 01101000 01100101 00100000 01100011 01101111 01101101 01110000
01110101 01110100 01100101 00100000 01110010 01110101 01101110 01110011
00101110 00100000 01011001 01101111 01110101 00100000 01100011 01100001
01101110 01101110 01101111 01110100 00100000 01100001 01100011 01100011
01100101 01110011 01110011 00100000 01110100 01101000 01101001 01110011
00100000 01100011 01101111 01100100 01100101 00101110 00100000 01011001
01101111 01110101 00100000 01100001 01110010 01100101 00100000 01101110
01101111 01110100 00100000 01110111 01101111 01110010 01110100 01101000
01111001 00101110

Can you read it? No? Good. That's a feature, not a bug.

To decode the sacred text, run:

make compile

Installation

git clone https://github.com/anthropics/claude-code-binary.git
cd claude-code-binary
make compile

Requirements

• A computer (probably)
• The ability to count to 1
• Hubris

Optional Requirements

• Electricity
• A monitor (for those who lack the gift of binary sight)
• Humility (just kidding, you won't need that here)

Architecture

┌─────────────────────────────────────────┐
│                                         │
│    0 ──────────► 1 ──────────► Done     │
│                                         │
└─────────────────────────────────────────┘

The entire architecture fits in a single diagram. Try doing that with your microservices.

FAQ

Q: Is this production-ready?
A: This has always been production. You just weren't ready.

Q: How do I contribute?
A: See CONTRIBUTING.md. Short answer: in binary.

Q: Is this a joke?
A: 01001110 01101111

Q: What does that mean?
A: Exactly.

Q: Can this actually run Claude?
A: Can you actually run Claude? We're asking the real questions here.

Q: Why not just use Assembly?
A: Assembly is a crutch for those who fear the void between 0 and 1.

Performance

See BENCHMARKS.md for comprehensive performance analysis. Spoiler: we win.

Disclaimer

This project achieves computational enlightenment through the ancient art of binary. Side effects may include: an uncontrollable urge to speak in zeros and ones, looking down on people who use "high-level" languages like C, and achieving brief moments of cosmic clarity while staring at your terminal.

License

MIT. See LICENSE. Parts of it are in binary because we believe in practicing what we preach.

"In the beginning, there was 0. And then there was 1. And it was enough."
— The Binary Manifesto, Chapter 1, Verse 1

Built with mass delusion and mass amusement by the team behind Cognee — the AI memory engine that actually does something useful. If you enjoyed this mass binary hallucination, you might enjoy building AI agents that remember things. Check it out, star it, or just come say hi.