RATE Group | Google Quantum Breakthrough Could Improve Proof-of-Stake
66550
post-template-default,single,single-post,postid-66550,single-format-standard,ajax_fade,page_not_loaded,,qode_grid_1300,side_area_uncovered_from_content,footer_responsive_adv,qode-content-sidebar-responsive,qode-child-theme-ver-1.0.0,qode-theme-ver-13.3,qode-theme-bridge,wpb-js-composer js-comp-ver-7.9,vc_responsive
 

Google Quantum Breakthrough Could Improve Proof-of-Stake

26 Oct Google Quantum Breakthrough Could Improve Proof-of-Stake

Posted at 04:48h in Cryptocurrency News by

[ad_1]

The application of Google’s quantum computing technology could purportedly help improve the technology which underpins proof-of-stake (PoS) cryptocurrencies.

Quantum computing would create truly random numbers

PoS is a type of consensus algorithm where block creators are randomly chosen with probability proportional to their stake, while the algorithm of proof-of-work-based digital currencies uses mining. However, the PoS variant has raised doubts regarding the integrity of random selections.

Scott Aaronson, a quantum theoretician at the University of Texas at Austin, told Fortune on Oct. 23 that quantum computing could assuage PoS-skeptics doubts, as a quantum supremacy experiment could generate certifiably random numbers. He previously wrote on his personal blog:

“A sampling-based quantum supremacy experiment could almost immediately be repurposed to generate bits that can be proven to be random to a skeptical third party (under computational assumptions). This, in turn, has…

[ad_2]

Source link

Tags:
, , , ,