TAP-7007 发布两个演示：游戏与 AI 推理TAP-7007 ships two demos: a game and AI inference
BruceBlue 在提交 TAP-7007 草案后发布两个可运行演示：TAPBOY-8 是 651 拍的链上游戏，把 34 分谎报成 98 分；AI Inference 是 92 拍推理，只篡改第 63 拍的一个逻辑门。TAP-7007 通过三层二分把争议缩小到一小段电路，最终由链上裁决谁在撒谎，核心思路是「不重算全部，只找出谎言并验证那一步」。代码与 GitHub 已一并公开。After submitting the TAP-7007 draft, BruceBlue released two runnable demos: TAPBOY-8, a 651-cycle on-chain game that falsely reports 34 points as 98, and AI Inference, a 92-cycle inference where a single logic gate at cycle 63 is tampered with. TAP-7007 uses three-layer bisection to narrow the dispute to a small circuit segment and lets the chain adjudicate who lied — the core idea being "don't recompute everything; find the lie and verify the step." The code and GitHub have been published alongside.
来源 · 3 条Sources · 3
- @BruceBlue
TapeOut 的科技树，又解锁了一格！ 继 TAP-721 之后，最近又花了一些时间研究一个有趣的问题： 如果一台计算机大到区块链根本跑不动，我们还能不能让区块链判断它有没有作弊？ 🤔 于是，我提交了新的标准草案： TAP-7007｜Large Netlists & Verifiable Execution 过去，我们希望把电路放到链上，让它真正运行起来。 但随着电路越来越复杂，从简单逻辑门到 CPU、游戏机，甚至 AI 神经网络，一笔交易的 Gas 已经远远装不下这些计算。 TAP-7007 尝试换一种思路： 🔹 通过 ROM/RAM 与分块存储，让更复杂的电路拥有可验
- @BruceBlue
Another branch unlocked on TapeOut's tech tree! After TAP-721, I've been exploring a question: What if a computer becomes too large for a blockchain to execute? Can the blockchain still catch it cheating? 🤔 That's what my new draft, TAP-7007 — Large Netlists & Verifiable Execution, aims to explo
- @BruceBlue
Github 和代码都发了，还是让 Demo 自己说话吧！ 🎮 TAPBOY-8：651 拍游戏，把 34 分谎报成 98 分。 🧠 AI Inference：92 拍推理，只篡改第 63 拍的一个逻辑门。 TAP-7007 通过三层二分，把争议缩小到一小段电路，最终由链上裁决谁在撒谎。 Two demos. One idea: Don't recompute everything. Find the lie, verify the step. Build. Prove. Grow. 🚀 #TapeOut #BuilderCulture 🦾