Stream: Archive Mirror: Isabelle Users Mailing List

Topic: [isabelle] Authenticated Data Structures As Functors


view this post on Zulip Email Gateway (Aug 23 2022 at 08:49):

From: Tobias Nipkow <nipkow@in.tum.de>
Authenticated Data Structures As Functors
Andreas Lochbihler and Ognjen Marić

Authenticated data structures allow several systems to convince each other that
they are referring to the same data structure, even if each of them knows only a
part of the data structure. Using inclusion proofs, knowledgeable systems can
selectively share their knowledge with other systems and the latter can verify
the authenticity of what is being shared. In this article, we show how to
modularly define authenticated data structures, their inclusion proofs, and
operations thereon as datatypes in Isabelle/HOL, using a shallow embedding.
Modularity allows us to construct complicated trees from reusable building
blocks, which we call Merkle functors. Merkle functors include sums, products,
and function spaces and are closed under composition and least fixpoints. As a
practical application, we model the hierarchical transactions of Canton, a
practical interoperability protocol for distributed ledgers, as authenticated
data structures. This is a first step towards formalizing the Canton protocol
and verifying its integrity and security guarantees.

https://www.isa-afp.org/entries/ADS_Functor.html

Enjoy!
smime.p7s


Last updated: Nov 21 2024 at 12:39 UTC