<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>O(1) Lab 研究</title><link>https://lab.parano1d.org/zh/</link><description>O(1) Lab 的论文、协议工作、可复现的工程研究及其成果。</description><language>zh-Hans</language><lastBuildDate>Sat, 01 Aug 2026 15:58:14 GMT</lastBuildDate><atom:link xmlns:atom="http://www.w3.org/2005/Atom" href="https://lab.parano1d.org/zh/feed.xml" rel="self" type="application/rss+xml"/><item><title>行业指标下的 ParanO(1)d 可靠性</title><link>https://lab.parano1d.org/zh/research/parano1d-soundness-industry-metrics/</link><guid isPermaLink="true">https://lab.parano1d.org/zh/research/parano1d-soundness-industry-metrics/</guid><pubDate>Fri, 31 Jul 2026 12:00:00 GMT</pubDate><category>证明可靠性</category><description>使用 Plonky2、RISC Zero 与 ethSTARK 发布的指标评估实际部署参数，并将基于猜想的评分与由有限定理支撑的上界明确分开。</description></item><item><title>FROST-GKR：面向批量 Poseidon2b 的全局轨迹协议</title><link>https://lab.parano1d.org/zh/research/frost-gkr-global-trace-protocol/</link><guid isPermaLink="true">https://lab.parano1d.org/zh/research/frost-gkr-global-trace-protocol/</guid><pubDate>Fri, 31 Jul 2026 12:00:00 GMT</pubDate><category>证明系统</category><description>三列承诺轨迹只用两次约束 sumcheck，即可归约整批 Poseidon2b 执行。</description></item><item><title>HistoryStep 为何采用两种证明类别</title><link>https://lab.parano1d.org/zh/research/b64-b255-proof-classes/</link><guid isPermaLink="true">https://lab.parano1d.org/zh/research/b64-b255-proof-classes/</guid><pubDate>Fri, 17 Jul 2026 12:00:00 GMT</pubDate><category>递归证明</category><description>HistoryStep 是区块状态转换的递归证明。B64 可处理最多 64 个用户交易页面，并能在参考笔记本上满足准备时间预算；B255 将同一证明关系扩展到每区块 255 页的上限。测量没有发现第三种类别可以覆盖的有用运行区间。</description></item><item><title>区块为何必须与递归证明一同接受</title><link>https://lab.parano1d.org/zh/research/atomic-history-step/</link><guid isPermaLink="true">https://lab.parano1d.org/zh/research/atomic-history-step/</guid><pubDate>Wed, 15 Jul 2026 12:00:00 GMT</pubDate><category>共识</category><description>早期设计先接受区块，再在后台生成对应的递归证明。因此，规范链尖可能领先于已被 HistoryStep 覆盖的链尖，节点还必须持久化并恢复另一条任务队列。正式架构只在区块与其 HistoryStep 同时就绪时接受该区块：一个原子对象、一个规范高度，不存在滞后的证明积压。</description></item><item><title>区块只证明一次，随后搜索 nonce</title><link>https://lab.parano1d.org/zh/research/prove-once-search-nonces/</link><guid isPermaLink="true">https://lab.parano1d.org/zh/research/prove-once-search-nonces/</guid><pubDate>Wed, 15 Jul 2026 12:00:00 GMT</pubDate><category>挖矿</category><description>HistoryStep 在不含 nonce 的语义域中绑定区块头的全部语义字段；PoW 可以改变 nonce，而无需重建 State 转换证明。</description></item><item><title>从携带证明的 State 启动同步</title><link>https://lab.parano1d.org/zh/research/proof-carrying-state-sync/</link><guid isPermaLink="true">https://lab.parano1d.org/zh/research/proof-carrying-state-sync/</guid><pubDate>Sun, 12 Jul 2026 12:00:00 GMT</pubDate><category>Proof-carrying State</category><description>新接入节点验证区块头与最终性边界上的一份递归转换证明，安装精确 Live State，并应用不超过十八个近期区块。</description></item><item><title>以 UTXO 代次标识取代共识隔离期</title><link>https://lab.parano1d.org/zh/research/utxo-incarnations/</link><guid isPermaLink="true">https://lab.parano1d.org/zh/research/utxo-incarnations/</guid><pubDate>Fri, 10 Jul 2026 12:00:00 GMT</pubDate><category>Live State</category><description>在现有数值字段中加入单调创建标识符，可使过期的槽位打开证明失效，而无需引入第二个共识根或设置槽位重用隔离期。</description></item><item><title>四条硬件路径使用同一种证明格式</title><link>https://lab.parano1d.org/zh/research/binary-field-kernels/</link><guid isPermaLink="true">https://lab.parano1d.org/zh/research/binary-field-kernels/</guid><pubDate>Thu, 09 Jul 2026 12:00:00 GMT</pubDate><category>二进制域</category><description>PCLMUL、VPCLMUL、AVX-512 与 PMULL 执行完全相同的 GF(2¹²⁸) 运算，不改变见证布局或证明字节。</description></item><item><title>一次全局 Poseidon 遍历取代九次验证器遍历</title><link>https://lab.parano1d.org/zh/research/single-global-walk/</link><guid isPermaLink="true">https://lab.parano1d.org/zh/research/single-global-walk/</guid><pubDate>Mon, 06 Jul 2026 12:00:00 GMT</pubDate><category>递归证明</category><description>完整组合基准表明，独立验证器遍历会把内存推高到 30 GB 以上；共享域消除了这一倍增因素。</description></item><item><title>递归验证器必须容纳自身</title><link>https://lab.parano1d.org/zh/research/recursive-fixed-point/</link><guid isPermaLink="true">https://lab.parano1d.org/zh/research/recursive-fixed-point/</guid><pubDate>Sun, 05 Jul 2026 12:00:00 GMT</pubDate><category>递归证明</category><description>采用 2^23 个位置约束域的类别实现递归闭合：每份证明都以相同的认证矩阵与公共布局验证前驱。</description></item><item><title>AuthStream：约束全区块授权工作负载</title><link>https://lab.parano1d.org/zh/research/authstream-proof-compiler/</link><guid isPermaLink="true">https://lab.parano1d.org/zh/research/authstream-proof-compiler/</guid><pubDate>Sun, 28 Jun 2026 12:00:00 GMT</pubDate><category>证明工程</category><description>流式编译以 4.7% 的开销约束了 14–16 MiB 私密授权数据；所评估的终端证明未达到实际部署的延迟预算。</description></item><item><title>证明缩小 20%，速度却下降 68%</title><link>https://lab.parano1d.org/zh/research/merkle-fusion-negative-result/</link><guid isPermaLink="true">https://lab.parano1d.org/zh/research/merkle-fusion-negative-result/</guid><pubDate>Thu, 25 Jun 2026 12:00:00 GMT</pubDate><category>证明工程</category><description>融合两个 Merkle 关系节省了 5.94 KB，却扩大了组合后的多线性轨迹并失去并行性；证明时间从 2.68 秒退化到 4.50 秒。</description></item><item><title>一个所有者，一份授权证明</title><link>https://lab.parano1d.org/zh/research/owner-batched-authorization/</link><guid isPermaLink="true">https://lab.parano1d.org/zh/research/owner-batched-authorization/</guid><pubDate>Wed, 24 Jun 2026 12:00:00 GMT</pubDate><category>钱包授权</category><description>公开交易运算属于区块关系。即使一次花费包含 1,020 个输入，钱包也只证明一个私密事实——所有权。</description></item><item><title>紧凑混合打开与原始承诺的绑定</title><link>https://lab.parano1d.org/zh/research/binding-a-mixed-opening/</link><guid isPermaLink="true">https://lab.parano1d.org/zh/research/binding-a-mixed-opening/</guid><pubDate>Sun, 21 Jun 2026 12:00:00 GMT</pubDate><category>多项式承诺</category><description>A/A′ 对抗测试把低度一致性与承诺来源区分开来；来源根与共享查询补上这条绑定链。</description></item><item><title>三项多项式承诺实验及其暴露的瓶颈</title><link>https://lab.parano1d.org/zh/research/pcs-implementation-trail/</link><guid isPermaLink="true">https://lab.parano1d.org/zh/research/pcs-implementation-trail/</guid><pubDate>Sun, 21 Jun 2026 12:00:00 GMT</pubDate><category>多项式承诺</category><description>Ladder FRI 暴露了证明大小成本，FRI-Binius 暴露了来源绑定问题，BaseFold 则暴露了把验证器放进后继证明的代价。</description></item></channel></rss>