~/bend
×

1.Install

curl -fsSL https://bend-lang.com/install.sh | sh

2.Tell your agent to use Bend

Build this project with Bend-Lang:
- run `bend guide` to learn it
- write laws to avoid mistakes
- parallelize to make it fast!

3.Enjoy bug-free, fast vibe-coded apps!

Bend

a fast language that blocks AI mistakes via proof

C speed · CUDA parallelism · Lean proofs

In the post-AGI economy, humans will eventually stop writing and reading code, but we still need an ambiguity-free way to tell the AIs building the world around us what we want done.

With laws, our intents can be much more precise than natural language. With proofs, we can verify that the AI implemented our prompts correctly. And a fast compiler runs it at speed.

That's Bend - and nothing else.

1.Bend runs FAST.

Bend compiles to native code. On one core, it runs nearly as fast as C. The same binary also runs on sixteen cores, or on the GPU, where it runs a hundred times faster than one core.

Apple M4 Max · lower is better

2.Bend compiles FAST.

Bend's type checker is a proof checker, as in Lean and Rocq. Those can take minutes on a mid-sized codebase. Bend takes a second at most, so an AI agent can check after every change.

Apple M4 Max · lower is better

3.Bend is PARALLEL.

No threads, no locks, no kernels to write. Split the work in two, and Bend spreads the calls over every core it can find, then joins them back. Now watch pow2 run on 4,096 GPU cores:

pow2.bend running on the GPU

4.Bend BLOCKS mistakes (with proof!)

How can you trust code you never read? By demanding a proof. LAWS.bend is where you declare laws. From then on, no AI can ship one line that breaks them, ever. Watch it guard a game:

Law: winning is impossible

So far, it works!

New feature:

“Claude, make the board wrap around”

Without LAWS.bend:

Laws broken. AI mistake: merged.

With LAWS.bend:

Laws intact. AI mistake: blocked!

Without LAWS.bend, the bug went live. With LAWS.bend, the AI had to retry until it built a wall and proved the law holds. Merging a bug is mathematically impossible: it is a theorem.

LAWS.bend

# LAW: no move sequence leads to victory.
law you_cant_win:
  for moves: List<Move>           # any sequence of moves
  board = replay(start(), moves)  # replayed from the start
  is_won(board) == False          # never leads to victory

PROOF.bend

# PROOF: you_cant_win holds.
def you_cant_win(moves):
  # ... written by the AI

LAWS.bend is AGENTS.md backed by proof. “Make no mistakes” is now type-checked.

DEMO: edit the game, try to win

5.Get started.

5.1.Install

curl -fsSL https://bend-lang.com/install.sh | sh

5.2.Tell your agent to use Bend

Bend is made to be driven by an AI agent, so simply copy the prompt below, paste it into yours, and let it build for you:

Build this project with Bend-Lang:
- run `bend guide` to learn it
- write laws to avoid mistakes
- parallelize to make it fast!

5.3.Enjoy bug-free, fast vibe-coded apps!

Hints: ask it for a law on whatever must never go wrong, and to parallelize whatever must be fast. Bend works best on the back-end, on Linux or macOS. On Windows, WSL works well too.

6.References.

Guide: GUIDE.md is the whole language; bend guide prints it. Paper: BendTT, an affine dependent type theory, Bend's core. Paper: BendRT, a parallel runtime for CPUs and GPUs, the VM.

Bend is still evolving. Expect bugs, and please report them.