A question about when majority is broken:
Close Group Consensus requires no more than half the elders to be dishonest.
PARSEC requires no more than a third the elders to be dishonest.
Do I understand correctly that only dishonest elders matter? Dishonest adults or infants do not matter for the functioning of PARSEC or CGC, right?
What happens when 3 of 8 elders are dishonest? This means PARSEC is dishonest but CGC is not.
A question about the supermajority definition:
Why does the supermajority require “No member that was consensused to have left our section in our gossip_graph will ever be considered again as a voting member in this definition”? It’s not really clear from the rfc why they cannot be allowed to return.
This blacklist brings some implementation questions:
Can the blacklist be derived automatically from the datachain of network events or is it stored separately?
Is the blacklist shared to all nodes in the section or just elders?
Can it be trimmed or does it continue to grow forever?
Is the blacklist split / merged when forming new sections?
Is it stored locally or does it get stored as mutable data on the network itself?
What is the consequence of failing to blacklist / having a very old blacklisted node return to the section?
A question about who is involved in gossip:
Do all nodes retain the datachain and gossip it to each other or just the elders? Only elders may vote, but I couldn’t work out whether all nodes (elders and adults and infants) must be involved in gossip.
This is not clear from the definition of “node: member of the network that takes part in the consensus algorithm” - do infants and adults ‘take part’ even if they don’t vote?
I am curious because it seems there are two things to control: voting for truths, and announcing new truths. The announcing part seems open to abuse if all nodes are able to gossip because infants could announce a lot of trash and it must be dealt with by recipients (even if they never propagate trash further).