ATOM (ATOM)Price Live Chart, Prediction, Market Cap, Token Unlocks, ATOM Concept Stocks CoinMeta

#	Exchange	Pairs	Price	+2%Depth	-2%Depth	Volume (24h)
1	BitMEX	ATOMUSDT	2.204	$31,610.46	$41,749.69	0
2	OKX	ATOMUSDC	1.674	$8,792.33	$10,481.22	472
3	CoinEx	ATOMUSDC	1.651	$8,792.33	$10,481.22	5,559
4	Bybit	ATOMUSDC	1.681	$8,792.33	$10,481.22	8,060
5	gate.io	ATOMUSDC	1.649	$8,792.33	$10,481.22	29,805
6	MEXC Global	ATOMUSDC	1.65	$8,792.33	$10,481.22	32,868
7	Kraken	ATOMUSDC	1.6643	$8,792.33	$10,481.22	33,875
8	Kraken	ATOMUSDT	1.687	$31,610.46	$41,749.69	39,001
9	KuCoin	ATOMUSDC	1.6541	$8,792.33	$10,481.22	49,285
10	Crypto.com Exchange	ATOMUSDT	1.648	$31,610.46	$41,749.69	51,367

#	Unlock Date	Unlock Amount	Unlock Value	Total Supply %	Unlock Details
No Data

6529

06-03 15:57

Follow

