🔥 Build on Nexa: BONFire #2
Join us for the second edition of BONFire!
Present:
Andrew Stone — Lead Developer
Shanice Desilva — Business Development & Ecosystem (B2B)
Francis Dufour — Community Manager
⌚️ 13:00 UTC — 28 January
👉 Join the Nexa Discord:
https://t.co/C8q9ni8EYU
The discussion will take place on Discord in the BON (Build On Nexa) voice channel, located at the bottom of the Main Channels.
🎉 The Biggest InterLink Event Ever - 4M Human Node Is LIVE!
InterLink is celebrating 4 million real users worldwide! Collect letters and win total rewards 100,000 USDT. Each spin gives a random letter. Combine them to form words and unlock rewards:
🧩 INTER → 5 USDT
🧩 INTERLINK → 50 USDT
🧩 INTERLINKLABS → 1,000 USDT
🧩 INTERLINKLABSITLX → 10,000 USDT
💰 USDT rewards go directly to your linked wallet.
📅 Event Duration: November 9 –23 (UTC 23:59)
Join Now: https://t.co/z5Ich2QnNQ
Let’s celebrate the power of the Human Network.
#InterLink #4MHumanNodeCelebration
Since that clown has blocked me, so I can't reply to his answers, I will post a reply here.
The paper analyzes the plain existential unforgeability (EUF-CMA) and strong unforgeability (sEUF-CMA).
The paper's identified flaws in the original Falcon proof primarily affect scenarios with adaptive signing queries (Q_s > 0), where simulation and divergence issues arise, but these do not significantly impact zero-query cases. In such scenarios, forging reduces directly to solving the underlying lattice problem with minimal overhead from the reduction, making it equivalent to breaking the base hardness assumption.
An attacker would still need to collect 2^64 signatures and even after recording this many signatures would still need ~2^113 operations (for EUF) or ~2^89 operations (for sEUF) to have a good chance of forging.
@tidecoin flips the PRNG bit correctly and will adapt to FIPS when the time comes.
Hope this clarifies the issue and the clowns who plan to build "quantumevm" are just clowns.
Invest wisely.