Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2111.07461

A Topos View of Blockchain Consensus Protocols

Michael Lambert
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper presents a reformulation in topos logic of a safety result arising in an abstract presentation of blockchain consensus protocols. That is, in a high-level template for "correct-by-construction" consensus protocols, it is shown that a proposition and its negation cannot both be safe in protocol states that have executions to some common state. This is in fact true for any inconsistent propositions and the proof requires only intuitionistic reasoning. This opens the door for work on consensus protocols in the internal language of a topos. As a first pass on such a program, the main contribution of this paper is the formulation of estimate safety in abstract correct-by-construction protocols as a forcing statement in the internal logic of a given topos. This is illustrated first in the setting of copresheaf toposes. It is also seen there that safety can be viewed as a modal statement. For these interpretations, some extensions and adaptations of results in the literature on modal operators in toposes are presented. The final reformulation of estimate safety is a completely elementary version in the language of an arbitrary topos where it is seen that estimate safety is equivalent to a certain forcing statement.

Explore related subjects

math.CT

Keep this discovery

BibTeXRIS

Michael Lambert. 2021-11-14. A Topos View of Blockchain Consensus Protocols. https://arxiv.org/abs/2111.07461

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

A model structure for cartesian 2-fibrations

Cartesian 2-fibrations provide a way to understand indexed categories, but their classical ``straightening'' construction requires several layers of weak coherence data. This paper develops a homotopical framework that replaces much of this bookkeeping with a fully strict model. By using marked 2-categories to record the cartesian morphisms and 2-cells, we construct a model structure whose fibrant objects are precisely the cartesian 2-fibrations over a fixed 2-category $\mathcal{C}$. We then show that the marked Grothendieck construction identifies these 2-fibrations, up to weak equivalence, with strict 2-functors from $\mathcal{C}$ into $2\mathrm{Cat}$. As an additional contribution, we construct localizations of 2-categories that simultaneously invert selected morphisms and 2-cells.

math.CT↗
arXiv2026

A Natural Fuzzy Order on Fuzzy Numbers

This paper introduces a natural fuzzy order on fuzzy numbers that extends the natural orders on real numbers and interval numbers. We investigate its completeness properties and show that the space of uniformly bounded fuzzy numbers is conically complete and conically cocomplete, and that it is complete if and only if the underlying continuous t-norm is the G\"odel t-norm. Moreover, it is proved that this space constitutes a \([0,1]\)-enriched domain if and only if the underlying continuous t-norm satisfies the (S) condition. These results provide a foundation for ordering fuzzy numbers.

math.CT↗
arXiv2026

Noetherian forms of free non-symmetric operads

In this paper, we study certain categories of labeled finite rooted ordered trees over a fixed set of labels where each label is equipped with an arity: a fixed number of children that the vertex with the given label must have. Equivalently, these are expression trees for operations in a free non-symmetric operad. A morphism between these trees matches a pruning of one tree (a prefix) with an entire subtree of another (a suffix). We characterize such categories, up to isomorphism, in terms of suitable exactness properties. It turns out that these categories exhibit strong algebraic behavior, in the sense that every such category, when appended with a strict initial object, has a particularly nice noetherian form.

math.CT↗