Today, a new chapter has been added to a crazy quantum saga. On March 31st, Google's quantum AI team published a landmark achievement regarding Shor's elliptic curve cryptography algorithm. From a technical perspective, this paper is a bombshell: its performance is 10 times better than existing technologies. To shock the blockchain field and sound the alarm, these optimizations were applied to secp256k1—the elliptic curve cryptography algorithm upon which Bitcoin and Ethereum signatures are based. But perhaps the most striking aspect of this paper isn't its technical aspects, but its social implications. Instead of following standard academic procedures, Google kept these optimizations secret, hiding them behind zero-knowledge proofs (ZK proofs). In an accompanying blog post, Google mentioned that they "communicated with the US government." Zero-knowledge proofs can prove the existence of algorithmic improvements without revealing details. The use of zero-knowledge proofs for academic censorship is unprecedented! As a co-author of this Google paper, I have personally experienced some of the background surrounding this censorship mechanism. Frankly, many aspects of this matter make me uneasy. While I believe the public should know more, my ability to reveal the truth is limited. However, one thing I must make clear: the professionalism of the Google team is exemplary, and they deserve praise. Censorship often backfires. The “Straissam effect”—trying to cover something up only attracts more attention—is playing out today. First, Google’s key optimization technique was rediscovered by the French. Even more exciting is that a collaborative challenge called “Shor-at-home” has just started. The challenge, hosted at ecdsa[.]fail, broke the Shor world record in just a few hours. Let’s talk about the rediscovery. Just two months after Google’s paper was published, French quantum expert André Schrottenloch cracked this key secret optimization technique. His paper, “Optimized Point Adder Circuits for Elliptic Curve Discrete Logarithms,” was published today on arXiv. Congratulations to André! He beat several other experts who were “nerdsnipping.” In a blog post published today, Craig Giedney, a global expert in Shor optimization, revealed that he had suppressed this optimization scheme for a whole year due to censorship pressure. Interestingly, Andre overlooked some subtle optimizations, including those initially released by Google and subsequent improvements. Shor's algorithm likely has significant room for improvement, which is precisely the significance of the ECDSA[.]fail challenge. The verification program developed for ZK proofs performs a dual function, automatically filtering valid submissions. Dozens of small, cumulative improvements are constantly emerging. As of this writing, the Google circuit has achieved an 8.4% performance improvement, measured by the product of the number of logical qubits and the number of Tofoli gates. Not bad! This "nerdsnipping" has gone far deeper than expected. Over the past few weeks, it has become clear that the impact of this research extends far beyond Andre and other quantum experts. Behind the scenes, a small group of amateurs has quietly begun their research. Inspired by Kapacsi-style automated research, they have used artificial intelligence techniques to study Shor. Ironically, the verification program for zero-knowledge proofs happens to provide an ideal reward function for artificial intelligence. The barrier to entry for this modern research approach is surprisingly low; even some non-experts, including a teenager, have found decent optimizations. If you'd like to join a Telegram group to connect with other researchers in automation, feel free to contact us :) Part Two: Neutral Atoms and Quantum Day The story didn't end with Google's IPO. On the same day Google went public, a low-profile startup called Oratomic released its own Shor paper, simultaneously. This paper caused a sensation, eventually becoming the most upvoted paper on scirate[.]com (a site that ranks arXiv papers). Oratomic's claim was astonishing. By borrowing Google's logical optimization approach and applying a custom physical optimization approach for neutral atoms, they achieved this. They claimed that only 10,000 physical qubits were needed to run Shor's algorithm on secp256k1. This number is incredibly low. Before Oratomic's paper was published, I knew almost nothing about neutral atoms, so I was deeply drawn in and decided to delve into the technology. I jumped down the rabbit hole, spending hundreds of hours on the subject. I was quite fascinated, watching every YouTube video I could find and consulting numerous experts. My conclusion? This technology is real, very real. Even Google recently decided to establish a neutral atom lab, marking their shift from focusing on superconducting qubits to neutral atoms. If you're interested in "qday," the day a quantum computer breaks the first production-ready cryptographic code, then neutral atoms are worth your attention. I gave a 30-minute talk at the ZKProof cryptography conference, sharing some of my insights on Shor's algorithm and neutral atoms. You can find it on YouTube by searching "zkproof neutral atom". There's an interesting observation regarding these two groundbreaking papers: neither Google nor Oratomic mentioned what their findings mean for qday. No timeline, absolutely none. This is particularly puzzling considering that the whole point of white-hat quantum cryptography is to inform predictions of qday and help the public make informed decisions. Therefore, I wanted to try to fill some gaps, much like Scott Aaronson did in his April 29th article. Based on all the information I have, including some worrying non-public information...I now believe there's a 50% probability that quantum cryptography will arrive in 2032, and a 10% probability in 2030. There's also a rumor that the US government has its own date: 2035. This date was initially proposed by the National Security Agency (NSA) and later adopted by the National Institute of Standards and Technology (NIST), at which time all US government departments would be prohibited from using cryptographic technologies vulnerable to quantum attacks. Simply put: in hindsight, this date is a joke and should be completely ignored. I don't understand how NIST could avoid being forced to implement this plan years earlier. Part Three: Post-Quantum Cryptography Now, we have ample reason to raise alarms. But don't panic. Rushing into an immature post-quantum cryptography system is tantamount to suicide. I believe the appropriate target date for the migration is 2029, about 3.5 years away. Coincidentally, 2029 is also the date jointly chosen by Google, Cloudflare, and the Ethereum Foundation. Currently, I dedicate most of my time to the secure migration of Ethereum to post-quantum cryptography, which is also part of a broader effort to streamline Ethereum. There is still much work to be done. We need to remove and replace BLS signatures at the consensus layer, KZG commitments at the data layer, and ECDSA signatures at the execution layer. The plan to achieve this is compelling and based on hash cryptography. Within the Ethereum Foundation, we have developed a Swiss Army knife called leanVM (github[.]com/leanEthereum/leanVM), powered by a hash-based SNARK algorithm. Its performance is fully guaranteed thanks to the outstanding work of Emile, Thomas, and other contributors. In terms of security, leanVM is a gem; it is a minimalist zkVM designed for end-to-end formal verification and maximum security. Want to contribute? Here are two $1 million initiatives. The first is the Proximity Prize (proximityprize[.]org). Solving a long-standing mathematical conjecture in coding theory and improving hash-based SNARKs could earn a million-dollar prize. Secondly, the Poseidon Initiative (poseidon-initiative[.]info) offers a $1 million prize for cracking Poseidon.

330

0

31

Paul Graham

06-03 08:19

Follow

