arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2604.15751cs.CRcs.DC
收藏

PoSME:通过延迟绑定指针追逐与因果哈希绑定实现证明顺序内存执行

PoSME: Proof of Sequential Memory Execution via Latency-Bound Pointer Chasing with Causal Hash Binding

WritersLogic Inc.(WritersLogic公司)

David L. Condrey

AI总结:

PoSME通过延迟绑定指针追逐和因果哈希绑定,实现强制持续顺序计算,具有严格的线性内存步骤执行、高时间内存折衷抵抗性和紧ASIC优势界。

摘要:

我们引入了PoSME(证明顺序内存执行),一种加密原语,通过在可变竞技场上进行延迟绑定的指针追逐来强制持续的顺序计算。每一步读取数据依赖的地址,写入一个块,其值和因果哈希相互依赖(共生绑定),并将结果链接到全局记录中。这产生了三个属性:(1)严格线性顺序内存步骤执行,(2)高时间内存折衷抵抗性(在写入密度为4时有十倍惩罚,具有随步骤数平方增长的正式空间时间下界),(3)通过DRAM随机访问延迟而非带宽实现的紧ASIC优势界。在17个CPU平台和4个GPU架构上的基准测试显示,哈希计算成本低于步骤成本的3.5%,GPU硬件比消费级CPU慢14到19倍。PoSME不需要可信设置,并为可验证延迟、作者身份证明和Sybil抵抗提供了基础。

英文摘要:

We introduce PoSME (Proof of Sequential Memory Execution), a cryptographic primitive that enforces sustained sequential computation via latency-bound pointer chasing over a mutable arena. Each step reads data-dependent addresses, writes a block whose value and causal hash are mutually dependent (symbiotic binding), and chains the result into a global transcript. This yields three properties: (1) strict linear sequential memory-step enforcement, (2) high time-memory trade-off resistance (a tenfold penalty at a write density of 4, with a formal space-time lower bound that scales quadratically with the number of steps), and (3) a tight ASIC advantage bound by DRAM random-access latency rather than bandwidth. Benchmarks across 17 CPU platforms and 4 GPU architectures demonstrate that hash computation is under 3.5 percent of step cost and GPU hardware is 14 to 19 times slower than a consumer CPU. POSME requires no trusted setup and provides a foundation for verifiable delay, authorship attestation, and Sybil resistance.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