So Alex! Let's calculate this tiny bit of information on top of the baseline, the last person I talked to...

Hashgraph makes it possible to have all of the fantastic security properties of voting based algorithms without ever casting a single vote over the network, and it works pretty simply.

Basically, if we all have a copy of a database, all the transactions that get get gossiped have to go to everybody. So that's the minimum bandwidth baseline requirement. We can add a tiny amount of information on top of that base line. Basically, when I talked to you in addition to passing you, the transaction, I'm going to pass you a little bit of information that describes or says who's the last person I talked to and you're going to do the same.

So, every time you talk to a member of the network, you pass the transactions and you say who it was you spoke to last using that information. We can build up a picture of the gossip, basically a graph, the hash graph of the gossip about gossip, who has talked to whom and when. Using that, as an input to one of these pure voting based algorithms, we can calculate internally what each member would vote if they were to have cast their vote over the network. In other words, we do virtual voting.

Starts from 6:55