Hey folks, I've contemplated and searched in this topic quite a white, so beyond maintaining a chain and performing some kind of mining - either PoW or PoS family, is there a consensus algorithm (that could be used in distributed system) which is open membership (so node could join and leave on the fly) as well as byzantine fault tolerant (thus malicious node could stop functioning, and could even send different messages to different groups of honest nodes)?

So I've listed some existing algorithms below:
1. Paxos and Raft - close membership, and also not byzantine fault tolerant (only tolerant to fail-stop failure)
2. Practical byzantine fault tolerant algorithm (PBFT): close membership, and researchers point out that any group with >20 nodes may see huge performance drop.
3. Stellar consensus protocol (SCP) - it claims to be open membership and byzantine fault tolerant by bringing in the concept of "quorum" and "quorum slice", but it's hard for me to fully understand how it works though... (https://www.stellar.org/blog/stellar-consensus-protocol-proof-code/) Is there any expert can give some insight please?
4. Any more?...

Please correct me if I'm wrong and I'm earnest to know more about this topic