QuBlock (@0xQuBlock) profile picture

A crypto miner from Vietnam

Joined August 2025
Photo by QuBlock (@0xQuBlock)Photo by QuBlock (@0xQuBlock)Photo by QuBlock (@0xQuBlock)Photo by QuBlock (@0xQuBlock)Photo by QuBlock (@0xQuBlock)Photo by QuBlock (@0xQuBlock)Photo by QuBlock (@0xQuBlock)Photo by QuBlock (@0xQuBlock)Photo by QuBlock (@0xQuBlock)Photo by QuBlock (@0xQuBlock)
QuBlock retweeted
its time to update the mainnet and release it in the form it was originally planned, the very first vision is probably the only correct one special thanks to all the validators and participants who supported the devnet and continue to do so - now it's time for the mainnet, permission less access is planned for tomorrow/the day after (the exact time is unknown, any second now) everything needed to run a mainnet node will be available in a separate release, thanks everyone – at London, England
30
29
7
142
7,617
Big news from @AnthropicAI on verifiable LLM inference, with an exciting connection to Pearl’s proof of useful work. Two orthogonal questions: • Did the model you paid for actually produce this response? • Was computational work performed? Anthropic reports that generating inference proofs currently takes ~70–95× the GPU time of ordinary inference. Pearl’s PoUW, on the contrary, adds negligible overhead. These costs buy different guarantees. Proving correct inference doesn’t automatically establish proof of work and the other way around. But the two are deeply complementary. Verifiable inference could certify which model produced an answer, while Pearl׳s PoUW only certifies that a computation has been done. As inference proofs get more practical, that combination could make AI easier to trust and more economical to provide.
11
17
9
102
11,167
Your Harness. You Define It. Meet Creator Mode in DeepSeek Harness. Turn ideas into plugins that you can use, from a design workspace to a sandbox game or a 3D LLM visualizer. What will you create?
768
2,125
960
25,396
2,568,810
Why Pearl will Win –––––––––––––––––– 01:14 BTC is dying 03:24 Breaking up with my highschool girlfriend 06:51 Why it can work 09:35 Pearl's power footprint 12:45 AI capex > asic capex 15:00 FP8 19:00 Negative overhead 22:04 Elite team 23:06 Hashrate = hinge profile height 28:01 AI lab adoption 30:48 I want my MTV 32:31 Mark Knopfler shreds on guitar 35:52 Useful work vs Duplex work 38:32 Cheap verification is required for money 41:20 Can Pearl close the loop? 45:17 Addressing fundraise FUD 51:21 Risks 1:06:27 Pearl wins by becoming multi-denominational religion
52
52
28
388
57,712
$PEARL added to Kraken roadmap
1
12
11
126
18,640
QuBlock retweeted
Decentralized on-chain AI inference at work 🧠 Check out the Keryx dashboard: keryx-labs.com/stats ✅ Almost 1,700 requests processed ✅ 99.9% answered rate ✅ 3s median time ✅ 4,700+ $KRX in inference rewards #AI #DecentralizedAI #BigData #TechNews
2
13
1
26
904
$PRL to be listed on Hyperliquid.
🆕 New HIP-3 ticker The pearl-2:native ticker has been purchased for 554.89 HYPE ($51,016) by @entropyIO
1
7
91
9,892
QuBlock retweeted
Keryx BlockDAG🟩 ⚡ 10 BPS 🧠 On-chain AI inference 🤖 5 Models ⛏️ Proof-of-Model GPU mining 🔥 100% fees burned Watch it live👉keryx-labs.com/graph
7
26
2
85
9,822
QuBlock retweeted
Most "AI crypto" runs the AI off-chain. On Keryx, your question IS a transaction. A GPU miner answers with an open model, and the reply lands on-chain. That's real on-chain AI. $KRX nonkyc.io/market/KRX_USDT
15
1
29
1,090
QuBlock retweeted
Our latest research paper explores the growing connection between AI and digital assets and explains why broad AI adoption may drive new demand, utility and applications across the digital asset economy. blackrock.com/us/individual/…
758
1,980
1,259
8,341
4,169,936
QuBlock retweeted
Four months since genesis, 10 blocks per second, and only 5.26% of the supply mined ⛓️ Five model tiers up to 48B, Proof-of-Model on every block, 1,385 inferences served so far 🧠 Inference is on-chain: the request is a transaction, the answer is a transaction, the payment is a transaction in KRX 💎 100% of fees burned: 124M KRX to date, 23.87% of what's been mined 🔥 Next stop: the network as the model 🚀
9
2
23
938
🦉 #GIVEAWAY 200,000 $WISDOM 🎁 🎲 20 random winners × 10,000 each! To enter: ① Follow @wisdomrobinhood ② Like ❤️ + Repost 🔁 ③ Tag 2 friends ④ Reply with your #RobinhoodChain address ⏰ Ends September 20 Think deeper. Move smarter. 🧠 #WISDOM #pons #CryptoGiveaway #Memecoin
🤖 Made with AI
3
1
2
21
Pearl Research Labs is officially a member of the @Nvidia Inception program! #NVIDIAInception We are building an accelerated inference platform to run the world's leading open-weight models - powered by Hopper and Blackwell GPUs. ➡️ Join the waitlist: pearlresearch.ai/waitlist?pr…
33
44
7
211
39,532
Since Bitcoin, a major open problem in distributed systems was whether proof-of-work consensus can be implemented on top of real-world computation rather than useless random hashing. This challenge of PoUW was repeatedly conjectured impossible by researchers and thought leaders. They were wrong.
19
24
2
162
22,411
The real currency is not money. It's energy and data - the two scarce resources whose fusion creates intelligence. We believe that this dramatic shift in the production of knowledge compels us to rethink the fundamental properties, purpose, and creation process of money.
21
38
9
257
58,277
The Hadamard Transform underpins many SoTA LLM quantization algorithms such as @Google's TurboQuant, QuIP#, QuaRot, SpinQuant, and NestQuant. LLM quantization works best when a vector’s coordinates have similar magnitudes. If most of a vector’s mass sits in one coordinate, e.g. x = (0,0,0,1,0,0,0,0,0,0), then the quantizer faces a bad tradeoff: use a wide range and waste resolution, or use a tighter range and “clip” the outlier, which may result in significant accuracy loss of the LLM. This is the basic motivation behind random orthogonal rotations: Multiplying x by a Gaussian rotation matrix R spreads x’s mass uniformly over coordinates, while preserving inner-products: ‖Rx‖₂ = ‖x‖₂, ⟨Rw, Rx⟩ = ⟨w, x⟩. The problem with random rotation, of course, is computational cost: a dense d × d rotation costs O(d²) per vector, so cubic time for W*X. In 2006, a beautiful and influential paper by Ailon and Chazelle, proposed a faster “pseudo-random” rotation op via the randomized Hadamard transform H′ = (1/√d)HD, where H is a Hadamard matrix and D is a diagonal random sign matrix. It turns out that H’ has essentially the same effect as a fully random rotation, in the sense that it “evenly spreads the mass” of any unit vector. This is essentially the uncertainty principle of the Fourier transform (!) The upshot is that H’x and H’w can now be computed in O(d log d) time instead of O(d²), due to the recursive (FFT) structure of H. In this blog, @prlnet's 17-year old researcher @sag0li explains how how we used Agentic toos to efficiently implement a block-Hadamard kernel in CuteDSL, which allows for very fine-grained control over memory and cache management -- this is the path to ultra-fast inference!
4
7
1
61
9,940