Today, a new chapter has been added to a crazy quantum saga. On March 31st, Google's quantum AI team published a landmark achievement regarding Shor's elliptic curve cryptography algorithm. From a technical perspective, this paper is a bombshell: its performance is 10 times better than existing technologies. To shock the blockchain field and sound the alarm, these optimizations were applied to secp256k1—the elliptic curve cryptography algorithm upon which Bitcoin and Ethereum signatures are based. But perhaps the most striking aspect of this paper isn't its technical aspects, but its social implications. Instead of following standard academic procedures, Google kept these optimizations secret, hiding them behind zero-knowledge proofs (ZK proofs). In an accompanying blog post, Google mentioned that they "communicated with the US government." Zero-knowledge proofs can prove the existence of algorithmic improvements without revealing details. The use of zero-knowledge proofs for academic censorship is unprecedented! As a co-author of this Google paper, I have personally experienced some of the background surrounding this censorship mechanism. Frankly, many aspects of this matter make me uneasy. While I believe the public should know more, my ability to reveal the truth is limited. However, one thing I must make clear: the professionalism of the Google team is exemplary, and they deserve praise. Censorship often backfires. The “Straissam effect”—trying to cover something up only attracts more attention—is playing out today. First, Google’s key optimization technique was rediscovered by the French. Even more exciting is that a collaborative challenge called “Shor-at-home” has just started. The challenge, hosted at ecdsa[.]fail, broke the Shor world record in just a few hours. Let’s talk about the rediscovery. Just two months after Google’s paper was published, French quantum expert André Schrottenloch cracked this key secret optimization technique. His paper, “Optimized Point Adder Circuits for Elliptic Curve Discrete Logarithms,” was published today on arXiv. Congratulations to André! He beat several other experts who were “nerdsnipping.” In a blog post published today, Craig Giedney, a global expert in Shor optimization, revealed that he had suppressed this optimization scheme for a whole year due to censorship pressure. Interestingly, Andre overlooked some subtle optimizations, including those initially released by Google and subsequent improvements. Shor's algorithm likely has significant room for improvement, which is precisely the significance of the ECDSA[.]fail challenge. The verification program developed for ZK proofs performs a dual function, automatically filtering valid submissions. Dozens of small, cumulative improvements are constantly emerging. As of this writing, the Google circuit has achieved an 8.4% performance improvement, measured by the product of the number of logical qubits and the number of Tofoli gates. Not bad! This "nerdsnipping" has gone far deeper than expected. Over the past few weeks, it has become clear that the impact of this research extends far beyond Andre and other quantum experts. Behind the scenes, a small group of amateurs has quietly begun their research. Inspired by Kapacsi-style automated research, they have used artificial intelligence techniques to study Shor. Ironically, the verification program for zero-knowledge proofs happens to provide an ideal reward function for artificial intelligence. The barrier to entry for this modern research approach is surprisingly low; even some non-experts, including a teenager, have found decent optimizations. If you'd like to join a Telegram group to connect with other researchers in automation, feel free to contact us :) Part Two: Neutral Atoms and Quantum Day The story didn't end with Google's IPO. On the same day Google went public, a low-profile startup called Oratomic released its own Shor paper, simultaneously. This paper caused a sensation, eventually becoming the most upvoted paper on scirate[.]com (a site that ranks arXiv papers). Oratomic's claim was astonishing. By borrowing Google's logical optimization approach and applying a custom physical optimization approach for neutral atoms, they achieved this. They claimed that only 10,000 physical qubits were needed to run Shor's algorithm on secp256k1. This number is incredibly low. Before Oratomic's paper was published, I knew almost nothing about neutral atoms, so I was deeply drawn in and decided to delve into the technology. I jumped down the rabbit hole, spending hundreds of hours on the subject. I was quite fascinated, watching every YouTube video I could find and consulting numerous experts. My conclusion? This technology is real, very real. Even Google recently decided to establish a neutral atom lab, marking their shift from focusing on superconducting qubits to neutral atoms. If you're interested in "qday," the day a quantum computer breaks the first production-ready cryptographic code, then neutral atoms are worth your attention. I gave a 30-minute talk at the ZKProof cryptography conference, sharing some of my insights on Shor's algorithm and neutral atoms. You can find it on YouTube by searching "zkproof neutral atom". There's an interesting observation regarding these two groundbreaking papers: neither Google nor Oratomic mentioned what their findings mean for qday. No timeline, absolutely none. This is particularly puzzling considering that the whole point of white-hat quantum cryptography is to inform predictions of qday and help the public make informed decisions. Therefore, I wanted to try to fill some gaps, much like Scott Aaronson did in his April 29th article. Based on all the information I have, including some worrying non-public information...I now believe there's a 50% probability that quantum cryptography will arrive in 2032, and a 10% probability in 2030. There's also a rumor that the US government has its own date: 2035. This date was initially proposed by the National Security Agency (NSA) and later adopted by the National Institute of Standards and Technology (NIST), at which time all US government departments would be prohibited from using cryptographic technologies vulnerable to quantum attacks. Simply put: in hindsight, this date is a joke and should be completely ignored. I don't understand how NIST could avoid being forced to implement this plan years earlier. Part Three: Post-Quantum Cryptography Now, we have ample reason to raise alarms. But don't panic. Rushing into an immature post-quantum cryptography system is tantamount to suicide. I believe the appropriate target date for the migration is 2029, about 3.5 years away. Coincidentally, 2029 is also the date jointly chosen by Google, Cloudflare, and the Ethereum Foundation. Currently, I dedicate most of my time to the secure migration of Ethereum to post-quantum cryptography, which is also part of a broader effort to streamline Ethereum. There is still much work to be done. We need to remove and replace BLS signatures at the consensus layer, KZG commitments at the data layer, and ECDSA signatures at the execution layer. The plan to achieve this is compelling and based on hash cryptography. Within the Ethereum Foundation, we have developed a Swiss Army knife called leanVM (github[.]com/leanEthereum/leanVM), powered by a hash-based SNARK algorithm. Its performance is fully guaranteed thanks to the outstanding work of Emile, Thomas, and other contributors. In terms of security, leanVM is a gem; it is a minimalist zkVM designed for end-to-end formal verification and maximum security. Want to contribute? Here are two $1 million initiatives. The first is the Proximity Prize (proximityprize[.]org). Solving a long-standing mathematical conjecture in coding theory and improving hash-based SNARKs could earn a million-dollar prize. Secondly, the Poseidon Initiative (poseidon-initiative[.]info) offers a $1 million prize for cracking Poseidon.

