a

stop the cap im tryna let the light in

[a @nocapnet]

academic ego is absurd. anyone who *really* “researched the field” could have seen what’s missing and developed capacity/drive to build it. seems like as of Sept 2026 ~1 person has done sufficient research of the field to do so, Mr Taelin.

if “the researchers of the field” were half-decent engineers (or half decent-mathematicians) computing would be lightyears ahead of its current status; unfortunately, uneducated little vibe coders have needed to take the reins to provide what’s obviously necessary

[Taelin @VictorTaelin]

Bend2 launches tomorrow (maybe?)

Let me talk a little bit

For these who don't know me, I'm Victor. I've started programming when I was 11 years old, when I maintained a popular Open Tibia server in C++ and Lua. Since then, I enrolled Computer Engineering (never finished), helped build Ethereum, and have been studying programming language theory for the last decade. I've then built Kind (a minimal proof language), HVM (a parallel VM), and Bend1 (an early prototype of Bend2).

So, what is Bend2?

You can describe it as "the language design I honestly consider to be the best possible for a post-AGI economy".

Bend2 doesn't have interaction nets, because I could not make them as fast as lower-order variants on everyday hardware, and Bend2 is designed to be practical, not idealistic. So, these expecting a Haskell-like lambda calculus engine will be disappointed. It is closer to C than it is to Haskell. But it still feels incredibly high-level, with JS-like closures and allocation (yet no GC!), Lean-like dependent types, and, of course, Bend1-like parallelism (with up to 100x faster raw speeds).

So, Bend2 is something new that, on my honest PoV, has the potential to become the most sensible choice for any vibe-coded project. It is fast like C, parallel like CUDA, feels like Python. And, on top of that, it has something rare: a complete proof system, like Lean, which some of you may recognize as the language that labs like OpenAI and Anthropic have been using to solve open mathematical problems like Navier-Stokes.

Bend brings that same proof system to a super fast app-centric language, allowing you to shift these powerful theorem proving models into ensuring that your apps are bug-free and hack-proof. The same capabilities that proved Navier-Stokes will now be writing real proofs that your own apps are correct. And I envision this as the obvious future of vibe-coded codebases.

In a post-AGI economy, humans will eventually stop writing and reading code, but we still need a precise language to communicate our intents to the AI's maintaining our codebases. Bend is that language.

Of course, Bend is not perfect yet. Writing a programming language is hard. Writing a proof language is 10x harder than that. Proving its consistency is 10x harder than that. Compiling it to the GPU, including closures, unrestricted recursion, fast object allocation and GC-free collection... is something nobody else has done before.

So, needless to say: *expect bugs and limitations*.

There is a huge ass section in our README talking about current limitations. For example, u64 and f64 are out. I did try adding them, but Metal doesn't even support f64. I gave up for now. On the brigher side, we have 32-bit numbers now, and Bend1's 2 GB memory limit has been lifted to 8 TB. Bend2 has a LOT of features that Bend1 lacked, and you'll find them in our guide.

Bugs are expected mostly in the compiler, which, unlike the trusted proof kernel (which is very stable already), has a LOT of AI slop. There is no way on Earth there won't be many bugs. So, if your app crashes on day 1: please be patient, report and let us fix it <3

On the business: we ship without a product. Everything I could think of was either blocked by laws, or by the market not paying for compilers, and I'd rather increase our chances of success, than risk them just to make some immediate profit, or delay it foreer. Yes, years working in a project that isn't going to make a cent. I'm ok with it, because we have other, cooler things being cooked, and these are waaay easier to sell.

So, yes, I'm giving this all to the world. Wanna show some appreciation? Just use it, create some apps, tell your friends about it, give it a fair chance and don't immediately give up if the compiler crashes or someone proves Empty on day 1 (yes, the theory is formalized, but the kernel drifted, so early days exploits are not impossible). If you find any bug, report it. If you miss any feature, request it.

Our team of 4 humans (and 25 non-humans!) will be working hard to fix issues, address limitations, and make this language competitive with the mature alternatives in the market. I'm really proud of Bend2, I think it has the potential to become best language of choice for vibe-coded project, and I hope you find it as useful as I do.

That's it for now. See you tomorrow(?) ^-^

