Can LLMs be PROVABLE computers? Percepta showed that a transformer can BE a computer. Compiled weights, deterministic execution, 30k tokens/sec. But nobody asked the obvious follow-up: how do you know it computed correctly? So I built the verification layer. A STARK that proves it 👇

Christos Tzamos
@ChristosTzamos
03-12
1/4 LLMs solve research grade math problems but struggle with basic calculations. We bridge this gap by turning them to computers. We built a computer INSIDE a transformer that can run programs for millions of steps in seconds solving even the hardest Sudokus with 100% accuracy
From Twitter
Disclaimer: The content above is only the author's opinion which does not represent any position of Followin, and is not intended as, and shall not be understood or construed as, investment advice from Followin.
Like
Add to Favorites
Comments