461

0

31

sassal.eth/acc 🦇🔊

06-03 05:00

Follow

Today, a new chapter has been added to a crazy quantum saga. On March 31st, Google's quantum AI team published a landmark achievement regarding Shor's elliptic curve cryptography algorithm. From a technical perspective, this paper is a bombshell: its performance is 10 times better than existing technologies. To shock the blockchain field and sound the alarm, these optimizations were applied to secp256k1—the elliptic curve cryptography algorithm upon which Bitcoin and Ethereum signatures are based. But perhaps the most striking aspect of this paper isn't its technical aspects, but its social implications. Instead of following standard academic procedures, Google kept these optimizations secret, hiding them behind zero-knowledge proofs (ZK proofs). In an accompanying blog post, Google mentioned that they "communicated with the US government." Zero-knowledge proofs can prove the existence of algorithmic improvements without revealing details. The use of zero-knowledge proofs for academic censorship is unprecedented! As a co-author of this Google paper, I have personally experienced some of the background surrounding this censorship mechanism. Frankly, many aspects of this matter make me uneasy. While I believe the public should know more, my ability to reveal the truth is limited. However, one thing I must make clear: the professionalism of the Google team is exemplary, and they deserve praise. Censorship often backfires. The “Straissam effect”—trying to cover something up only attracts more attention—is playing out today. First, Google’s key optimization technique was rediscovered by the French. Even more exciting is that a collaborative challenge called “Shor-at-home” has just started. The challenge, hosted at ecdsa[.]fail, broke the Shor world record in just a few hours. Let’s talk about the rediscovery. Just two months after Google’s paper was published, French quantum expert André Schrottenloch cracked this key secret optimization technique. His paper, “Optimized Point Adder Circuits for Elliptic Curve Discrete Logarithms,” was published today on arXiv. Congratulations to André! He beat several other experts who were “nerdsnipping.” In a blog post published today, Craig Giedney, a global expert in Shor optimization, revealed that he had suppressed this optimization scheme for a whole year due to censorship pressure. Interestingly, Andre overlooked some subtle optimizations, including those initially released by Google and subsequent improvements. Shor's algorithm likely has significant room for improvement, which is precisely the significance of the ECDSA[.]fail challenge. The verification program developed for ZK proofs performs a dual function, automatically filtering valid submissions. Dozens of small, cumulative improvements are constantly emerging. As of this writing, the Google circuit has achieved an 8.4% performance improvement, measured by the product of the number of logical qubits and the number of Tofoli gates. Not bad! This "nerdsnipping" has gone far deeper than expected. Over the past few weeks, it has become clear that the impact of this research extends far beyond Andre and other quantum experts. Behind the scenes, a small group of amateurs has quietly begun their research. Inspired by Kapacsi-style automated research, they have used artificial intelligence techniques to study Shor. Ironically, the verification program for zero-knowledge proofs happens to provide an ideal reward function for artificial intelligence. The barrier to entry for this modern research approach is surprisingly low; even some non-experts, including a teenager, have found decent optimizations. If you'd like to join a Telegram group to connect with other researchers in automation, feel free to contact us :) Part Two: Neutral Atoms and Quantum Day The story didn't end with Google's IPO. On the same day Google went public, a low-profile startup called Oratomic released its own Shor paper, simultaneously. This paper caused a sensation, eventually becoming the most upvoted paper on scirate[.]com (a site that ranks arXiv papers). Oratomic's claim was astonishing. By borrowing Google's logical optimization approach and applying a custom physical optimization approach for neutral atoms, they achieved this. They claimed that only 10,000 physical qubits were needed to run Shor's algorithm on secp256k1. This number is incredibly low. Before Oratomic's paper was published, I knew almost nothing about neutral atoms, so I was deeply drawn in and decided to delve into the technology. I jumped down the rabbit hole, spending hundreds of hours on the subject. I was quite fascinated, watching every YouTube video I could find and consulting numerous experts. My conclusion? This technology is real, very real. Even Google recently decided to establish a neutral atom lab, marking their shift from focusing on superconducting qubits to neutral atoms. If you're interested in "qday," the day a quantum computer breaks the first production-ready cryptographic code, then neutral atoms are worth your attention. I gave a 30-minute talk at the ZKProof cryptography conference, sharing some of my insights on Shor's algorithm and neutral atoms. You can find it on YouTube by searching "zkproof neutral atom". There's an interesting observation regarding these two groundbreaking papers: neither Google nor Oratomic mentioned what their findings mean for qday. No timeline, absolutely none. This is particularly puzzling considering that the whole point of white-hat quantum cryptography is to inform predictions of qday and help the public make informed decisions. Therefore, I wanted to try to fill some gaps, much like Scott Aaronson did in his April 29th article. Based on all the information I have, including some worrying non-public information...I now believe there's a 50% probability that quantum cryptography will arrive in 2032, and a 10% probability in 2030. There's also a rumor that the US government has its own date: 2035. This date was initially proposed by the National Security Agency (NSA) and later adopted by the National Institute of Standards and Technology (NIST), at which time all US government departments would be prohibited from using cryptographic technologies vulnerable to quantum attacks. Simply put: in hindsight, this date is a joke and should be completely ignored. I don't understand how NIST could avoid being forced to implement this plan years earlier. Part Three: Post-Quantum Cryptography Now, we have ample reason to raise alarms. But don't panic. Rushing into an immature post-quantum cryptography system is tantamount to suicide. I believe the appropriate target date for the migration is 2029, about 3.5 years away. Coincidentally, 2029 is also the date jointly chosen by Google, Cloudflare, and the Ethereum Foundation. Currently, I dedicate most of my time to the secure migration of Ethereum to post-quantum cryptography, which is also part of a broader effort to streamline Ethereum. There is still much work to be done. We need to remove and replace BLS signatures at the consensus layer, KZG commitments at the data layer, and ECDSA signatures at the execution layer. The plan to achieve this is compelling and based on hash cryptography. Within the Ethereum Foundation, we have developed a Swiss Army knife called leanVM (github[.]com/leanEthereum/leanVM), powered by a hash-based SNARK algorithm. Its performance is fully guaranteed thanks to the outstanding work of Emile, Thomas, and other contributors. In terms of security, leanVM is a gem; it is a minimalist zkVM designed for end-to-end formal verification and maximum security. Want to contribute? Here are two $1 million initiatives. The first is the Proximity Prize (proximityprize[.]org). Solving a long-standing mathematical conjecture in coding theory and improving hash-based SNARKs could earn a million-dollar prize. Secondly, the Poseidon Initiative (poseidon-initiative[.]info) offers a $1 million prize for cracking Poseidon.

