Proofs of Proofs of Work with Sublinear Complexity
Proofs of Proofs of Work with Sublinear Complexity
复制标题
具有次线性复杂性的工作量证明的证明
DOI：
--
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
Aikaterini
中科院分区：
文献类型：
--
作者：
A. Kiayias;N. Lamprou;Aikaterini
在基于区块链的交易分类账的设置中，我们研究了“简化支付验证”（SPV）的问题，SPV是指希望检查区块链的最后k个区块的交易验证器的设置（例如，为了验证某个事务），仅使用起源块（或其已知的某个“检查点”块）作为建议。
In the setting of blockchain based transaction ledgers we study the problem of “simplified payment verification” (SPV) which refers to the setting of a transaction verifier that wishes to examine the last k blocks of the blockchain (e.g., for the purpose of verification of a certain transaction) using as only advice the genesis block (or some “checkpoint” block that is known to it).