基于Nova的MinRoot VDF实现

已于 2023-06-30 16:41:43 修改
阅读量660 收藏
点赞数
分类专栏： 零知识证明 文章标签： 零知识证明
于 2023-06-29 16:56:30 首次发布
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/mutourend/article/details/131459359
版权

1. 引言

前序博客有：

代码见：

有多种类型的VDF算法：
在这里插入图片描述
同一类型的VDF，根据所选择的曲线不同，所使用的参数也有所不同：
在这里插入图片描述
https://github.com/Microsoft/Nova 中的MinRoot，所采用的为：
f ( x i + 1 , y i + 1 ) = ( ( x i + y i ) 1 / 5 , x i ) f(x_{i+1},y_{i+1})=((x_i+y_i)^{1/5}, x_i) f(xi+1​,yi+1​)=((xi​+yi​)1/5,xi​)

详细代码见examples/minroot.rs。

Nova-based VDF with MinRoot delay function
=========================================================
Proving 1024 iterations of MinRoot per step
Producing public parameters...
PublicParams::setup, took 73.078327592s 
Number of constraints per step (primary circuit): 12888
Number of constraints per step (secondary circuit): 10347
Number of variables per step (primary circuit): 12882
Number of variables per step (secondary circuit): 10329
Generating a RecursiveSNARK...
RecursiveSNARK::prove_step 0: true, took 4.624µs 
RecursiveSNARK::prove_step 1: true, took 1.166330261s 
RecursiveSNARK::prove_step 2: true, took 1.224084382s 
RecursiveSNARK::prove_step 3: true, took 1.275612276s 
RecursiveSNARK::prove_step 4: true, took 1.247531567s 
RecursiveSNARK::prove_step 5: true, took 1.276658484s 
RecursiveSNARK::prove_step 6: true, took 1.233760567s 
RecursiveSNARK::prove_step 7: true, took 1.230236579s 
RecursiveSNARK::prove_step 8: true, took 1.24617902s 
RecursiveSNARK::prove_step 9: true, took 1.202719954s 
Verifying a RecursiveSNARK...
RecursiveSNARK::verify: true, took 381.332458ms
Generating a CompressedSNARK using Spartan with IPA-PC...
CompressedSNARK::prove: true, took 33.365056086s
CompressedSNARK::len 9403 bytes
Verifying a CompressedSNARK...
CompressedSNARK::verify: true, took 388.515267ms
=========================================================
Proving 2048 iterations of MinRoot per step
Producing public parameters...
PublicParams::setup, took 70.355994544s 
Number of constraints per step (primary circuit): 15960
Number of constraints per step (secondary circuit): 10347
Number of variables per step (primary circuit): 15954
Number of variables per step (secondary circuit): 10329
Generating a RecursiveSNARK...
RecursiveSNARK::prove_step 0: true, took 4.213µs 
RecursiveSNARK::prove_step 1: true, took 1.163035595s 
RecursiveSNARK::prove_step 2: true, took 1.211507467s 
RecursiveSNARK::prove_step 3: true, took 1.228544979s 
RecursiveSNARK::prove_step 4: true, took 1.218547311s 
RecursiveSNARK::prove_step 5: true, took 1.221717836s 
RecursiveSNARK::prove_step 6: true, took 1.218962179s 
RecursiveSNARK::prove_step 7: true, took 1.230055614s 
RecursiveSNARK::prove_step 8: true, took 1.218389455s 
RecursiveSNARK::prove_step 9: true, took 1.220260741s 
Verifying a RecursiveSNARK...
RecursiveSNARK::verify: true, took 327.467486ms
Generating a CompressedSNARK using Spartan with IPA-PC...
CompressedSNARK::prove: true, took 28.405642566s
CompressedSNARK::len 9404 bytes
Verifying a CompressedSNARK...
CompressedSNARK::verify: true, took 338.551301ms
=========================================================
Proving 4096 iterations of MinRoot per step
Producing public parameters...
PublicParams::setup, took 70.092380898s 
Number of constraints per step (primary circuit): 22104
Number of constraints per step (secondary circuit): 10347
Number of variables per step (primary circuit): 22098
Number of variables per step (secondary circuit): 10329
Generating a RecursiveSNARK...
RecursiveSNARK::prove_step 0: true, took 4.543µs 
RecursiveSNARK::prove_step 1: true, took 1.262449816s 
RecursiveSNARK::prove_step 2: true, took 1.30737881s 
RecursiveSNARK::prove_step 3: true, took 1.315299705s 
RecursiveSNARK::prove_step 4: true, took 1.298120798s 
RecursiveSNARK::prove_step 5: true, took 1.293002033s 
RecursiveSNARK::prove_step 6: true, took 1.296309126s 
RecursiveSNARK::prove_step 7: true, took 1.304054547s 
RecursiveSNARK::prove_step 8: true, took 1.290177872s 
RecursiveSNARK::prove_step 9: true, took 1.291139605s 
Verifying a RecursiveSNARK...
RecursiveSNARK::verify: true, took 371.391454ms
Generating a CompressedSNARK using Spartan with IPA-PC...
CompressedSNARK::prove: true, took 42.00665964s
CompressedSNARK::len 9704 bytes
Verifying a CompressedSNARK...
CompressedSNARK::verify: true, took 456.396603ms
=========================================================
Proving 8192 iterations of MinRoot per step
Producing public parameters...
PublicParams::setup, took 73.216632509s 
Number of constraints per step (primary circuit): 34392
Number of constraints per step (secondary circuit): 10347
Number of variables per step (primary circuit): 34386
Number of variables per step (secondary circuit): 10329
Generating a RecursiveSNARK...
RecursiveSNARK::prove_step 0: true, took 3.449µs 
RecursiveSNARK::prove_step 1: true, took 1.539035436s 
RecursiveSNARK::prove_step 2: true, took 1.622303693s 
RecursiveSNARK::prove_step 3: true, took 1.534060709s 
RecursiveSNARK::prove_step 4: true, took 1.500765389s 
RecursiveSNARK::prove_step 5: true, took 1.541102208s 
RecursiveSNARK::prove_step 6: true, took 1.521414059s 
RecursiveSNARK::prove_step 7: true, took 1.498017567s 
RecursiveSNARK::prove_step 8: true, took 1.507547714s 
RecursiveSNARK::prove_step 9: true, took 1.654619421s 
Verifying a RecursiveSNARK...
RecursiveSNARK::verify: true, took 608.025166ms
Generating a CompressedSNARK using Spartan with IPA-PC...
CompressedSNARK::prove: true, took 73.425426802s
CompressedSNARK::len 10001 bytes
Verifying a CompressedSNARK...
CompressedSNARK::verify: true, took 694.724361ms
=========================================================
Proving 16384 iterations of MinRoot per step
Producing public parameters...
PublicParams::setup, took 105.921985131s 
Number of constraints per step (primary circuit): 58968
Number of constraints per step (secondary circuit): 10347
Number of variables per step (primary circuit): 58962
Number of variables per step (secondary circuit): 10329
Generating a RecursiveSNARK...
RecursiveSNARK::prove_step 0: true, took 25.76µs 
RecursiveSNARK::prove_step 1: true, took 1.813137744s 
RecursiveSNARK::prove_step 2: true, took 1.878074321s 
RecursiveSNARK::prove_step 3: true, took 1.80861029s 
RecursiveSNARK::prove_step 4: true, took 2.396045213s 
RecursiveSNARK::prove_step 5: true, took 1.729798055s 
RecursiveSNARK::prove_step 6: true, took 1.729107037s 
RecursiveSNARK::prove_step 7: true, took 1.720501846s 
RecursiveSNARK::prove_step 8: true, took 1.743876552s 
RecursiveSNARK::prove_step 9: true, took 1.737904666s 
Verifying a RecursiveSNARK...
RecursiveSNARK::verify: true, took 711.567199ms
Generating a CompressedSNARK using Spartan with IPA-PC...
CompressedSNARK::prove: true, took 78.038337919s
CompressedSNARK::len 9998 bytes
Verifying a CompressedSNARK...
CompressedSNARK::verify: true, took 668.522336ms
=========================================================
Proving 32768 iterations of MinRoot per step
Producing public parameters...
PublicParams::setup, took 107.353152111s 
Number of constraints per step (primary circuit): 108120
Number of constraints per step (secondary circuit): 10347
Number of variables per step (primary circuit): 108114
Number of variables per step (secondary circuit): 10329
Generating a RecursiveSNARK...
RecursiveSNARK::prove_step 0: true, took 4.849µs 
RecursiveSNARK::prove_step 1: true, took 2.265852376s 
RecursiveSNARK::prove_step 2: true, took 2.2747954s 
RecursiveSNARK::prove_step 3: true, took 2.281599611s 
RecursiveSNARK::prove_step 4: true, took 2.306338036s 
RecursiveSNARK::prove_step 5: true, took 2.320080158s 
RecursiveSNARK::prove_step 6: true, took 2.281631356s 
RecursiveSNARK::prove_step 7: true, took 2.297964832s 
RecursiveSNARK::prove_step 8: true, took 2.281593708s 
RecursiveSNARK::prove_step 9: true, took 2.410508168s 
Verifying a RecursiveSNARK...
RecursiveSNARK::verify: true, took 1.256136737s
Generating a CompressedSNARK using Spartan with IPA-PC...
CompressedSNARK::prove: true, took 138.11442845s
CompressedSNARK::len 10296 bytes
Verifying a CompressedSNARK...
CompressedSNARK::verify: true, took 1.098852882s
=========================================================
Proving 65535 iterations of MinRoot per step
Producing public parameters...
PublicParams::setup, took 191.407999313s 
Number of constraints per step (primary circuit): 206421
Number of constraints per step (secondary circuit): 10347
Number of variables per step (primary circuit): 206415
Number of variables per step (secondary circuit): 10329
Generating a RecursiveSNARK...
RecursiveSNARK::prove_step 0: true, took 17.903µs 
RecursiveSNARK::prove_step 1: true, took 3.626168253s 
RecursiveSNARK::prove_step 2: true, took 3.637881318s 
RecursiveSNARK::prove_step 3: true, took 3.746542026s 
RecursiveSNARK::prove_step 4: true, took 3.559443813s 
RecursiveSNARK::prove_step 5: true, took 3.556236556s 
RecursiveSNARK::prove_step 6: true, took 3.591468574s 
RecursiveSNARK::prove_step 7: true, took 3.784589713s 
RecursiveSNARK::prove_step 8: true, took 3.766741089s 
RecursiveSNARK::prove_step 9: true, took 3.712172217s 
Verifying a RecursiveSNARK...
RecursiveSNARK::verify: true, took 2.256590247s
Generating a CompressedSNARK using Spartan with IPA-PC...
CompressedSNARK::prove: true, took 262.484895111s
CompressedSNARK::len 10590 bytes
Verifying a CompressedSNARK...
CompressedSNARK::verify: true, took 1.846402449s
=========================================================

