Analysis of Caduceus P2P network’s three tier architecture (Part 2): Hypercube Structure

Blockchain has brought huge improvements to internet companies, but it has also caused P2P network efficiency difficulties. Therefore, it is vital to address the efficiency issues in the P2P network immediately. In practice, the bulk of blockchain companies’ guiding concepts and technology tools are still anchored in the era of the old internet. For many organizations, only a fundamental understanding of the network’s core architecture exists, such as P2P networks, and other essential improvements aren’t made.

From the perspective of the large-scale P2P network transmission technology of the Caduceus platform, this paper analyzes the three-layer architecture of the Caduceus P2P network architecture technology based on the underlying technology principles of the P2P network, topology network, hypercube, DHP network, and Gossip.

In Caduceus’ three-layer P2P network design, the hypercube structure handles primary node communication structure.

Some variables impacting the routing and effectiveness of the P2P discovery algorithm in physical networks have emerged with the expansion of P2P system applications. Heterogeneity refers to the vast differences between nodes in the real network. In addition, the real network is subdivided into independent areas by routers and switches, representing the rigorous hierarchical structure.

What is the primary implementation framework of Caduceus’ permanent TPS, as implemented by the hypercube architecture, DHP network, and topological network technology architecture, and what disruptive effects will it have on the blockchain industry?

In Caduceus’ P2P network layer, for instance, four items will be transmitted to four nodes. After each node gets it, it sends it to other nodes without determining if other nodes can accept it. Other nodes have two options: sending all messages, or ceasing to transmit messages to other nodes.

The Gossip protocol allows for several operations to be started by various nodes and coordinated with other replicas. All of the Gossip network nodes are peer nodes, and they all relate to unstructured networks.

The two fundamental views, both referred to as “Six Degrees of Separation Theory,” are the dissemination of the Gossip protocol inside the cluster and the assurance of state consistency. A person may, in essence, get to know everyone in the whole globe via six intermediates. The following is the mathematical formula:

The letters “n,” “N,” and “W” stand for the complexity, total population and average connection width respectively. According to Dunbar’s number, which states that each person knows 150 other individuals, there are 1506 degrees between two persons (about 11.4 trillion).

Any information travels swiftly and there aren’t many network interactions, according to the six degrees of separation idea. The best example is the Facebook experiment from 2016, which went as follows: researchers looked at data from 1.59 billion registered users at the time and discovered that the “network diameter” of this magical number was 4.57, which means that there are 4.57 people between each person and other people.

There is no ideal solution in a distributed network and the Gossip protocol. Like all protocols they always contain certain flaws. The message’s latency is one of the flaws. The usage of the Gossip protocol will always result in message delays since nodes only haphazardly broadcast messages to a small number of nodes in the protocol. The messages finally reach the whole network via many rounds of dissemination. High real-time demanding situations are not fit for it.

2. The Gossip protocol requires that nodes randomly choose neighboring nodes to regularly transmit messages to, and the node that gets the message likewise repeats this process, therefore it is unavoidable that the message will be delivered to the same node frequently, resulting in the message being repeated. The node that receives the message is under a higher processing load due to redundancy. Therefore, even the node that has already received the message will continue to receive the replica, increasing the message’s redundancy.

When utilizing an exchange function, a hypercube is referred to as an N-bit hypercube since the diameter and node degrees are both N-bits. Each point represents a stage, and there are a total of 8 nodes, which accommodate the nodes of the second N power. There will be several distinctive qualities for each node. Each point, for instance, has to be linked to the three nodes around it. So what traits do they possess?

First, each node may be surrounded by three items and transformed into a “N”-bit root prime number. Each neighboring point differs from its neighbor in exactly one dimension. For instance, two nodes diverge along the X axis and the distinction between them is that it modifies the center portion. Each node may thus represent an “N”-bit root.

If n = 10 and r is the 10th power, then the hypercube can accommodate 1024 nodes. Then, we may recheck these eight nodes. Starting with 000, we must forward no more than three nodes to any node.

If the message transmission latency between nodes is 10 milliseconds, then we can broadcast a transaction from a single node to all nodes in 30 milliseconds or less.

The largest difference between a three-dimensional concept and its binary integer is 1. How can I transform “000” into “111”? Due to the fact that there are a total of n digits, the maximum number of times a variable may change is n. In the hypercube, the message is sent to other nodes, and the destination point must be reached after a maximum of 14.

If 10 milliseconds is utilized as the delay between nodes, then we may forward to all nodes within 100 milliseconds. In the subject of P2P networks and blockchain, there are two primary concerns. The first is the amount of time required for this node to reach all other nodes. After a transaction is received, for instance, the block and consensus may be negotiated, which influences the transaction’s confirmation time.

The second is the volume of messages. The smaller the amount of messages required for different networks, the smaller the amount of messages sent. This has some effect on the stress of our load and the less power we can handle per node.

Each node in an n-bit hypercube transfers at most N-1 bits of data. To broadcast to the whole network of hypercubes, an n-bit hypercube needs a total of two N-1 messages. Following the implementation of an n-bit hypercube network, the whole P2P network will be controlled. The message transmitted from a single point requires no more than ten transmissions to reach all locations. If the connection speed between nodes is 5 milliseconds, we need 10 milliseconds to ensure that all messages reach the network, every node receives them, and the number of broadcast messages is limited.

Explanation of Q

A k-dimensional cube or hypercube is a simple graph whose edges are pairs of k-tuples that take on different values at precisely the same position and whose vertices are all k-tuples with components picked from 0 and 1. A sub-graph of Qk has an isomorphic Qj for its j-dimensional sub-cube.

Due to the use of hypercubes, Caduceus consumes less energy between nodes within a constrained time window. Essentially, it can handle a greater number of nodes while the transmission time is reduced, and the broadcast period may be restricted.

Join the community:

Website: https://www.caduceus.foundation

Discord: https://discord.com/invite/caduceus

Twitter: https://twitter.com/Caduceus_CMP

Telegram: http://t.me/CaduceusMetaverse

Instagram: https://www.instagram.com/caduceus_cmp/