conv.

All stories
AIQuiet 10d · day 10

Bend language launches with AI-proof verification for GPUs and CPUs

New programming language uses mathematical proofs to prevent AI errors and compiles to run on GPUs at up to 100x speedup.

newest coverage 9d agosummary written 9d ago2 pieces955 likes & upvotes88 comments XNewswires

What to know

  • Bend uses mathematical proof checking to make code bugs mathematically impossible—AI agents must satisfy declared laws or code won't compile.
  • Single binary runs efficiently on CPUs (near-C speed) or GPUs (up to 100x faster), with automatic parallelization across all available cores.
  • Verification is fast (under 1 second per check), allowing AI agents to verify changes immediately rather than minutes per check.
  • Designed for post-AGI workflows where AI writes most code but humans enforce correctness through declarative mathematical laws.

“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 project, Language documentation · bend-lang.com ↗ · Sep 17, 4:36 PM

Victor Taelin Creator

Bend language launches with AI-proof verification for GPUs and CPUs
x.com

How it unfolded 2 developments, newest first · click a bar or a number to jump articlesposts

Peak 2 pieces in 3h at Sep 17, 3 PM; 2 pieces over 10 days (1 article · 1 post) Sep 17, 3 PM — 2 pieces · 1 article · 1 post — Newswires 1, X 1Sep 17, 6 PM — quietSep 17, 9 PM — quietSep 18, 12 AM — quietSep 18, 3 AM — quietSep 18, 6 AM — quietSep 18, 9 AM — quietSep 18, 12 PM — quietSep 18, 3 PM — quietSep 18, 6 PM — quietSep 18, 9 PM — quietSep 19, 12 AM — quietSep 19, 3 AM — quietSep 19, 6 AM — quietSep 19, 9 AM — quietSep 19, 12 PM — quietSep 19, 3 PM — quietSep 19, 6 PM — quietSep 19, 9 PM — quietSep 20, 12 AM — quietSep 20, 3 AM — quietSep 20, 6 AM — quietSep 20, 9 AM — quietSep 20, 12 PM — quietSep 20, 3 PM — quietSep 20, 6 PM — quietSep 20, 9 PM — quietSep 21, 12 AM — quietSep 21, 3 AM — quietSep 21, 6 AM — quietSep 21, 9 AM — quietSep 21, 12 PM — quietSep 21, 3 PM — quietSep 21, 6 PM — quietSep 21, 9 PM — quietSep 22, 12 AM — quietSep 22, 3 AM — quietSep 22, 6 AM — quietSep 22, 9 AM — quietSep 22, 12 PM — quietSep 22, 3 PM — quietSep 22, 6 PM — quietSep 22, 9 PM — quietSep 23, 12 AM — quietSep 23, 3 AM — quietSep 23, 6 AM — quietSep 23, 9 AM — quietSep 23, 12 PM — quietSep 23, 3 PM — quietSep 23, 6 PM — quietSep 23, 9 PM — quietSep 24, 12 AM — quietSep 24, 3 AM — quietSep 24, 6 AM — quietSep 24, 9 AM — quietSep 24, 12 PM — quietSep 24, 3 PM — quietSep 24, 6 PM — quietSep 24, 9 PM — quietSep 25, 12 AM — quietSep 25, 3 AM — quietSep 25, 6 AM — quietSep 25, 9 AM — quietSep 25, 12 PM — quietSep 25, 3 PM — quietSep 25, 6 PM — quietSep 25, 9 PM — quietYesterday, 12 AM — quietYesterday, 3 AM — quietYesterday, 6 AM — quietYesterday, 9 AM — quietYesterday, 12 PM — quietYesterday, 3 PM — quietYesterday, 6 PM — quietYesterday, 9 PM — quietToday, 12 AM — quietToday, 3 AM — quietToday, 6 AM — quietToday, 9 AM — quietToday, 12 PM — quiet 1–2
Sep 18Sep 19Sep 20Sep 21Sep 22Sep 23Sep 24Sep 25yesterdaynow · 3:49 PM ET
  1. 2

    Bend launch detailsType-checked laws prevent code bugs at compile time

    Full project documentation reveals Bend's LAWS.bend system where developers declare mathematical invariants that AI agents must satisfy. The language's type checker acts as a proof checker, completing verification in under one second. The same binary runs efficiently on single cores (near-C speed), multiple cores, or GPUs (up to 100x faster than single-core).

    “Merging a bug is mathematically impossible: it is a theorem.”
    — Bend project
    1. 1 outlet Bend – A language that blocks AI mistakes via proof, on CPU and GPU

      first by HN Best, 9d ago

  2. 1

    Victor Taelin announces Bend 2 language with proof-based AI safety

    Victor Taelin announced Bend 2, a new programming language designed to prevent AI mistakes using proof checking—the technique major AI labs employ to solve open math problems. The language is optimized for speed and GPU execution.

    “It is a new programming language that blocks AI mistakes via *proof checking* - the same technique big AI labs used to solve open math problems, like Navier-Stokes.”
    — Victor Taelin

    • Bend 2 is here! It is a new programming language that blocks AI mistakes via *proof checking* - the same technique big AI labs used to solve open math problems, like Navier-Stokes. It is also very fast, and runs on GPUs. Watch the video. Link in the comments.

      @VictorTaelinX9d ago955▲view on X ↗