>To prevent Sybil attacks, it uses a mechanism like proof-of-stake that assigns weights to participants in committee selection based on the money in their accounts.
That line in the paper is actually describing Algorand in the "related works" section. Full quote:
"Algorand [26] uses a verifiable random function to
select a committee of nodes that participate in a novel
Byzantine consensus protocol. It achieves over 360 tps
with 50 second latency on an emulated network of 2000
committee nodes (500K users in total) distributed among
20 cities. To prevent Sybil attacks, it uses a mechanism
like proof-of-stake that assigns weights to participants in
committee selection based on the money in their accounts."
"Algorand [26] uses a verifiable random function to select a committee of nodes that participate in a novel Byzantine consensus protocol. It achieves over 360 tps with 50 second latency on an emulated network of 2000 committee nodes (500K users in total) distributed among 20 cities. To prevent Sybil attacks, it uses a mechanism like proof-of-stake that assigns weights to participants in committee selection based on the money in their accounts."