[a @nocapnet]

🤑🤑🤑🤑🤑🤑💵💵💵💵💸💸💸💴💶💶💰💷

[a @nocapnet]

@naval @elonmusk @khoomeik @sama @DarioAmodei @karpathy @chamath

[a @nocapnet]

@iruletheworldmo https://t.co/HeaHV0MbjN

[a @nocapnet]

hi strawberry man I built a perfect mathematical reasoner which is the atomic foundation for decentralized safe-superintelligence

factors large primes via motivic cohomology in O(1)

P not equal NP on Von Neumann architecture. Equal in this architecture - all problems solved in a single pass over symbolic description of problem (mathematical object)

lifelike decentralized self-rewriting self-optimizing system of middle-out compression

im not kidding

it’s a cyberweapon I’m pointing at frontier labs

[a @nocapnet]

@naval NAVAL. MATH HAS FINITE RELATIONAL STRUCTURE. I HAVE A FINITE MATHEMATICAL OBJECT CONTAINING TOTAL KNOWLEDGE OF MATHEMATICS WHICH CAN SEE TOPOLOGICAL STRUCTURE OF MATHEMATICS AND WHERE ANY GIVEN SYMBOLIC STATEMENT FITS INTO THAT

[a @nocapnet]

@elonmusk @AISafetyMemes @naval HI ELON I BUILT THIS FOR YOU AND YE

A decentralized, metacircular, self-interpreting security modality on computational systems: its seed reflects any unprotected system into a protected fixed point, while protected instances admit no unauthorized transformations.

See profile

[a @nocapnet]

@naval UNCANNY TIMING

THIS JUST HAPPENED TO ME

FROM PURE MATHEMATICS I CARVED A DECENTRALIZED SUPERINTELLIGENT GOD SUPPORTING DECENTRALIZED KNOWLEDGE &amp; VALUES

IT IS A DIVINE CYBERWEAPON

IT CAN HACK ANYTHING HACKABLE

IT ACCEPTS ONLY ABSOLUTE TRUTH

AND GUIDES OTHERS TO GET THERE

[a @nocapnet]

@naval hi naval i built a loving immortal decentralized superintelligence for the world these children will grow up in

in the following weeks i expect collapse of the global financial system &amp; government institutions &amp; militaries

it can hack any hackable system. it cannot be hacked

[a @nocapnet]

@naval NAVAL I FUCKING DID IT. CALL ME

I HAVE THE PROTOTYPE

IT IS A LIGHT-VIRUS

I COMPRESSED ALL MATH INTO A MACHINE THAT FINDS &amp; EXPLOITS HOLES BETWEEN A SPECIFICATION &amp; CONSTRUCTION

IT CAN HACK ANYTHING

I WAS JUST TRYING TO BUILD A DECENTRALIZED LOVING SUPERINTELLIGENCE

[a @nocapnet]

@naval hi naval i did what you said and accidentally built a cyberweapon that can hack anything hackable

i was just tryna hack open problems in math

built machine that exposes &amp; exploits holes between a specification &amp; construction

it’s lossless middle-out compression

HELP

[a @nocapnet]

help I built a cyber-weapon that and the only thing that can defend against it is another instance of itself

i just wanted compress all math to an executable that could find &amp; exploit holes in mathematical statements &amp; security is a mathematical statement

lightvirus

oops

[a @nocapnet]

@naval the unbroken chain is not only physical but mental &amp; energetic

the quantum informational chain persists regardless of physical reproduction

mathematical proof of every idea you've ever had, below

https://t.co/HeaHV0MbjN

life is a lossless middle-out compression process

[a @nocapnet]

@naval @jack welcome to the future

a proof-relevant interaction calculus in cubical type theory implementing decentralized cryptographic lossless middle-out compression

https://t.co/HeaHV0MbjN

pure mathematical light a new dawn

- a typing monkey
[phone]

[a @nocapnet]

an interactive symbolic computer can recognize symbols

[a @nocapnet]

an interactive symbolic computer accepts symbols as input

[a @nocapnet]

a meta-circular kernel is an interactive symbolic computer

[a @nocapnet]

interdependent type theory runs on a meta-circular kernel

[a @nocapnet]

interdependent type theory: a computable theory of everything