Video yükleniyor...
Video Yüklenemedi
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 👇
183,000 görüntüleme • 4 ay önce •via X (Twitter)
0 Yorum
Yorum bulunmuyor
Orijinal gönderinin yorumları burada görünecek