346

0

30

vitalik.eth

06-02 21:59

Follow

Today, a new chapter has been added to a crazy quantum saga. On March 31st, Google's quantum AI team published a landmark achievement regarding Shor's elliptic curve cryptography algorithm. From a technical perspective, this paper is a bombshell: its performance is 10 times better than existing technologies. To shock the blockchain field and sound the alarm, these optimizations were applied to secp256k1—the elliptic curve cryptography algorithm upon which Bitcoin and Ethereum signatures are based. But perhaps the most striking aspect of this paper isn't its technical aspects, but its social implications. Instead of following standard academic procedures, Google kept these optimizations secret, hiding them behind zero-knowledge proofs (ZK proofs). In an accompanying blog post, Google mentioned that they "communicated with the US government." Zero-knowledge proofs can prove the existence of algorithmic improvements without revealing details. The use of zero-knowledge proofs for academic censorship is unprecedented! As a co-author of this Google paper, I have personally experienced some of the background surrounding this censorship mechanism. Frankly, many aspects of this matter make me uneasy. While I believe the public should know more, my ability to reveal the truth is limited. However, one thing I must make clear: the professionalism of the Google team is exemplary, and they deserve praise. Censorship often backfires. The “Straissam effect”—trying to cover something up only attracts more attention—is playing out today. First, Google’s key optimization technique was rediscovered by the French. Even more exciting is that a collaborative challenge called “Shor-at-home” has just started. The challenge, hosted at ecdsa[.]fail, broke the Shor world record in just a few hours. Let’s talk about the rediscovery. Just two months after Google’s paper was published, French quantum expert André Schrottenloch cracked this key secret optimization technique. His paper, “Optimized Point Adder Circuits for Elliptic Curve Discrete Logarithms,” was published today on arXiv. Congratulations to André! He beat several other experts who were “nerdsnipping.” In a blog post published today, Craig Giedney, a global expert in Shor optimization, revealed that he had suppressed this optimization scheme for a whole year due to censorship pressure. Interestingly, Andre overlooked some subtle optimizations, including those initially released by Google and subsequent improvements. Shor's algorithm likely has significant room for improvement, which is precisely the significance of the ECDSA[.]fail challenge. The verification program developed for ZK proofs performs a dual function, automatically filtering valid submissions. Dozens of small, cumulative improvements are constantly emerging. As of this writing, the Google circuit has achieved an 8.4% performance improvement, measured by the product of the number of logical qubits and the number of Tofoli gates. Not bad! This "nerdsnipping" has gone far deeper than expected. Over the past few weeks, it has become clear that the impact of this research extends far beyond Andre and other quantum experts. Behind the scenes, a small group of amateurs has quietly begun their research. Inspired by Kapacsi-style automated research, they have used artificial intelligence techniques to study Shor. Ironically, the verification program for zero-knowledge proofs happens to provide an ideal reward function for artificial intelligence. The barrier to entry for this modern research approach is surprisingly low; even some non-experts, including a teenager, have found decent optimizations. If you'd like to join a Telegram group to connect with other researchers in automation, feel free to contact us :) Part Two: Neutral Atoms and Quantum Day The story didn't end with Google's IPO. On the same day Google went public, a low-profile startup called Oratomic released its own Shor paper, simultaneously. This paper caused a sensation, eventually becoming the most upvoted paper on scirate[.]com (a site that ranks arXiv papers). Oratomic's claim was astonishing. By borrowing Google's logical optimization approach and applying a custom physical optimization approach for neutral atoms, they achieved this. They claimed that only 10,000 physical qubits were needed to run Shor's algorithm on secp256k1. This number is incredibly low. Before Oratomic's paper was published, I knew almost nothing about neutral atoms, so I was deeply drawn in and decided to delve into the technology. I jumped down the rabbit hole, spending hundreds of hours on the subject. I was quite fascinated, watching every YouTube video I could find and consulting numerous experts. My conclusion? This technology is real, very real. Even Google recently decided to establish a neutral atom lab, marking their shift from focusing on superconducting qubits to neutral atoms. If you're interested in "qday," the day a quantum computer breaks the first production-ready cryptographic code, then neutral atoms are worth your attention. I gave a 30-minute talk at the ZKProof cryptography conference, sharing some of my insights on Shor's algorithm and neutral atoms. You can find it on YouTube by searching "zkproof neutral atom". There's an interesting observation regarding these two groundbreaking papers: neither Google nor Oratomic mentioned what their findings mean for qday. No timeline, absolutely none. This is particularly puzzling considering that the whole point of white-hat quantum cryptography is to inform predictions of qday and help the public make informed decisions. Therefore, I wanted to try to fill some gaps, much like Scott Aaronson did in his April 29th article. Based on all the information I have, including some worrying non-public information...I now believe there's a 50% probability that quantum cryptography will arrive in 2032, and a 10% probability in 2030. There's also a rumor that the US government has its own date: 2035. This date was initially proposed by the National Security Agency (NSA) and later adopted by the National Institute of Standards and Technology (NIST), at which time all US government departments would be prohibited from using cryptographic technologies vulnerable to quantum attacks. Simply put: in hindsight, this date is a joke and should be completely ignored. I don't understand how NIST could avoid being forced to implement this plan years earlier. Part Three: Post-Quantum Cryptography Now, we have ample reason to raise alarms. But don't panic. Rushing into an immature post-quantum cryptography system is tantamount to suicide. I believe the appropriate target date for the migration is 2029, about 3.5 years away. Coincidentally, 2029 is also the date jointly chosen by Google, Cloudflare, and the Ethereum Foundation. Currently, I dedicate most of my time to the secure migration of Ethereum to post-quantum cryptography, which is also part of a broader effort to streamline Ethereum. There is still much work to be done. We need to remove and replace BLS signatures at the consensus layer, KZG commitments at the data layer, and ECDSA signatures at the execution layer. The plan to achieve this is compelling and based on hash cryptography. Within the Ethereum Foundation, we have developed a Swiss Army knife called leanVM (github[.]com/leanEthereum/leanVM), powered by a hash-based SNARK algorithm. Its performance is fully guaranteed thanks to the outstanding work of Emile, Thomas, and other contributors. In terms of security, leanVM is a gem; it is a minimalist zkVM designed for end-to-end formal verification and maximum security. Want to contribute? Here are two $1 million initiatives. The first is the Proximity Prize (proximityprize[.]org). Solving a long-standing mathematical conjecture in coding theory and improving hash-based SNARKs could earn a million-dollar prize. Secondly, the Poseidon Initiative (poseidon-initiative[.]info) offers a $1 million prize for cracking Poseidon.

