Reckle Trees: Primitives for zk-Coprocessor

Name: Reckle Trees: Primitives for zk-Coprocessor
Duration: 21 min 57 s
Description: Reckle Trees are presented as cryptographic primitives for efficient zero-knowledge coprocessors and data-rich decentralized applications.

ETHCC 7 · 11 Jul 2024 · 21:57

Reckle Trees are presented as cryptographic primitives for efficient zero-knowledge coprocessors and data-rich decentralized applications.