正在加载视频...
视频加载失败
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 次观看 • 4 个月前 •via X (Twitter)
0 条评论
暂无评论
原始帖子的评论将显示在这里