442

0

43

Tesla Owners Silicon Valley

05-30 10:23

Follow

Lucid Motors Future Outlook: Cosmos, Earth, Lunar, and Autonomous Taxis We had an in-depth interview with Cory Steuben, Director of Cost Engineering at Lucid. Cory Steuben is a Lucid veteran, and we delved into Lucid's future direction, including Cosmos, Earth, Lunar, the mid-size platform, and autonomous taxis. In this interview, Cory shares insider information about Lucid's upcoming platforms and long-term vision—from new model projects to the role of autonomous taxis in its strategy. We explore how cost engineering is integrated into Lucid's overall strategy as it strives to move forward in the highly competitive electric vehicle market. Whether you're a Lucid enthusiast, curious about their next steps, or simply enjoy discussing the future of electric vehicles and autonomous driving technology, this interview will provide valuable insights. 📷 Please watch the full interview below. Enjoy!

442

0

37

Tesla Owners Silicon Valley

05-30 00:11

Follow

Lucid Motors Future Outlook: Cosmos, Earth, Lunar, and Autonomous Taxis We had an in-depth interview with Cory Steuben, Director of Cost Engineering at Lucid. Cory Steuben is a Lucid veteran, and we delved into Lucid's future direction, including Cosmos, Earth, Lunar, the mid-size platform, and autonomous taxis. In this interview, Cory shares insider information about Lucid's upcoming platforms and long-term vision—from new model projects to the role of autonomous taxis in its strategy. We explore how cost engineering is integrated into Lucid's overall strategy as it strives to move forward in the highly competitive electric vehicle market. Whether you're a Lucid enthusiast, curious about their next steps, or simply enjoy discussing the future of electric vehicles and autonomous driving technology, this interview will provide valuable insights. 📷 Please watch the full interview below. Enjoy!

