We all want our data to be stored safely and to be available at all times without any delay and loss. At the same time the data should not be controlled by a person or by a group of people and most importantly should be safe from geo-political disasters, natural disasters, cyber attacks and many more. Hence Uniris Geolocation Patches are designed to obtain an overall balance from the perspective of an individual or a group to the perspective of the entire P2P network. To understand the need you need to understand the problems faced by current blockchains with respect to geo-location
1. Partially Centralized Storage: For example, many blockchains solutions have sharded pool of miners in a few parts of the world which are easily prone to geo-political risks, disasters risk, cyber attacks and many more.
2. Partially Centralized Mining: For example, 70% of Bitcoin Miners are in China and if they plan to take over the Bitcoin network they could easily do so with the 51% attack.
3. Finally the most important problem, an inability to balance & optimize data in the P2P network.
Geolocation Patches are an efficient and heuristic way of solving the above problems. The Patches are represented with a Patch-ID and are calculated by Geographical Coordinates (calculated from Public IP) and Network Coordinates (calculated from the latencies/RTT between nodes) of the nodes to provide an overview of where the nodes are located. Once the distribution of nodes in the P2P network is known then it can easily tackle any risk or attack. With this method the network is able to survive for centuries.
To solve the Network Coordinates, Uniris Team after studying the distribution of stars in the galaxy which is very similar to the distribution of nodes in the P2P network has provided a Heuristic Algorithm based on the Centre of Mass of the nodes and pioneered an unbreakable, immune, optimized geo-locally secured P2P network.
“KEEP YOUR EYES ON THE STARS AND FEET ON THE GROUND”
The Network Coordinate Heuristic Algorithm:
Below is a step by step procedure of solving the Heuristic Algorithm
- Calculating RTT: Each node in the P2P network interacts with other node and for each interaction the RTT (Round Trip Time) is calculated and the minimum RTT is taken into consideration.
- Nodes’s Centre of Mass: Similar to the centre of mass and 3D distribution of stars in the galaxy, the corresponding centre of mass and 2D distribution of nodes in the P2P network are calculated and are then distributed in the 2D plane.
(Note: For an in-depth Mathematical calculation refer the YellowPaper)
- Patch-ID for each Node: Each node is assigned with a Patch-ID for fast calculations. With this, the Uniris P2P network becomes immune to failure by natural & geo-political disasters, cyber attacks, etc.
Network Coordinates are used in Patch ID Calculations and Patches are used inside mining and storage heuristic algorithms to ensure perfect geographical replication (data availability/security) and also to optimize network requests. During the validation/replication process, the download will be performed from the nearest nodes (from network point of view), thus avoiding transfers that will cross the planet even though the data is already on a nearby node. Thereby optimizing the time and energy consumed by the P2P network for a high TPS and further preparing the network for any kind of risks or attacks like massive natural disasters, geo-political attacks, cyber attacks etc.
The Heuristic Algorithm is Built for the Future:
In the future there will definitely be nodes in space (yes, in space!) and this algorithm is even compatible to that by introducing a 3rd Coordinate to Nodes. Thereby optimizing data even for the nodes in space. Hence ensuring the ability to survive for centuries.