Not signed in (Sign In)

Not signed in

Want to take part in these discussions? Sign in if you have an account, or apply for one below

  • Sign in using OpenID

Site Tag Cloud

2-category 2-category-theory abelian-categories adjoint algebra algebraic algebraic-geometry algebraic-topology analysis analytic-geometry arithmetic arithmetic-geometry book bundles calculus categorical categories category category-theory chern-weil-theory cohesion cohesive-homotopy-type-theory cohomology colimits combinatorics complex complex-geometry computable-mathematics computer-science constructive cosmology deformation-theory descent diagrams differential differential-cohomology differential-equations differential-geometry digraphs duality elliptic-cohomology enriched fibration foundation foundations functional-analysis functor gauge-theory gebra geometric-quantization geometry graph graphs gravity grothendieck group group-theory harmonic-analysis higher higher-algebra higher-category-theory higher-differential-geometry higher-geometry higher-lie-theory higher-topos-theory homological homological-algebra homotopy homotopy-theory homotopy-type-theory index-theory integration integration-theory internal-categories k-theory lie-theory limits linear linear-algebra locale localization logic mathematics measure measure-theory modal modal-logic model model-category-theory monad monads monoidal monoidal-category-theory morphism motives motivic-cohomology nlab noncommutative noncommutative-geometry number-theory of operads operator operator-algebra order-theory pages pasting philosophy physics pro-object probability probability-theory quantization quantum quantum-field quantum-field-theory quantum-mechanics quantum-physics quantum-theory question representation representation-theory riemannian-geometry scheme schemes set set-theory sheaf simplicial space spin-geometry stable-homotopy-theory stack string string-theory superalgebra supergeometry svg symplectic-geometry synthetic-differential-geometry terminology theory topology topos topos-theory tqft type type-theory universal variational-calculus

Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.

Welcome to nForum
If you want to take part in these discussions either sign in now (if you have an account), apply for one now (if you don't).

n-Forum: Looking for guidance on how to approach analyzing Casanova with topos theory

Bottom of Page

1 to 1 of 1

  1.  
    • CommentRowNumber1.
    • CommentAuthormetaweta
    • CommentTimeAug 29th 2019

    Casanova is a live, safe consensus algorithm. It involves a set of v “validators”, each of which issue “blocks” once every minute. The blocks refer to the latest block each validator has seen from each of the other validators. The result is a partially ordered set of blocks, while the blocks from any particular validator are totally ordered. The safety proof involves reasoning about attestation statements like “block n ≤ k blocks from distinct validators, each of which ≤ l blocks from distinct validators, each of which ≤ block m”. I suspect there’s a topos whose subobject classifier captures the different levels of attestation of block n to block m. The maximal truth value for block m is when block n ≤ blocks from all v validators, each of which ≤ v other blocks from all v validators, each of which ≤ block m—that is, when block n has seen everyone see that everyone has seen block m. Then block n knows that block m will never be directly referred to again. A weaker but important truth value is when k and l are bigger than 2v/3; then block n considers block m “finalized”. Finalization becomes important when we start allowing blocks to conflict with each other.

    I don’t know where I should start looking for methods of constructing a topos that could be applied to a situation like this. Any suggestions?

1 to 1 of 1

  1.