Reciprocal
Inv (stock): A message sent to the contract in the network to photograph the provision of data required by each knot.
GETDATA: This is a message that is sent to a knot that inquires about the data specified in Inv message.
Extension: A Extension From the graph is a subsidiary of the graph that connects all its heads with the minimum number of edges without forming any sessions.
introduction
Blockchain acquires great attention as it is supported by encrypted currencies due to the rapid growth of mimosine and the release of famous cryptocurrencies. However, one of the main challenges in Blockchain networks is the effective spread of the messages between the contract, which leads to the consumption of communication resources. In the conventional gossip protocol, a major problem is that the cumin problem – the knot must wait for the next session to transmit the message.
Plumtree’s algorithm is designed to reduce cumin and repetition in the transmission of messages, especially in counterpart networks to counterfeit systems and systems where reliable and fast messages are important. He can achieve this by finding the shortest path to sending the message to the following node in Extension. By doing this, each knot is involved in re -directing messages without relying on a central source.
This article turns into the implementation of the Plumtree algorithm in the Solana Network and its role in increasing the speed of messages in the network. Moreover, the comparison between Plumtree and Gossipsub, which is the epidemiological broadcasting algorithm based on gossip is used in Ethereum.
Solana broadcast
In Solana, the method of spreading a mass based on gossip is as follows: When the knot receives a new block, it is sent a broadcast A message to the other contract in the network. This broadcast includes information about the new block, such as the head of the block, transactions data, status changes, and other descriptive data such as compressed data, etc. When you receive broadcast The message, the receipt knot is achieved if it already has a block in the history of the professor’s book. When the contract is achieved from its history and has no record of this mass, it is sent inquiry Request to return to the broadcast knot, and inquire about the block data.
When the knot receives the bloc data that was inquired, it verifies it and adds it to the network. This ensures that the node does not share block data with each other node in the network frequently.
Plumtree algorithm
pedigreed
Plum is the fruit of PRUNUS, Local prunusA genus of trees that also include peaches, cherries, nicarin, almonds and apricots. Peach has a lot of health benefits. It contains a lot of nutrients, rich in antioxidants, promotes bone health, and helps reduce blood sugar. China and Romania are the largest plum producers.
The main sources of inspiration for Plumtree are as follows:
- Plum trees flourish in early spring.
- Fluencing flowers turned into peaches.
- Peach decreases 20-30 % before entitlement for various reasons or diseases, such as diseases caused by plant viruses.
- Peach age is about 2-6 weeks, even when it is stored at 0 ° C.
Plumtree’s algorithm implements these sources of inspiration as follows: Flower sites and peaches sites are represented as prescriptions; The drop of peaches before ripeness is represented by a Fruit (FT), and the lifetime of peaches after collected is represented by a Ripening (RT). The two thresholds develop three types of equations to update flower parking.
How does Plumtree work
Plumtree is a broadcast method that combines trees -based methods and gossip to reduce repetition while maintaining the reliability of high messages. In tree -based broadcasting, each knot is transmitted and efficient is improved by redirecting messages based on trees only. It also uses the bonds based on gossip between the contract to deal properly with the failure between the rotation.
In a tree -based broadcast, a tree consisting of all the participating nodes is created, and the messages are only transferred along the tree, which reduces the repetition of messages. However, if the number of the contract increases, decreases, or in the event of a network failure, the tree becomes incomplete, and the message may not reach all nodes. For example, the block is broadcast, and Extension It was built with a Blumri algorithm. In subsequent broadcasts, the designed tree is used. If it is an exchange Inv and GETDATA The messages have been deleted, the blocks are not sent directly to the sub -nodes of the tree and thus failed.
In the broadcast based on gossip, when a knot is tried to broadcast a message, the node determines the contract randomly to send the message. The knot that receives the message for the first time is repeated this process to send the message, which not only provides high expansion capacity, but also makes the system more resistant to the failure of the network and the failure of the knot.
For example, when a message knot broadcasts, she chooses a node randomly to send to her. The knot that receives the message for the first time is repeated this process. This feature allows the system to respond flexible to the network failure and increase or decrease in the number of contract.
The following methods are used in broadcasting and gossip to spread data:
- Pushed: In this approach, once you receive a message, it is sent to the adjacent contract immediately.
- Lazy: In this approach, when she receives a message knot, she sends the letter of the message to the neighboring contract. If the knot does not receive the message, it submits a request to withdraw to the adjacent contract.
- Polish: Once the knot does not receive a message, it is inquiring about its adjacent contract –Polish In recently received messages to update her condition in this particular message.
Plumtree uses a mixture of excited payment mechanism to send a small number of messages and a lazy payment mechanism to help the transmission.
Blumri in the Solana Network
Solana uses an equivalent to counter -to -analogal with an algorithm inspired by trees, allowing effective data throughout the contract network without relying on a central source. This structure allows the publication of messages inside the network in a hierarchical manner, as the contract interacts directly and make each knot in the network operating independently in the transfer of messages to the subsequent node in the tree.
The stretch tree structure is created using the Plumtree’s contract for the contract in the Solana network, which provides a more developed approach to broadcasting information throughout the network. Basically, each knot participates with its direct neighbors, who in turn spread information through the tree of extension.
Differences between Plumtree and Gossipsub in Ethereum
The differences between the Plumtree and Gossipsub algorithm used to broadcast information in Solana and Ethereum, respectively, include:
- Uses on the Solana A tree Broadcast on trees The approach where the contract is connected in a hierarchical manner where the original node is connected to the child’s knot. The focus is on building the optimal guidance path over time by treating the repetition of messages, while it is used Gossipsub P2P concepts based on the topicWhere the contract shares specific topics related to the duties of the auditor and communication within the ethereum network. These self -improving exaggeration to find the shortest path to spreading messages.
- PTA is used on the Solana tree Epidemic But he focuses on dealing with repetition of messages by reducing peers with the optimal level messages, while in Gossipsub, messages are published via a The broadcast of the epidemic is random.
conclusion
In this article, we studied Plumtree in the Solana Gossip Protocol, with highlighting its trees based on the effective publication of the messages. We also compare it with Ethereum’s Gossipsub, indicating their differences.
