New Idea for the Geographical coordinates and network coordinates #622
internet-zero
started this conversation in
General
Replies: 0 comments
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
The internet is moving from a centralized network towards a decentralized network, the reason being “The Decentralized Web will enable users and creators to interact and exchange value directly in a peer-to-peer fashion, removing the role of centralized platforms as middlemen that extract value from these interactions."
This “Decentralized Web” should have nodes or servers that are distributed across the globe, instead of all the nodes being in the cloud or in one country. Due to geo-political risks and natural disaster risks, the best for any decentralized network is to have nodes across the globe with a very high data availability so that no external threat can compromise the network!
Due to the globality of the nodes, the time taken for interactions between nodes should be minimal, and the energy consumed (across the globe) due to these interactions should be minimal as well. Below we provide a brief description of the mathematical algorithm developed by the Archethic blockchain team inspired by the distribution of stars in the galaxy. Astrophysicists and Researchers have studied in a very profound way the distribution of stars in the galaxy and have deduced a mechanism to calculate the exact 3-dimensional position of a star by just using the distance between stars and center of mass of the stars. Archethic adopts a similar mechanism to calculate the node positions by just having the latency between nodes and the center of mass of the nodes in the P2P network!
The Algorithm
Step 1: Retrieving the Latencies from Beacons Chains
From the Beacons Chains, every node in the P2P network will have the Latencies Matrix (dij) of shape (n×n)
(latency between two nodes is the minimum time taken to respond when a transaction is sent from one node to another).
Where,
n is the number of nodes in the network.
[N1, N2, N3.... ] are nodes in the network.
Latency between nodes i and j is represented by dij where 1<= i <=n, 1<= j <=n.
dii = 0 (there is no latency between the node i (Ni) and itself)
For Example: d23 = Latency between node N2 and N3.
Beta Was this translation helpful? Give feedback.
All reactions