linguini

just one news publication, tiktok etc and we send

will be mainstream in a bit anyway easy hold

@WaiterG 2viXktrdeVyS7WWAB5T3C9XQ2kEmaSYcbx2RbALEpump

Hold on…

$seed was a good catch only issue it doesn't solve anything and defeats the purpose of crypto and the dev is emotional slow bleed, 0

@seams5s this is blatant misinformation the only post full stack quantum and privacy chain available is soqucoin, zec is far from quantum resistant

$ZEC The table says it all. ZEC = Bitcoin + Privacy + Quantum resistance Robinhood listed ZEC today. So, it really is ZEC = Regulatory friendly + Privacy + Quantum resistance + everything that Bitcoin is.

@CookDoc1993 what you think about $PSOQ

Jeets gonna cry once $cyber.sol is 300k+ If you missed #xeris and #1dev. This shi is a no brainer 🤝.

@mars_bugatti @0wned_0x @arkham this guy came to critique monero then shills an Israeli fed coin retard, your critique is still applicable to your own coin brev

@0wned_0x @arkham Monero is not zero knowledge AI can track pattern recognition now.

How To Track Zcash Transactions Zcash uses zk-SNARKs to enable private transactions, but most activity is still transparent and traceable on-chain. Our research breaks down how Zcash works and how to track ZEC flows. Read more below:

@XBTXMR @arkham retroactive de-anomization, centralisation ?

@arkham x.com/XBTXMR/status/…

$qst $psoq

@55bags @oleolse12057231 @xeriscoin ok i wont comment on yo shit truce god bless u

@linguinifi @oleolse12057231 @xeriscoin I assume this is the reason you get blocked. Baseless accusations, just to fud for no reason really. And, if you continue it in my feed, i too will do so.

I challenge anyone to find me a better L1 Blockchain than @xeriscoin Here is what Xeris has; PQS High TPS (10k+) Wallets/apps for both mobile and desktop (with inbuilt browsers). Triple consensus (pow+pos+poh) with a pending patent. Dex Launchpad Bot for TG. All on testnet

@oleolse12057231 @55bags @xeriscoin someone will join your ama soon there is alleged fraud taken place now this has escalated to many degrees now some whistle blowers coming out slowly

@linguinifi @55bags @xeriscoin Dude.. $Psoq should pay you to stop talking. Its obvious you dont know enough about this stuff. You was invited to talk on xeris space to debate and state your opinions but choose to not join in.

@oleolse12057231 @55bags @xeriscoin i have a job, if you have counterpoints please discuss i am not affiliated with that project just providing an alternative that's credited

@odenridercasey @elonmusk @drakefjustin @elonmusk

@elonmusk Exactly the scenario Soqucoin was built for. We replaced vulnerable ECDSA with native NIST FIPS 204 ML-DSA-44 (Dilithium) signatures for quantum-resistant tx authorization. On top: • Merkle-based logarithmic batching of Dilithium sigs (massive space savings) • LatticeFold+ verifier enabling ~100-byte proofs for hundreds of sigs with sub-millisecond batch verification • Lattice-based orders on commits for opt-in Lattice-BP++ privacy (ZK range proofs coming) Scrypt PoW + AuxPoW merge-mine with LTC/DOGE, 1-min blocks, no premine. Testnet live, mainnet targeted ~April 30 post Halborn audit Real production-ready PQC on a live native L1, not just theory. (Links: Soqu.org + open source GitHub repo for the Dilithium opcode & LatticeFold details)

