Gossip

According to the definition of Webster New World Dictionary, gossip is "a lazy story about others". I think gossip is morally wrong. Gossip is usually done by talking about the people behind it, which is very painful for the talking people. Whatever the information is, no one can talk about anyone. People who do gossip often feel that they are doing this to fall into a trap that makes themselves better by making themselves better and disappointing others.

About gossip Gossip Each participant (node) in the network randomly tells something news to some other people. This is a so-called gossip agreement, which is the fastest way to spread news on the web (office workers spread rumors, etc.). In addition, we will also explain when and whom news was obtained - about gossip gossip. These messages create a directed acyclic graph (DAG) that is undecipherable via a small cryptographic hash link. The first thing to mention is that this leads to the shared state across the network. Everyone knows that everyone else knows - in just a few seconds the communication cost is basically just 1%

The gossip protocol collects important information contained in the meta-eighth and processes new transactions. This includes the originating distributed network peer, the spread between peers, and so on. The entire history of messages related to new transactions that will be added when creating a new block are merged into the hash in chronological order. As a result, Hedera hash maps can predict how network peers will vote when authenticating and adding new transactions or blocks without actually voting. This ultimately saves a lot of time and greatly improves transaction processing efficiency. It also saves a lot of energy

This is very complicated. Hashgraph's gossip protocol allows you to propagate events quickly over the network. Because the graph represents gossip, information will also propagate effectively because nodes rarely receive the same byte more than once. In addition, using virtual voting to reach an agreement effectively streamlines transactions, even if the network can not proceed for temporary segmentation. On the other hand, consensus requires each node to receive the entire hash graph. As the number of nodes increases, the inbound bandwidth required for participation increases accordingly. Consensus also requires that all nodes and clients perform potentially expensive calculations. It is unknown whether the calculation will be enormous by the time it takes to wait for the network, or simply it will be dwarfed.