Loading video...
Video Failed to Load
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 👇
182,765 views • 3 months ago •via X (Twitter)
0 Comments
No comments available
Comments from the original post will appear here
