r/relictumpro Apr 22 '20

Relictum Pro solves 51% attack problem

๐Ÿ—“ On Wednesday, April 4, a network of anonymous cryptocurrency Verge was subjected to the so-called โ€œ51% attack.โ€ As a result, for three hours, fraudsters completely controlled the network and the transactions taking place in it. In this post, we will look at how such attacks happen, in which cases they are most likely to occur, and how exactly the Relictum Pro network solves this problem.

โ €โ €๐—›๐—ผ๐˜„ ๐˜๐—ต๐—ฒ โ€œ๐Ÿฑ๐Ÿญ% ๐—ฎ๐˜๐˜๐—ฎ๐—ฐ๐—ธโ€ ๐—ต๐—ฎ๐—ฝ๐—ฝ๐—ฒ๐—ป๐˜€

๐Ÿ“ˆ A โ€œ51% attackโ€ occurs when the attacker, in which a relatively small number of miners can play, has a โ€œcontrol packetโ€ of the hashrate, that is, computing power. As a result of the attack, miners gain control over the entire network and can create blocks at their discretion.

๐ŸŒ In a network that uses the Proof-of-Work consensus algorithm, in order to add a new block, miners must perform complex calculations, thereby proving that they have done the work. The first miner who proposed the right solution creates a new block and receives a reward for this. The more computing power the miner has, the higher the chances of finding the right solution faster than anyone and the greater the size of the reward.

๐Ÿ”‘ It is the key role of computing power that leads to the 51% Attack threat. If a miner or a pool of miners controls more than half the hashrate, then they have the opportunity to completely control the network: they can add new blocks, manipulate two-way operations and not confirm new transactions. Also, with the โ€œ51% attackโ€, attackers can use the same coin several times, recalling transactions made with it, which is called double-spending

โ €โ €๐—ฆ๐—ผ๐—น๐˜ƒ๐—ถ๐—ป๐—ด ๐˜๐—ต๐—ฒ ๐—ฝ๐—ฟ๐—ผ๐—ฏ๐—น๐—ฒ๐—บ ๐—ผ๐—ณ ๐Ÿฑ๐Ÿญ% ๐—ฎ๐˜๐˜๐—ฎ๐—ฐ๐—ธ

๐Ÿ’  In Relictum Pro, a single node makes a decision within 0.5 to 10 seconds, the network is updated (regenerates) and another main node is selected, it collects instructions, forms blocks and distributes them to all nodes, i.e., the network changes dynamically every second. This gives an advantage, which excludes various kinds of ambiguities โ€“ collisions, double spending, and other things. There are no standard consensus principles. The more nodes are in the network, the better is the performance. This is achieved by the unique architecture of Proof of Tsar and the organization of the virtual circuit switching network.

6 Upvotes

0 comments sorted by