参考资料

[1] Origami: Fold a Plonk for Ethereum’s VDF
[2] MinRoot: Candidate Sequential Function for Ethereum VDF
[3] VDF Proving with SnarkPack

Nova系列博客

mutourend
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
VDF语音配线架
wyllovwcyy的博客
12-24 3374
VDF,又称为音频配线单元 ，提供通信传输中的音频传输作用，在通信传输中起到至关重要的作用。 该产品具有如下特点： 1、操作简单：卡接割线瞬间完成，不需用专门培训，不用电源。 2、连接快速：卡接工具“咔嚓”一声，接线工作完成，卡接线径0.4-0.8mm。 3、接触可靠：卡接簧片具有高强弹性，接触电阻小于2mΩ，触点反复卡接100次，接触电仍小于3mΩ，每根线接好后，拉脱力大于25N（芯线Φ0.4mm）。 ...
OpenStack-Placement、nova组件部署
boyuser的博客
01-03 658
OpenStack-Placement、nova组件部署 一、创建数据库实例和数据库用户 [root@ct ~]# mysql -uroot -p MariaDB [(none)]> CREATE DATABASE placement; MariaDB [(none)]> GRANT ALL PRIVILEGES ON placement.* TO 'placement'@'localhost' IDENTIFIED BY 'PLACEMENT_DBPASS'; MariaDB [(none)]
基于Labview与VDF-B变频器的机床控制系统
06-01
阐述了Labview与VDF-B系列变频器的控制特点和方法,设计了机床电机变频器的通信控制系统,实现了对机床电机的转速控制和检查,并能按照测试步骤控制机床的运行速度和规律,实时记录转速和工作电流,并以图像曲线的形式表现出来。
vdf.zip_vdf
09-24
Perhaps the highliest customizable library for LCD displays around. Designed for ATMega microcontrollers using CodevisionAVR,
基于Nova的SHA256证明
mutourend的博客
07-01 743
基于Nova的SHA256证明
ZKP Understanding Nova (1): MinRoot Example
Simba的博客
12-06 87
Nova: Recursive zero-knowledge arguments from folding schemes. 学习笔记
VRF VS VDF
mutourend的博客
07-22 870
参考资料 [1] 2020年Orlicki论文 Fair Proof-of-Stake using VDF+VRF Consensus [2] 波卡Wiki Randomness
基于cycle of curves的Nova证明系统（1）
mutourend的博客
06-21 1001
主要见斯坦福大学Wilson Nguyen、Dan Boneh和微软研究中心Srinath Setty 2023年论文《在2021年论文中，基于relaxed R1CS statements的folding scheme，构建了针对IVC（Incrementally Verifiable Computation）的高效简洁证明系统——Nova证明系统。不过在该论文中，Nova的描述和分析都限制为single chain of incremental computation（zn​Fnz0​。
Rust 中的简单 RSA VDF
06-28
RSA VDFRust 中的简单 RSA VDF (Wesolowski18 )let t= BigInt::sample (20 );//time parameter// One public setup can work for many VDFslet setup= SetupForVDF::public_setup (& t);// 1. challenger picks ...
vdf:Rust中可验证延迟函数的实现
05-01
Rust中的可验证延迟功能（VDF）实现 什么是VDF？ 可验证延迟函数（VDF）是一项需要大量时间进行评估的函数（即使具有多项式并行处理器），但可以很快将其验证为正确函数。 VDF可用于在分布式网络环境中构造具有多个...
VDF－V使用说明书
12-07
VDF-V使用说明书。台达变频器使用说明
零知识证明在隐私保护和身份验证中的应用
PrimiHub的博客
05-20 1110
隐私保护和身份验证是现代社会中的关键问题，尤其是在数字化时代。零知识证明（Zero-Knowledge Proofs，简称ZKP）提供了一种独特的解决方案，它允许个体在不泄露任何额外信息的情况下，证明某个陈述的真实性。
Java开发案例-springboot-19-校验表单重复提交-源代码+文档.rar
05-31
Java开发案例-springboot-19-校验表单重复提交-源代码+文档.rar Java开发案例-springboot-19-校验表单重复提交-源代码+文档.rar Java开发案例-springboot-19-校验表单重复提交-源代码+文档.rar Java开发案例-springboot-19-校验表单重复提交-源代码+文档.rar Java开发案例-springboot-19-校验表单重复提交-源代码+文档.rarJava开发案例-springboot-19-校验表单重复提交-源代码+文档.rar Java开发案例-springboot-19-校验表单重复提交-源代码+文档.rar
基于android的公司员工考勤综合信息平台源码.zip
05-31
提供的源码资源涵盖了安卓应用、小程序、Python应用和Java应用等多个领域，每个领域都包含了丰富的实例和项目。这些源码都是基于各自平台的最新技术和标准编写，确保了在对应环境下能够无缝运行。同时，源码中配备了详细的注释和文档，帮助用户快速理解代码结构和实现逻辑。 适用人群： 这些源码资源特别适合大学生群体。无论你是计算机相关专业的学生，还是对其他领域编程感兴趣的学生，这些资源都能为你提供宝贵的学习和实践机会。通过学习和运行这些源码，你可以掌握各平台开发的基础知识，提升编程能力和项目实战经验。 使用场景及目标： 在学习阶段，你可以利用这些源码资源进行课程实践、课外项目或毕业设计。通过分析和运行源码，你将深入了解各平台开发的技术细节和最佳实践，逐步培养起自己的项目开发和问题解决能力。此外，在求职或创业过程中，具备跨平台开发能力的大学生将更具竞争力。 其他说明： 为了确保源码资源的可运行性和易用性，特别注意了以下几点：首先，每份源码都提供了详细的运行环境和依赖说明，确保用户能够轻松搭建起开发环境；其次，源码中的注释和文档都非常完善，方便用户快速上手和理解代码；最后，我会定期更新这些源码资源，以适应各平台技术的最新发展和市场需求。
珍藏很久的一套源码升级了很多
05-31
很强大的阿凤飞飞的身份就把饭啦啊开房记录看妇科阿里看到就考虑是否就解放路口空间按时到路口附近开了房间卡拉的时间分开垃圾的浪费空间按可浪费阿克纠纷的看了觉得空房间看大神经费卡上的减肥快接啊看来积分卡时间分开拉丝机房里看见啦开恐怕为日文名弄法卡上的健康饭卡里解放开了哈嘎考虑对方好几万呢uaho时到路口附近开了房间卡拉的时间分开垃圾的浪费空间按可浪费阿克纠纷的看了觉得空房间看大神经费卡上的减肥快接啊看来积分卡时间分开拉丝机房里看见啦开恐怕为日文名弄法卡上的健康饭卡里解放开了哈嘎考虑对方好几万呢uaho上的健康饭卡里解放开了哈嘎考虑对方好几万呢uaho时到路口附近开了房间卡拉的时间分开垃圾的浪费空间按可浪费阿克纠纷的看了觉得空房间看大神经费卡上的减肥快接啊看来积分卡时间分开拉丝机房里看见啦开恐怕为日文名弄法卡上的健康饭卡里解放开了哈嘎考虑对方好几万呢uaho垃圾的浪费空间按可浪费阿克纠纷的看了觉得空房间看大神经费卡上的减肥快接啊看来积分卡时间分开拉丝机房里看见啦开恐怕为日文名弄法卡上的健康饭卡里解放开了哈嘎考虑对方好几万呢uaho上的健康饭卡里解放开了哈嘎考虑对方好几万呢uaho时到路口附近开
附件二六个指标与权重得分 - 副本.xlsx
05-31
附件二六个指标与权重得分 - 副本
自学助词自学助词自学助词
05-31
自学助词自学助词自学助词
ipywidgets-7.7.3.tar.gz
最新发布
05-31
Python库是一组预先编写的代码模块，旨在帮助开发者实现特定的编程任务，无需从零开始编写代码。这些库可以包括各种功能，如数学运算、文件操作、数据分析和网络编程等。Python社区提供了大量的第三方库，如NumPy、Pandas和Requests，极大地丰富了Python的应用领域，从数据科学到Web开发。Python库的丰富性是Python成为最受欢迎的编程语言之一的关键原因之一。这些库不仅为初学者提供了快速入门的途径，而且为经验丰富的开发者提供了强大的工具，以高效率、高质量地完成复杂任务。例如，Matplotlib和Seaborn库在数据可视化领域内非常受欢迎，它们提供了广泛的工具和技术，可以创建高度定制化的图表和图形，帮助数据科学家和分析师在数据探索和结果展示中更有效地传达信息。
VDF python
09-08
VDF是Valve的KeyValue文本文件格式的缩写，它是一种用于存储和传输数据的格式，类似于json。在Python中，我们可以使用多个模块来处理VDF数据。 其中一个常用的模块是steamodd，它是一个纯Python模块，用于VDF的反序列化（即将VDF数据解析为Python对象）。steamodd可以在Python 2.7和Python 3.3及以上版本中使用，并且支持pypy和pypy3。您可以通过pip来安装steamodd： $ pip install steamodd 另一个常用的模块是VDF序列化器，它要求Python 2.7或3.3。您可以使用类似的方法来安装它： $ pip install steamodd 如果您希望手动安装，可以使用标准的distutils模块来安装steamodd。具体的安装步骤可以参考相关文档。 此外，根据引用，VDF文件的目录结构通常有addons、source-python、bin、data等文件夹，这些文件夹中包含了与VDF和Source.Python相关的二进制文件、源代码和数据文件。 总结起来，VDF是一种用于存储和传输数据的格式，Python中有多个模块可以处理VDF数据，例如steamodd。您可以使用pip来安装这些模块，并按照文档进行相应的操作。<span class="em">1</span><span class="em">2</span><span class="em">3</span>

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值