Happy birthday Vitor.🎊🎈. Mine is on 'November 18'… 🚀
Proof of work doesn’t mean the coin is harder to make. It just means that it’s harder to make a block that gets accepted & that block takes longer to produce than an ordinary block. That's why miners will typically use ASICs & not GPUs (graphics processing units).
Difficulty is an integer parameter that governs how likely it’s for a block to be accepted. This’s determined by the proof of work system & periodically adjusted.
The mining algorithm isn’t a secret because it’s specified in the Bitcoin protocol. https://video.nostr.build/f83a3d8d03eaeaa422b4b6afffaeef82adba3fa0c71957c489580a944dcb0e02.mp4
With castle in a valley ?? 🏰
If the interest rate on Bitcoin is higher than the expected inflation rate, then the price of Bitcoin should increase, Conversely, if the interest rate on Bitcoin is lower than the expected inflation rate, then the price of Bitcoin should decrease. https://video.nostr.build/ec490721d9f3c44251b8a99317af333016c92df14c29b42bbccf1f1a20e6f8d4.mp4
The challenge lies in finding a balance between scalability, security & decentralization…
While relying on computations, let’s hope that Lightning via its 'channels' don’t turn in centralization..
Sovereign Node should achieve some requirements but can’t over scaling the network.. https://video.nostr.build/808d095197776d412ac9d728b92e551f15b9460d34498e514d6cff5e1502ebf0.mp4
Quantum money by Peter Schor..
https://www.appstate.edu/~hirstjl/Turing/5pm3_Shor.pdf nostr:note1dxatc0lghaemh2f3zxdekmrc3rs3z29avzte4ea55ez928r3rz7s6kkkdk
Why 1 BTC should equal 10^8 Sats ???
Some have never found out why??
https://bitcointalk.org/index.php?topic=819656.0 nostr:note1p9n5jt00c2ygf0rmvpnnhh3y33q9yra3n3xwz34v2t2ck2v3dapszqz5gm
"If we solve the sock-puppet issue, or accept that there's a central point controlling the generation of new keys, then generation of coins should be tied to the act of successfully adding a block to
the "consensus" chain". ~Ray Dillinger
https://www.mail-archive.com/cryptography@metzdowd.com/msg10005.html
What is Shor's factoring algorithm… Introducing by the real 'Peter Schor'.. https://video.nostr.build/ce35f41c1f901d37d7110573a7a29d58cee89de8b0b5ff4577376ab8def12f7e.mp4
In the realm of quantum computing, if #RSA encryption, serving as the foundation for digital security, were to be breached, what implications arise concerning the unauthorized acquisition of assets such as #Bitcoin?
Furthermore, what specific actions could adversaries undertake with this compromised information & how can these risks be effectively mitigated within the evolving landscape of quantum technology ? nostr:note10wydguqhnp6qhultadlterr4f50wwrllxua36udax4x7qmsuy6wqw8c7f4
Try this after scrutinizing it thoroughly!
https://www.quantumcomputing.ph/programming-shors-algorithm/
Me also... The claims may not be productive & synthetic but I can in no way emphasize it as false! But if this seems to be true, it’s a crucial step forward in cybersecurity field. Otherwise, I made a request for a copy of the original paper..
Many research have the same scenario..
The achievement of factoring 48-bit numbers with a 10-qubit quantum computer is a notable demonstration of quantum computing's potential. It indicates that smaller quantum computers can already handle certain tasks effectively. Okay, the statement also alludes to the scalability challenge when moving from a 10-qubit to a 433-qubit processor like IBM's Osprey. While there are no obvious barriers to scaling up, the practical challenges of managing such large-scale quantum hardware remain.
What about the scaling factor??? That’s how it will be compute: Scaling Factor = 433 (Osprey) / 10 (10-qubit processor)
This yields a scaling factor of 43.3, indicating that the Osprey processor has 43.3 times more qubits than the 10-qubit processor… nostr:note1p60le62j89fzhdyeu8hd6ree39kgr3sgwpgmuvkgs3nda3cupl3srmpykn
'Factoring integers with sublinear resources on a superconducting quantum processor'.
'Supplementary material for “Factoring integers with sublinear resources on a superconducting quantum processor”.
A Chinese research group was able to factor 48-bit numbers using a relatively small 10-qubit quantum computer. It then introduces IBM's new "Osprey" processor, which boasts 433 qubits..
https://arxiv.org/pdf/2212.12372.pdf nostr:note19l88tgc3mxm48nnds7hk0vqf6fshemdfcm3c0lyggzrafnk0xkaqudd3wz
Practical application of Shor's algorithm to break RSA-2048 encryption using a real quantum computer is a significant challenge & likely not feasible..
Relying on a single quantum machine equipped with 20 million qubits, it's feasible to distribute the workload across 8 or 9 separate quantum machines, each equipped with approximately 4 million qubits. The key to making this distributed approach work effectively is connecting these quantum machines via quantum channels with 'substantial bandwidths', each operating at around 150 qubits/second.. (IBM Osprey is a 433-qbit QC).
Consequently, there’s a growing urgency to replace traditional RSA encryption with post-quantum, quantum-resistant algorithms due to the potential vulnerabilities of existing public-key encryption methods when faced with quantum attacks. I ignore the 8 empirical conjectures used in their process or otherwise it can be 'extended & quantum extended Church-Turing thesis', 'NISQ=LDP conjecture', 'bipolar aximatization conjecture'..
https://web.archive.org/web/20121115112940/http://people.ccmr.cornell.edu/~mermin/qcomp/chap3.pdf nostr:note10wydguqhnp6qhultadlterr4f50wwrllxua36udax4x7qmsuy6wqw8c7f4
Researcher Claims to Crack RSA-2048 With Quantum Computer.
"Quantum computing has become a reality. We broke the RSA-2048 key," ~Gerck.
https://www.bankinfosecurity.com/blogs/researcher-claims-to-crack-rsa-2048-quantum-computer-p-3536