star retweeted
Making Bitcoin quantum-resistant involves more than just cryptography. Finding a suitable and secure signature scheme is only part of the challenge. Wallet management, transaction costs, and network-wide adoption are equally important.
Finding a solution is one thing. Making it practical for Bitcoin is another.
Keep exploring and pushing forward! 🚀💪
I love Bitcoin. I hope it can overcome the challenges of transitioning to be quantum-resistant and find a way to address the issues surrounding lost Bitcoin and Satoshi’s coins. 🙏
Bitcoin’s Emerging Post-Quantum Signature Scheme | BLOCKSTREAM RESEARCH
SHRINCS, the hash-based signature scheme recently specified by @Blockstream’s @n1ckler, @kudinov_mikhail and collaborators, is emerging as Bitcoin’s likely first post-quantum signature scheme. The co-authors published a draft security analysis today, pushing the proposal one step closer to readiness for practical use.
The scheme does, however, come with tradeoffs that have drawn some scrutiny from industry leaders. Stanford’s Dan Boneh, Ledger’s Charles Guillemet and Coinbase’s Yehuda Lindell, for instance, have all flagged concerns about the scheme’s functionality and security tradeoffs at the implementation level, while acknowledging its conservative cryptographic assumptions.
In today’s episode of MFTV, Head of MARA Foundation Isabel Foxen Duke sits down with the co-authors to get an update on the scheme’s development for Bitcoin, discuss current post-quantum signature research, and address the scheme’s most common criticisms.
youtu.be/C2t1Bhy65Ig
star retweeted
💥BREAKING: IOSCO (International Organization of Securities Commissions) REPORT: Implications of Quantum Computing on Financial Markets (November 2026)
7 Key Takeaways:
1. Quantum Threat:
A sufficiently powerful quantum computer could compromise widely used public-key cryptographic systems, including RSA and ECC.
2. Migration Challenges:
Migrating public blockchains to post-quantum cryptography (PQC) is particularly challenging because cryptography is deeply embedded in their core protocols, and upgrades require coordination across decentralized networks.
3. Signature Size:
ML-DSA-44 signatures are approximately 35–40 times larger than traditional ECC signatures, potentially increasing network congestion, storage requirements, and transaction fees.
4. Performance Impact:
The report cites a Solana quantum-resistant testnet result showing a roughly 90% drop in throughput when ECC was replaced with post-quantum signatures.
5. Unmigrated Assets:
Even after a blockchain adopts PQC, unmigrated accounts and dormant assets with exposed public keys may remain vulnerable to quantum attacks.
6. Layer 2 Risks:
Quantum-resistant L2 solutions may still be vulnerable if their underlying L1 systems rely on quantum-vulnerable cryptography.
7. Q-Day Timeline:
Some industry participants argued that financial institutions should prepare for the possibility of cryptographically relevant quantum computers emerging within the next five years.
Key Message:
PQC migration is a complex, multi-year process. Financial institutions should not wait for Q-Day to begin preparing.
📄 Source: IOSCO — Implications of Quantum Computing on Financial Markets (November 2026).
Summary compiled by ChatGPT based on the official IOSCO report.
🤖 Made with AI
Replying to @AnthropicAI
Your AI hates Whites & Asians, especially Chinese, heterosexuals and men.
This is misanthropic and evil. Fix it.
Frankly, I don’t think there is anything you can do to escape the inevitable irony of Anthropic ending up being Misanthropic. You were doomed to this fate when you chose your name.
The Name of the Wind.
很多人分不清楚老外说的各种名词缩写被搞的一头雾水,
我也是记不住,所以有必要加深一点印象用通俗的比拟来说说适合中文讨论的名词(仅代表个人粗浅的认识来梳理)
Post-Quantum Cryptography(PQC抗量子算法)
Fully Homomorphic Encryption(FHE:全原态加密)
Zero-Knowledge Proof(ZKP:零知识证明)
Secure Multi-Party Computation(MPC:多方安全计算)
PQC是换防量子计算机破解的新锁
MPC是几个人围桌一起算都不准互相偷看
FHE是把东西锁进保险柜后让别人直接在外面操作更新的加密容器
ZKP是只证明你有钥匙,但绝不把钥匙给出来让你看。
所以,大家看清楚了吗?
在区块链中,它们各自解决对应的问题,PQC抗量子算法是最基础最底层的东西,而FHE ZKP MPC是高级工具和应用,他们是可以组合使用的,
PQC的锁 + FHE的保险箱 + ZKP的证明 + MPC的分片钥匙,做成一套很强的隐私保护系统。
基础密码层:PQC 是有现在全球最大同行评审政府机构NIST评选的标准算法:
ML-KEM=开博尔/Kyber(对称密钥交换)-密钥封装
ML-DSA=锂电池/Dilithium(格Lattice)-数字签名
SLH-DSA=斯芬克斯加/SPHINCS+(哈希Hash)-数字签名
(而区块链只能使用数字签名作为地基承重)--地砖基础层
应用层:隐私计算 / 分布式信任 FHE、ZKP、MPC、阈值签名、多方安全计算、分片技术、加密协议
MPC=MPTC;Multi-Party Threshold Cryptography
(墙体、上层建筑、大楼功能、解决单点故障问题各种变化)
难问题层:哈希、格问题 LWE、编码问题、哈希抗碰撞
(数学假设、大楼结构、整栋楼能不能立住拔高)
困难问题可以帮助地基提高安全强度更加坚固!
实用案例与比较:
经典电子时代(比特币椭圆曲线 secp256k1)
私钥:约32B
公钥:33 B(压缩)或 65 B(非压缩)
签名:约 70B(ECDSA Taproot 的 Schnorr 签名64 B
后量子时代(格 / 哈希数字签名)
NIST 标准算法 格 Dilithium
公钥:约 1.3–2.6 KB
签名:约 2.4–4.6 KB
相对经典签名(比特币)大约 40–70 倍大
NIST 标准算法 哈希,SPHINCS+ 无状态管理
公钥:32–64 字节(较小)
签名:约 7.8 KB到 30–50 KB
相对经典签名大约 100–800 倍或者更大
NIST候选算法 UOV
签名: 64 – 356 B
公钥:43.6 KB – 447 KB
私钥:70 B – 97.86 KB
未使用公钥索引技术(邮政编码化 #zipcodinization)公钥是比前面两个最大的根本没办法使用!
加上 FHE / ZKP / MPC 高级技术工具后的膨胀各是多少?
比特币椭圆曲线+FHE / ZKP / MPC 非常丝滑
如果比特币采用格和哈希再叠加上 FHE / ZKP / MPC 整体数据量和计算开销会在原来的基础上再放大数倍到数十倍。根本没办法长期高效地跑POW🥲🥲🥲❌❌❌
得出结论现有的抗量算法极其臃肿。在POW场景下直接上链会把区块撑爆和直接无法使用。
直接硬上 PoW 链基本不适合,勉强用会非常痛苦,但有可行的间接方案。
目前比较现实的路径是 重计算放链下,链上只做轻量验证,
ZK系列 (零知识证明)
把大量计算/签名压成一个证明,链上只验证证明或者是链下批量计算,链上只提交状态根 + 证明
代表的加密货币有:#QTC(Quantus ) #ABEL(Abelian)以太坊 #ETH
阈值 FHE/协作处理器系列(状态管理)
FHE 计算放在链下专用节点或阈值网络,链上只记录结果或轻量证明
代表的加密货币有:#XX Network
混合架构系列
普通交易用轻量 PQC 签名,隐私/复杂计算走二层 L1和L2混合可行性非常高
代表的加密货币有:#ABEL(Abelian)
#QRL、#ABEL、#ETH、#TRON、#ALGO
数据压缩 + 选择性上链系列
只把必要结果上链,原始密文/中间状态放链下 需要额外信任假设或证明来保证正确性。
代表的加密货币有:#QTC、#ABEL
媲美比特币BTC原生系列
公钥索引技术(邮政编化 #zipcodinization)#Multivariate #UOV #PowPQC #Stablecoin
代表的加密货币有:热矿 #Raqcoin
【编辑写作不易,其中肯定有偏差,不要喷我】
这些都是我个人理解+Ai整理的,希望大家看的明白,了解的比较清晰有一定的基础概念。
Replying to @xhymeishi
你现在百分百应在1个月内
花100小时在“抗量子算法”上
花在“比特币升级到抗量子算法”上
花在“万一比特币不能完全升级到抗量子算法”
万一比特币归零,
那么会不会有一种或几种
“抗量子计算机破解的加密货币”取而代之?
star retweeted
#抗量子 旧的币圈在瓦解!新的币圈再萌芽!抗量子代币会是以后的主角!看过来吧!我们在步道抗量子代币!raqcoin是唯一采用多变量算法和邮政编码化公钥压缩技术的抗量子代币。目前pow8年,兼具高并发多签属性。
币圈最讽刺的一幕:连卖币的理由都变高级了!🤣
CoinShares,一家管理74亿美元加密资产的上市公司,最近干了一件有意思的事:
ETH:6562枚,全部清仓。
SOL:50213枚,卖掉一半。
BTC:235枚,暂时保留。
一共套现1930万美元。
钱拿去干什么?
不是抄底 BTC,不是买入 SOL,也不是布局下一个百倍币。
而是回购自己公司的股票!
理由更扎心:
公司认为,相比继续持有 ETH 和 SOL,现在买回自己的股票更有投资价值。
这就尴尬了。
散户天天研究什么币能涨10倍,专业机构却在研究自己的股票值不值得买。
有时候,币圈最大的利空不是项目方跑路,而是连专业机构都开始嫌弃自己的持仓了。 🤣
你觉得这是聪明的资本配置,还是对 ETH、SOL 投下了不信任票?
star retweeted
我没有时间说服你!比特币毫无可能升级到抗量子技术!注意有一种或几种抗量子代币代替它两万亿市值。raqcoin是唯一采用多变量不平衡油醋算法和邮政编码化公钥压缩技术的抗量子代币。长期pow8年!兼具高并发多签属性。挖矿挖热矿!
热矿 #Raqcoin #Multivariate 采用了NIST候选算法UOV (油醋)+Ranbow(彩虹)
Rainbow (16,32,32,32)私钥 100,209 B/ 公钥 152,097 B/ 签名 64 B
UOV签名 64 – 356 B、公钥 43.6 KB – 447 KB、私钥 70 B – 100,209 B
(由此可以看出多变量签名都非常大:所有的抗量子算法都非常大)
Raqcoin采用的是公钥索引技术(邮政编码化 #zipcodinization)而不是公钥压缩技术!
POW稳定运行了8+年,从2018年6月18日创始区块(区块高度 0)就已经是量子安全的
Proof-of-Work (PoW) mining #PowPQC(解多变量挖矿方式)
挖矿方式是求解多变量多项式方程组,而非单一的多项式求解。其核心是求解多元(解数学题)二次多项式方程组。
挖矿过程就是在求解基于多变量多项式构造的数学难题。这与比特币求解哈希函数的挖矿方式有本质区别。
(比特币求解哈希函数又叫搜索哈希挖矿)在一个巨大的数字空间中盲目地“搜寻”一个符合特定条件的随机数,比特币的工作量证明(PoW)本质是一个暴力枚举(brute-force)过程而不是像解数学题那样有推导步骤。
算力单位:其算力单位是 MP/s(多项式求解速率),这也直接体现了挖矿的数学本质。
#Raqcoin #PQC #NIST #Multivariate #UOV #zipcodinization #MPC #ZKP #Stablecoin
star retweeted
💥BREAKING: NVIDIA Announces Collaboration With IBM and Fermi National Accelerator Laboratory to Launch Quantum-Classical Codesign Platform, Plus Error-Correction Breakthrough to Advance Practical Quantum Computing
🤖 Made with AI
Replying to @TrustlessState
No!
Bitcoin shall be deemed abandoned totally before Q-10...It doesn't make sense of quantum cracking any vulnerable add at Q-day.
🤖 Made with AI
star retweeted
Over-engineering workarounds to solve oversized post-quantum signatures, signature aggregation, and multisig just means higher risks and higher costs. Why not just use a post-quantum scheme with naturally short signatures, like #Multivariate?
Over the past few weeks I've gone from thinking leanPCS is total bull to being a total bull. So let me explain some of these buzzwords in more detail.
At the core, 8288 is about hyper-scaling data and execution for any computation that needs to get performed on a piece of data once, the chain learns the answer, and then we never need to see that data again. This sounds very specific, but it includes most "heavy" things happening on Ethereum:
* Signatures
* STARKs
* Merkle branches
* FHE computation
* ...
Really the first two are the most important.
Once we go quantum-safe, signatures get bigger (65 bytes ECDSA -> 1-6 kB WOTS/SPHINCS depending on params) and ZKPs get much bigger (200-1000 bytes with groth16, PLONK, etc -> 128 kB with STARKs). This is unsustainable to put on chain, and 8288 fixes this.
8288 works by aggregating STARKs in the mempool. First, you as a user generate the STARK or SPHINCS signature or PCS opening (more on that last one later), and publish it. Then, each node listens. Each tick, each node takes all of the new objects that it has seen, and generates a STARK containing a list of "claims":
"pubkey P has signed message M"
"program X run on data D has output Y"
"p(X) = Y for some polynomial P whose hash is H"
and a proof that it has seen a signature, STARK or PCS opening verifying those claims. So the only information getting re-broadcasted is:
(i) hashes of inputs and outputs (~64-96 bytes per claim)
(ii) a single STARK proof per tick
These aggregate proofs themselves get re-aggregated, and eventually you get to a single "master proof" in the block, that verifies that all of those statements are true. And so the only other data that has to actually go on chain is the statements (the (P, M), (X, D, Y), (X, Y, H) tuples I described above), not the actual signatures or proofs. This gets put into a specialized frame type.
Now, let's get into the leanSPHINCS vs leanSTARK vs leanPCS part.
The core distinction is: *what is the underlying object that the user is creating?*
In leanSPHINCS, it's a signature, and specifically this particular type of purely-hash-based signature: ethresear.ch/t/sphincs-minus…
If we add leanSPHINCS, then users will be able to make quantum-safe accounts, and pay only a little bit of gas (4096 for the 64 bytes) for each signature. So we get scalable quantum-safety for regular accounts, multisigs, etc. But it's only one specific signature scheme, you can't do anything else.
In leanSTARK, it's a STARK. This means it's fully general: the user runs whatever computation they want, and publish a STARK of it. So you can use it for:
* Any signature scheme (including eg. lattice-based ones if you like those)
* A multisig that hides its internal logic
* Privacy protocols
* Private account abstraction: authorization logic that depends on some value hidden elsewhere in the state, so you can have one key that controls all your accounts without publicly linking them to each other
Basically, it's a free for all, in the same way the EVM is a free for all.
But leanSTARK has a practical downside. The protocol would have to specify the language in which users write their programs (we call this the "ISA"). So we would have to agree on that language. This is a really big deal - it's the first big case of "Ethereum moving beyond the EVM" - and so it's likely to take time to agree on the details of it, especially since the ISA would be hard to upgrade. There are benefits to taking longer on this, figuring out the ideal ISA, and then even giving access to it inside regular contracts.
LeanPCS is the third option. PCS stands for "polynomial commitment scheme": a proof that P(x) = y. The most important thing to know about PCSes is that they are by far the most important "hard" component of a STARK (see here: vitalik.eth.limo/general/202… ). If you have a "magic PCS oracle" (which from the EVM's point of view, 8288 is), you can verify a STARK in ~20-40k gas.
The most important gain with PCS is that there is far less that we need to choose. Specifying a PCS only requires specifying a field, and there is a natural option: the 128 bit binary field (technically, we can go more general than that, and say the 2^k-bit binary recursive tower field, going up to 256)
LeanPCS is less efficient than leanSTARK onchain, because you would have to put multiple claims to prove one thing. But it's arguably more efficient offchain, because you have much more flexibility to choose proof systems.
But most importantly, leanPCS gives you the same generality as leanSTARK, in a way that could potentially be implemented very quickly. And once we figure out the ISA, we can add leanSTARK later.
So there is a route to getting "the cryptographic proof singularity" much faster than any of us expected, and that route runs through 8288 with leanPCS.
firefly.social/post/x/212092…
“認識下@Moshaikh
Aptos背後推手,價值200億美元騙局
他聯合創立Aptos,從各大風投籌4億后眼睜睜看著 $APT 幣損超99%,在收益兌現後即辭去CEO
他解釋是?需要“精神健康休息”。快進到2025年:他推出自己的5000萬美元風投,後漫不經心發推:我現在有筆不錯的 $SUI 投資了 -) 沒錯就是 SUI。”
Meet @Moshaikh
The guy behind Aptos, a $20B Scam.
He Co-founded Aptos, raised $400M from major VCs, watched $APT holders lose over -99% of their value, and stepped down as CEO right after his token compensation vested.
His explanation? A much-needed “mental health break.”
Fast forward to 2025: launches his own $50M crypto VC fund, then casually tweets:
“I have a nice $SUI bag now ;-)”
Yes, SUI. Aptos’ direct competitor, built using the same Diem technology.
So the guy who raised hundreds of millions building Aptos, collected his compensation, walked away, started a VC fund, and bought into the competition while $APT holders were left holding the bag.
Replying to @TheMarketMemo
The history speaks no the future, sir!
@remindme 4 years! and 10 years!
Saylor will very probably get something down again,
All mined-already Bitcoin can NOT be fully, completely, 100%, all migrated to genuie quantum-resistant even later by 2035!
It's already cooked!
How @Strategy ?
How Michael Saylor escaped jail after MicroStrategy’s 2000 accounting fraud collapse (mentioned in the video):
1. Civil Ticket, Not Criminal Charges: After restating two years of inflated revenue (and crashing $MSTR ~99.86% from its $333 peak after insiders sold $70M+ in stock), the SEC filed civil charges on Dec 14, 2000—not a DOJ criminal indictment. Saylor settled the exact same day without admitting wrongdoing: $8.3M disgorgement + a $350K fine.
2. Pre-Sarbanes-Oxley Timing: He settled in December 2000—18 months before Enron and WorldCom triggered the Sarbanes-Oxley Act of 2002 and the 2002–2005 DOJ crackdown that put CEOs behind bars for cooking the books.
3. Well-Connected Defense: Saylor was represented by Washington attorney Harvey Pitt—who was appointed Chairman of the SEC the very next year. Pitt argued they were simply "young, brilliant men" who didn't know accounting rules.
4. Zero Accountability Culture: By 2005, according to the D.C. Attorney General, Saylor had already moved on to dodging $25M+ in D.C. income taxes—which he later settled for $40M in 2024, again with no criminal charges and no admission of guilt.
5. Super-Voting Class B Shares: Saylor structured MicroStrategy with dual-class stock giving him near-total voting control. Even after the stock collapsed 99.9% and wiped out billions in market cap, common shareholders had zero voting power to remove him, and the board was completely captured.
Who actually got wiped out in MicroStrategy’s 2000 accounting fraud collapse?
• Retail momentum & margin buyers: Everyday investors who bought $MSTR near its $333 peak in March 2000 based on inflated profits, then watched it plunge 67% in a single day ($260 to $86) and lose over 99.86% by 2002. Margin calls wiped them out completely.
• Retirement & mutual fund savers: Ordinary 401(k) and growth-fund holders whose capital was poured into a "profitable" tech darling—before 1997–1999 results were restated from profits into losses.
• Late-joining employees: Staff whose stock options went worthless overnight, while top executives had already cashed out $70M+ in October 1999 at inflated prices.
• Class-action victims: Investors who lost billions had to settle for a fraction of their losses in a shareholder class action, while Saylor kept his 10:1 voting control of the company.
Saylor cashed out, paid a civil rounding error, and kept the company. Retail took the 99.86% wipeout.
By 2005, he was already onto the next scheme (settled for $40M in 2024).
Now his new scheme is becoming “Bitcoin Central Bank” to totally destroy Satoshi’s original purpose for Bitcoin.
What a shameless Wall Street grifter 🤡
star retweeted
Replying to @oragnes
世界上第一个 POW 后量子加密货币 #Raqcoin ᚱ
• 世界上最短的签名:Rainbow 64 字节 + UOV 80 字节
• 邮政编码专利技术将 MQ 公钥压缩至仅 8 字节
Github: github.com/abcmint/abcmint/…
raqcoin.top/wallet
star retweeted
Bitcoin can’t keep putting off its quantum-resistant transition. Waiting is not always the best strategy.
While industries worldwide are moving toward quantum-resistant security, Bitcoin still hasn’t reached a consensus on which quantum-resistant signature algorithm to adopt.
Some other cryptocurrencies are already taking a more proactive approach to quantum-resistant security than Bitcoin.
If Bitcoin keeps waiting until quantum computers can actually break its cryptography, there may not be enough time left to complete the migration, because migrating millions of users could cause significant on-chain congestion.
It’s time to take action, not just wait.
🔥 MUST WATCH: MICHAEL SAYLOR ABSOLUTELY DESTROYS THE #BITCOIN QUANTUM FUD IN UNDER 1 MINUTE
"THERE IS NO QUANTUM COMPUTER"
"THE DANGER IS UPGRADING SOFTWARE TO BE TOO COMPLICATED TOO QUICKLY BEFORE THE THREAT MANIFESTS ITSELF"
"YOU DON’T VACCINATE YOUR KID AT AGE 1 AGAINST SOME DISEASE THEY MIGHT GET AT AGE 67"
DON'T BELIEVE THE FUD. HODL 🚀
Source: @Strategy
Replying to @krugermacro
Zero chance to be all-mined-already bitcoins to be 100% migrated to quantum-resistant even later by 2035!
It's cooked already, imo! Alex!
star retweeted
Allow me to counter 3 claims here:
"THERE IS NO QUANTUM COMPUTER"
Scott Aaronson's latest estimate is that we could see a sufficiently powerful quantum computer before the next US president is sworn in. That's a much shorter timeline than Saylor assumes.
"THE DANGER IS UPGRADING SOFTWARE TO BE TOO COMPLICATED TOO QUICKLY BEFORE THE THREAT MANIFESTS ITSELF"
That's true. No one should rush into any upgrade. But within the range of rushing into something too complicated and doing nothing, there are a few other option.
Not wanting to upgrade 'too quickly' should not result in upgrading too slowly. The time to start is now.
"YOU DON’T VACCINATE YOUR KID AT AGE 1 AGAINST SOME DISEASE THEY MIGHT GET AT AGE 67"
That's not true, but suppose it was, what about vaccinating someone at age 65 against a diseas they might get at age 67?
I love Bitcoin. The Bitcoin community should speed up preparations for Q-day.
🔥 MUST WATCH: MICHAEL SAYLOR ABSOLUTELY DESTROYS THE #BITCOIN QUANTUM FUD IN UNDER 1 MINUTE
"THERE IS NO QUANTUM COMPUTER"
"THE DANGER IS UPGRADING SOFTWARE TO BE TOO COMPLICATED TOO QUICKLY BEFORE THE THREAT MANIFESTS ITSELF"
"YOU DON’T VACCINATE YOUR KID AT AGE 1 AGAINST SOME DISEASE THEY MIGHT GET AT AGE 67"
DON'T BELIEVE THE FUD. HODL 🚀
Source: @Strategy
Eli always has my respect, Even I sometimes disagree wtih him on quantum-threat, on bitcoin or ethereum path towards to quantum-safe, I still strongly suggest you guys taking Quantum as a FUD to think the questions what Eli provides over and over.
I look at Ethereum's proposal for quantum and AI readiness by the end of 2027, and while I don't think their timeline is realistic, I'm glad to see they're aiming for this goal.
The contrast with Bitcoin is striking.
Too many in the Bitcoin community still treat the quantum threat as something to ignore rather than something to prepare for, and this is dangerous.
Quantum is not FUD, and by the time the Bitcoin community realizes Q-day is knocking at the door, it could be too late.
So question to those who say quantum is FUD:
What would make you change your mind?
Which metric? Which milestone?





