Today is a monumentous day for quantum computing and cryptography. Two breakthrough papers just landed (links in next tweet). Both papers improve Shor's algorithm, infamous for cracking RSA and elliptic curve cryptography. The two results compound, optimising separate layers of the quantum stack. The results are shocking. I expect a narrative shift and a further R&D boost toward post-quantum cryptography. The first paper is by Google Quantum AI. They tackle the (logical) Shor algorithm, tailoring it to crack Bitcoin and Ethereum signatures. The algorithm runs on ~1K logical qubits for the 256-bit elliptic curve secp256k1. Due to the low circuit depth, a fast superconducting computer would recover private keys in minutes. I'm grateful to have joined as a late paper co-author, in large part for the chance to interact with experts and the alpha gleaned from internal discussions. The second paper is by a stealthy startup called Oratomic, with ex-Google and prominent Caltech faculty. Their starting point is Google's improvements to the logical quantum circuit. They then apply improvements at the physical layer, with tricks specific to neutral atom quantum computers. The result estimates that 26,000 atomic qubits are sufficient to break 256-bit elliptic curve signatures. This would be roughly a 40x improvement in physical qubit count over previous state-of-the-art. On the flip side, a single Shor run would take ~10 days due to the relatively slow speed of neutral atoms. Below are my key takeaways. As a disclaimer, I am not a quantum expert. Time is needed for the results to be properly vetted. Based on my interactions with the team, I have faith the Google Quantum AI results are conservative. The Oratomic paper is much harder for me to assess, especially because of the use of more exotic qLDPC codes. I will take it with a grain of salt until the dust settles. → q-day: My confidence in q-day by 2032 has shot up significantly. IMO there's at least a 10% chance that by 2032 a quantum computer recovers a secp256k1 ECDSA private key from an exposed public key. While a cryptographically-relevant quantum computer (CRQC) before 2030 still feels unlikely, now is undoubtedly the time to start preparing. → censorship: The Google paper uses a zero-knowledge (ZK) proof to demonstrate the algorithm's existence without leaking actual optimisations. From now on, assume state-of-the-art algorithms will be censored. There may be self-censorship for moral or commercial reasons, or because of government pressure. A blackout in academic publications would be a tell-tale sign. → cracking time: A superconducting quantum computer, the type Google is building, could crack keys in minutes. This is because the optimised quantum circuit is just 100M Toffoli gates, which is surprisingly shallow. (Toffoli gates are hard because they require production of so-called "magic states".) Toffoli gates would consume ~10 microseconds on a superconducting platform, totalling ~1,000 sec of Shor runtime. → latency optimisations: Two latency optimisations bring key cracking time to single-digit minutes. The first parallelises computation across quantum devices. The second involves feeding the pubkey to the quantum computer mid-flight, after a generic setup phase. → fast- and slow-clock: At first approximation there are two families of quantum computers. The fast-clock flavour, which includes superconducting and photonic architectures, runs at roughly 100 kHz. The slow-clock flavour, which includes trapped ion and neutral atom architectures, runs roughly 1,000x slower (~100 Hz, or ~1 week to crack a single key). → qubit count: The size-optimised variant of the algorithm runs on 1,200 logical qubits. On a superconducting computer with surface code error correction that's roughly 500K physical qubits, a 400:1 physical-to-logical ratio. The surface code is conservative, assuming only four-way nearest-neighbour grid connectivity. It was demonstrated last year by Google on a real quantum computer. → future gains: Low-hanging fruit is still being picked, with at least one of the Google optimisations resulting from a surprisingly simple observation. Interestingly, AI was not (yet!) tasked to find optimisations. This was also the first time authors such as Craig Gidney attacked elliptic curves (as opposed to RSA). Shor logical qubit count could plausibly go under 1K soonish. → error correction: The physical-to-logical ratio for superconducting computers could go under 100:1. For superconducting computers that would be mean ~100K physical qubits for a CRQC, two orders of magnitude away from state of the art. Neutral atoms quantum computers are amenable to error correcting codes other than the surface code. While much slower to run, they can bring down the physical to logical qubit ratio closer to 10:1. → Bitcoin PoW: Commercially-viable Bitcoin PoW via Grover's algorithm is not happening any time soon. We're talking decades, possibly centuries away. This observation should help focus the discussion on ECDSA and Schnorr. (Side note: as unofficial Bitcoin security researcher, I still believe Bitcoin PoW is cooked due to the dwindling security budget.) → team quality: The folks at Google Quantum AI are the real deal. Craig Gidney (@CraigGidney) is arguably the world's top quantum circuit optimisooor. Just last year he squeezed 10x out of Shor for RSA, bringing the physical qubit count down from 10M to 1M. Special thanks to the Google team for patiently answering all my newb questions with detailed, fact-based answers. I was expecting some hype, but found none.

@BigJohm36984 @55bags @xeriscoin even if it went to a billion it can still be a bad product if anything it shows peet isnt shilling goyslop for money your making a basic appeal to popularity argument very low tier

@linguinifi @55bags @xeriscoin Anything crypto Pete is shilling never does shit. Always empty hype false promises. No thanks. Having him pushing it so hard is an awful look. Pete has been fudding Xeris since 300k while his tokens don't do anything in comparison 🥱

@BigJohm36984 @55bags @xeriscoin he is very honest retracts bad calls, exposes he is a free thinker, debate me on the architecture on xeris these are bad arguments anyway who cares who is shilling or not lets look at the specs!!!

@55bags @xeriscoin that's me accepting your presupposition with only pqc you can see how it dwindles down imagine zk proofs and real world mainnet, i don't believe in subjectivism $psoq is genuinely better accredited from infrastructure, flywheel, team etc

Lets say for arguments sake that was the case, ( stresstest says otherwise but we can say anything for arguments sake) That would still be 3000 TPS worst case scenario then. TO START WITH. Anyways, We can differ in opinion all night long, I will stick with what I think is best, and you will stick with what you think is best.

@55bags @xeriscoin lets say for sake of argument it really is 10k tps, lets just add pqc no zk proofs yet, adding only post-quantum signatures being Dilithium3 ML-DSA would likely reduce TPS by 40–70% in a real-world setting thats just quantum proofing. you realise those signatures are 50x larger

@linguinifi @xeriscoin Soqu.org/protocol Yours is also a testnet. And under stress tests Xeris performed at 11k TPS With PQC.

@55bags @xeriscoin also "Xeris performed at 11k TPS With PQC" where is proof? and still testnet btw

@55bags @xeriscoin yea currently under testnet no idea what that has to do with anything, btw Adding Dilithium makes transactions much larger 2–4 KB per sig vs 64 bytes and slower to verify. Stacking that on top of triple consensus + ZK proofs even hash-based must reduce TPS significantly,

@Crypto_peet @xeriscoin peet is a visionary he knows bs when he sees it $xeris

@xeriscoin big scam, alone how you talk is so sus

xeriscoin: it’s faster than SOL, & more decentralized than kaspa. here’s the final receipt, it’s brutal. solana mainnet real-world average right now (nov 2025) 2,400 tps kaspa mainnet real-world average right now 400 tps xeriscoin testnet 72-hour run (public logs) 9,400 tps sustained 14,200 tps peak 412 ms blocks sub-2-second fork resolution instant 66.67% stake finality that can never be rolled back we’re running and we’re 4x faster than solana’s live mainnet 24x faster than kaspa’s live mainnet while letting any gaming laptop propose blocks (more decentralized than both) and locking every slot behind >33% total supply attack cost (more secure than both) solana has leader slots and 19 validators that can pause the chain kaspa has ghostdag and 10-second probabilistic finality xeriscoin has open pow every 400 ms + instant pos finality + poh clock we beat solana at raw speed we beat kaspa at decentralization and finality we did it in the same chain triple consensus = trilemma executed windows exe drops tomorrow every gpu on earth is now a miner fastest unbreakable chain ever built change my mind. - together we are $xeris