Modern epistemology, or more specifically epistemic logic, has much to do with practical Byzantine Fault-tolerance. We lay out relevant concepts below.
Infocologically-sane consensus protocols must satisfy the following conditions:
1) New transactions are broadcast to all Nodes.
1.1) Factivity Order : False information is not stored.
(Rollback)
√ Persistence
2) Each Node collects new transactions into a block.
2.1) Motive Order : Only purposeful information is stored.
(Recovery/Checkpointing)
√ Uniqueness
3) Each Node works on finding a difficult proof-of-work for its block.
3.1) Byzantine Order : Node having information, i, is a Good Actor.
(Fuzzy Voting)
√ Scalability
4) When a Node finds a proof-of-work, it broadcasts the block to all Nodes.
4.1) Incept Assertion : Transmission of information, i, implies one has
Order run a checksum or smooth simulation internally.
(Rejuvenation)
√ Universality
5) Nodes accept the block only if all transactions in it are valid and not already spent.
5.1) Assertion Order : If Node asserts p, then all machines can confirm
that Node knows p.
(Mask/Material Implication)
√ Opacity
6) Nodes express their acceptance of the block by working on creating the
next block in the chain, using the hash of the accepted block as the
previous hash.
6.1) Closure Order : Node stores all deductions of p assuming Node
stores ancestry of p.
(Confinement/Reduction)
√ No Side-effects
7) Anti-luck Order : Information excludes stochastic luck.
(Retry/Retransmission)
√ Optional sameness
8) Achievement Order : Information is a technological achievement.
(Reconfig)
√ Global uniqueness
9) Ability Order : If Node stores p, then the truth of Node’s motive
for p must have been ensured through the exercise
of Node’s relevant technological abilities.
(Diagnose/Adaptive N-version programming)
√ Evolvability
10) Non-local Order : Some extension to the Achievement order.
√ Fully Non-dereferenceable