306

0

48

Tesla Owners Silicon Valley

05-29 22:16

Follow

Lucid Motors Future Outlook: Cosmos, Earth, Lunar, and Autonomous Taxis We had an in-depth interview with Cory Steuben, Director of Cost Engineering at Lucid. Cory Steuben is a Lucid veteran, and we delved into Lucid's future direction, including Cosmos, Earth, Lunar, the mid-size platform, and autonomous taxis. In this interview, Cory shares insider information about Lucid's upcoming platforms and long-term vision—from new model projects to the role of autonomous taxis in its strategy. We explore how cost engineering is integrated into Lucid's overall strategy as it strives to move forward in the highly competitive electric vehicle market. Whether you're a Lucid enthusiast, curious about their next steps, or simply enjoy discussing the future of electric vehicles and autonomous driving technology, this interview will provide valuable insights. 📷 Please watch the full interview below. Enjoy!

371

0

42

☠️RISINGONE☠️🔱

05-29 17:46

Follow

🚨The White House is now directly "betting" on next-generation technologies. The US government's investment in Intel years ago: • $890 million for a 9.9% stake • Cost price: $20.47 • INTC later surged to $115 • Book profit exceeded 460% Now, the same script is playing out in quantum computing. This time, the US government plans to invest approximately $2 billion in nine quantum computing companies, and not just subsidies—but direct equity stakes. The list includes: • IBM • D-Wave • Rigetti • PsiQuantum • Quantinuum • Atom Computing • Inflection • QuEra • Dirac Among them: • IBM received $1 billion • Rigetti's stock price surged 3.75 times at one point • Several companies received hundreds of millions of dollars in funding The most crucial change is not simply "investing money." Rather, the role of the US government has changed: In the past: subsidizing companies. Now: acting like a national venture capital firm, directly betting, acquiring equity, and gambling on next-generation technological infrastructure. First semiconductors, now quantum computing. The market's real sensitivity lies in this: Once government capital enters, the valuation logic of many companies will be rewritten. The White House is not just handing out money. It has begun to "go long on America's future technology."

