Infocologically-sane consensus protocols must satisfy the following conditions:
Factivity Order : False information is not stored.
(Rollback)
√ Persistence
Motive Order : Only purposeful information is stored.
(Recovery/Checkpointing)
√ Uniqueness
Byzantine Order : Node having information, i, is a Good Actor.
(Fuzzy Voting)
√ Scalability
Incept Assertion Order : Transmission of information, i, implies one has
run a checksum or smooth simulation internally.
(Rejuvenation)
√ Universality
Assertion Order : If Node asserts p, then all machines can confirm
that Node knows p.
(Mask/Material Implication)
√ Opacity
Closure Order : Node stores all deductions of p assuming Node
stores ancestry of p.
(Confinement/Reduction)
√ No Side-effects
Anti-luck Order : Information excludes stochastic luck.
(Retry/Retransmission)
√ Optional sameness
Achievement Order : Information is a technological achievement.
(Reconfig)
√ Global uniqueness
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
Non-local Order : Some extension to the Achievement order.
√ Fully Non-dereferenceable