On Tue, Oct 1, 2024 at 10:40 AM Christopher Allen < ChristopherA@lifewithalacrity.com> wrote: > In my TPAC open topic session on Future Proofing ( https://www.w3.org/2024/09/24-did-minutes.html#t11) I mentioned that there now existed zk-proofs that can do large merkle-trees in <100 bytes. … > > I've sent an inquiry to the author for any updates, and his "even faster" variant. Here are the additional links he shared: This is the follow-up paper I was then referring to: https://eprint.iacr.org/2023/1025 Other related developments in ZK-friendly for specific proof system: https://eprint.iacr.org/2023/1045 https://eprint.iacr.org/2024/633 > -- Christopher Allen
Received on Thursday, 10 October 2024 22:50:39 UTC