基于范畴理论的有限状态机到zk-SNARKS的映射
Mapping finite state machines to zk-SNARKS Using Category Theory
摘要:
我们提供了一个分类的过程,把图对应的状态空间的有限状态机到布尔电路,利用布尔电路可以很容易地变成zk-SNARKS。我们的电路验证了给定的边和节点序列确实是它们所表示的图中的路径。然后,我们推广到电路验证路径在任意图。我们证明了我们所有的对应关系都是伪函子的,并且相互之间表现得很好。
英文摘要:
We provide a categorical procedure to turn graphs corresponding to state spaces of finite state machines into boolean circuits, leveraging on the fact that boolean circuits can be easily turned into zk-SNARKS. Our circuits verify that a given sequence of edges and nodes is indeed a path in the graph they represent. We then generalize to circuits verifying paths in arbitrary graphs. We prove that all of our correspondences are pseudofunctorial, and behave nicely with respect to each other.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。