Hacker News: developedby

New comment by developedby in "Bend – A language that blocks AI mistakes via proof, on CPU and GPU"

developedby — Fri, 18 Sep 2026 07:20:26 +0000

It's just solarized, i imagine most developers are familiar with it

New comment by developedby in "Bend – A language that blocks AI mistakes via proof, on CPU and GPU"

developedby — Thu, 17 Sep 2026 22:35:33 +0000

The benchmarks: https://github.com/bendlang/bend/tree/main/bench

The script we use to run them on our servers: https://github.com/bendlang/bend/blob/main/gates/perf.ts

New comment by developedby in "Bend – A language that blocks AI mistakes via proof, on CPU and GPU"

developedby — Thu, 17 Sep 2026 22:31:07 +0000

If your game is big, then your proof will need to be huge. It works basically the same as Lean.

New comment by developedby in "Bend – A language that blocks AI mistakes via proof, on CPU and GPU"

developedby — Thu, 17 Sep 2026 22:22:18 +0000

Old repo can be accessed here https://github.com/HigherOrderCO/Bend1 . I guess we could have it as a branch on the bend2 repo

New comment by developedby in "Bend – A language that blocks AI mistakes via proof, on CPU and GPU"

developedby — Thu, 17 Sep 2026 22:18:17 +0000

Most of that is just the test suite. The actual code is about 10k lines

New comment by developedby in "Bend: a high-level language that runs on GPUs (via HVM2)"

developedby — Fri, 17 May 2024 17:13:10 +0000

That's the main idea!

New comment by developedby in "Bend: a high-level language that runs on GPUs (via HVM2)"

developedby — Fri, 17 May 2024 16:43:52 +0000

Bending is an operation similar to folding, both in real life and in the language. While fold is recursive on data, bend is recursive on a boolean condition (like a pure while that supports multiple branching recursion points).

I was actually looking forward to seeing someone from Bend to make a comment like this

New comment by developedby in "Bend: a high-level language that runs on GPUs (via HVM2)"

developedby — Fri, 17 May 2024 11:42:23 +0000

The first `fork` is from using bend and passing the initial state

  The program above will initialize a state (`x = 0`), and then, for as long as `x < 3`,
  it will "fork" that state in two, creating a `Tree/Node`, and continuing with `x + 1`.
  When `x >= 3`, it will halt and return a `Tree/Leaf` with `7`.
  When all is done, the result will be assigned to the `tree` variable: