Gossip about gossip is the communication method at the heart of the hashgraph consensus algorithm, developed by Leemon Baird and used by the Hedera network. In an ordinary gossip protocol, nodes pass new transactions to randomly chosen peers until everyone has them. In hashgraph, each sync also creates a small signed record, called an event, that contains any new transactions, a timestamp and the hashes of two earlier events: the sender's own last event and the last event it received from the other node.
Because every event points to its parents, the events form a directed acyclic graph recording who told what to whom and when. Every node eventually holds the same graph, so each can calculate how the others would vote on the order of transactions without sending any votes. This virtual voting keeps message traffic low while still reaching a final, fairly ordered result.
Ref 1070001336