DigestAI news desk
Agents & Toolsupdated 2 min read

Bend language promises proof‑checked AI code, claims C‑speed on CPU and 100× GPU boost

Bend is a new programming language that combines native compilation with Lean‑style proof checking to prevent AI‑generated code errors. Its type checker, which validates proofs, finishes in at most a second, allowing an AI agent to verify every change instantly. The language compiles to native binaries that run on a single CPU core at nearly C speed, can scale to sixteen cores, and on a GPU can…

1 source HN 161

Key points

  • Runs near C speed on one CPU core and up to 100× faster on GPU, according to the developers.
  • Proof checker finishes in at most one second, enabling AI agents to verify code after each change.
  • LAWS.bend lets developers declare invariants that AI‑generated code must provably satisfy before merging.

Developers write constraints in LAWS.bend; any AI‑produced code must satisfy those laws before it can be merged, turning potential bugs into mathematically impossible theorems. The language also supports a PROOF.bend file to certify that a law holds. Bend targets back‑end workloads on Linux and macOS, and its runtime spreads work across all available cores without requiring explicit threads, locks, or kernel code. The project is still early, with a public guide, papers on its type theory and parallel runtime, and an invitation for users to report issues.

Full story frombend-lang.com · via Hacker NewsOpen source ↗

Bend – A language that blocks AI mistakes via proof, on CPU and GPU

bend-lang.com · 17 September 2026

`curl -fsSL https://bend-lang.com/install.sh | sh```` When using Bend:

  • run bend guide to learn it
  • use LAWS.bend to keep important rules
  • run bend PROOF.bend before committing
  • parallelize the code whenever possible
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.

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, running up to a hundred times faster than one core.

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.

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:

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:

**New feature:**

“Claude, make the board wrap around”

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 Laws.you_cant_win(moves):

... written by the AI

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

Add this to your `AGENTS.md`:

Then, just say: "use Bend"!

Hints: ask it to write **laws** for whatever should never break,
and to **parallelize** everything you want running fast. Bend is
young: if anything goes wrong, ask it to open an issue. Bend
works best on the back-end, on Linux and on macOS. Enjoy! &lt;3

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.

This text was published by bend-lang.com. It is reproduced here with attribution so you can read it in full; the rights remain with the publisher. Read it at the source ↗

Coverage and discussion

1source

The headline, key points and digest above were generated by Digest AI's editorial model from the linked sources. Automated summaries can contain errors: the sources are the record. Spotted a mistake? Tell us.

Comments

via GitHub Discussions

More in Agents & Tools

All →

Related stories