Virtual voting is the method by which the hashgraph consensus algorithm, devised by Leemon Baird and used by the Hedera network, reaches agreement without nodes sending each other votes. Nodes share information through gossip about gossip: each message, or event, records not only new transactions but also which events the sender had already seen. Over time every node builds the same graph of who knew what and when.
Because each node holds this common history, it can calculate how every other node would vote in a classical Byzantine agreement protocol, simply by examining the graph. The algorithm groups events into rounds, picks "witness" events and decides which of them are "famous" by these calculated votes, which then fixes a consensus order and timestamp for all transactions. Removing vote traffic saves bandwidth, and the consensus mechanism is proven to be asynchronous Byzantine fault tolerant, provided that fewer than one third of the voting weight is faulty.
Ref 1070001377