[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$f3c6swbgoud6i0":3},{"code":4,"message":5,"data":6,"timestamp":47},10000,"success",{"full_name":7,"position":8,"description":9,"language":10,"stars":11,"forks":12,"stars_gained":13,"age_days":14,"hn_threads":15,"one_liner":22,"summary_md":23,"topic":24,"github_topics":27,"license":37,"homepage":38,"updated_at":39,"history":40},"bendlang\u002Fbend",4,"Bend 2: a fast language that blocks AI mistakes via proof. Install: curl -fsSLhttps:\u002F\u002Fbend-lang.com\u002Finstall.sh| sh","TypeScript",24121,767,107,1152,[16],{"id":17,"title":18,"points":19,"comments":20,"posted_at":21},49746203,"Bend 2 Is Here",18,3,"2026-09-17","A dependently typed language with a fast proof checker, aimed at making AI-generated code verifiable by machine.","## The problem\n\nIf AI writes a growing share of your code, the bottleneck moves from writing to reviewing. Tests show examples you thought of; they do not show the invariant you forgot. Bend's answer is to make the invariant itself part of the build: you declare laws in a `LAWS.bend` file, and the compiler refuses any edit, human or AI, that cannot be accompanied by a proof that the laws still hold. The pitch is concrete: a game where winning must be impossible, and an agent asked to add board wrapping has to add a wall instead of shipping the bug.\n\n## What's different\n\nMost verification stacks bolt onto an existing language: a proof assistant such as Lean or Agda, or a refinement layer over a mainstream language, with a separate runtime and a slow elaborator. Bend is one language that carries dependent types, purity, linearity and the parallel runtime together, so the same code you prove is the code that compiles to C, CUDA, Metal or JavaScript. Two things actually stand out: the checker speed claim (sub-second where other assistants take minutes) and divide-and-conquer parallelism that spreads calls over CPU cores or GPU without threads, locks or hand-written kernels. Against plain tests, laws are universally quantified rather than sampled; against Lean, the cost is a much smaller ecosystem and few tactics.\n\n## Who it's for\n\nTeams already using coding agents on rule-heavy domains (game logic, ledgers, state machines) where an invariant breach is expensive, and who are willing to write laws instead of reading every diff. Also researchers curious about an affine dependent type theory with a fast checker. Look elsewhere if you need a production language today: no TLS, HTTP, JSON or regex in the standard base, Windows unsupported, small standard library, and no tactics means proofs are manual.\n\n## Cost of adoption\n\nThe install is a curl-to-shell script, and the README itself warns that the `bend` install ignores project config while running from a checkout does not, which matters when checking untrusted code. You need clang 14+, and clang 19+ or CUDA 12 for the `!` parallel operator. The limitations list is unusually honest and also long: everything is annotated, no type classes or macros, affine values you cannot share, strings as linked lists, one C file per program with no incremental builds, native compiles are slow so JS is recommended for iteration. The compiler is 99% AI-written and not fully audited; the checker is unproven, with only `--verdict` backed by a Lean kernel. This is Bend 2, a rewrite; Bend 1 programs and HVM do not carry over.\n\n## Verdict\n\nBend has been around since 2023 and accumulated roughly 24k stars, but the board history only catches two days of about +110 stars each, which looks like a small sustained signal rather than a breakout. The HN launch thread drawing 18 points suggests niche rather than mainstream interest. The core idea, laws as an enforceable `AGENTS.md` with proofs, is genuinely the right question for an agent-written codebase, and the project is unusually candid about what is missing. As a daily driver it is not there; as an experiment in verified AI-assisted development, it is one of the more interesting bets to watch. Try it on a small proof-heavy demo before trusting it with anything that matters.",{"slug":25,"name":26},"developer-tools","Developer Tools",[28,29,30,31,32,33,34,35,36],"bend","cuda","dependent-types","gpu","metal","parallel","programming-language","proof","theorem-proving","Apache-2.0","https:\u002F\u002Fbend-lang.com","2026-10-25T00:06:52Z",[41,45],{"date":42,"stars":43,"stars_gained":44},"2026-10-24",24115,113,{"date":46,"stars":11,"stars_gained":13},"2026-10-25",1792901753]