447

0

49

Crypto Tony

05-24 18:21

Follow

Looking to get involved in robotics in 2026? Here are 10 companies I recommend to help you get involved: 1. TSLA Building one of the most vertically integrated humanoid robot technology stacks, integrating Optimus Gen 3 hardware, its proprietary AI5 inference chip, and an FSD-based AI brain powering its fleet. 2. NVDA Providing a platform layer for the entire robotics industry, featuring the Isaac GR00T base model, the Cosmos world model for synthetic training data, and onboard computing power from the Jetson Thor. 3. PLTR Providing the Foundry and Warp Speed operational task control layers for robot and autonomous vehicle fleets, integrating sensor and machine telemetry data into a single deployable operational map. 4. $OUST A leading pure-play 3D digital LiDAR company, its Rev8 native color sensor product line has been delivered to $GOOGL and Volvo Autonomous Driving, and is directly integrated into NVIDIA's Jetson robotics stack. 5. $AVGO Provides custom network chips, Tomahawk + Jericho switching ASICs, and high-speed connectivity for data transfer between robots, sensors, and servers in the autonomous system stack. 6. $AVAV $KTOS $AVEX $ONDS Building drone swarms to support autonomous defense networks. 7. $QCOM Provides the Snapdragon Ride autonomous platform and on-device AI inference SoCs, powering perception, decision-making, and motion control loops within robots, drones, and vehicles. 8. $SYNA Astra's multimodal edge AI processor provides wireless connectivity and sensing for smart appliances, factory automation, and autonomous robotic systems; its core IoT product sales grew 31% year-over-year. 9. $ISRG $PRCT $SYK $MDT Providing surgical robots that are reshaping the operating room. 10. Amazon ($AMZN) Amazon deploys hundreds of thousands of warehouse robots to move and pick goods, while SYM and SERV are working to build autonomous mobile robots to support order fulfillment and last-mile retail logistics. Am I missing something?

310

0

47

Mario Nawfal

05-22 02:47

Follow

The Trump administration in China has spent $2 billion to acquire minority stakes in companies including IBM, GlobalFoundries, D-Wave, Rigetti, Infleqtion, Atom Computing, PsiQuantum, Quantumuum, and Diraq. IBM alone received $1 billion in investment (the company will match the investment) to build a dedicated quantum chip foundry in upstate New York. The goal? To be one step ahead and crack existing encryption technologies within the next decade, defeating China. The federal government has begun phasing out systems with vulnerabilities. Taxpayers have now officially become venture capitalists. The news sent stock prices soaring: Infleqtion jumped 34%, and other companies saw their share prices rise by more than 20% within hours. The summer of quantum technology has truly arrived… Source: TradingView

321

0

36