Anoma @anoma Today, fitcoin can reach 2000 points, and the guess BTC up/down game can exceed the limit of 50000. I bet 10000 each time, and it seems I've played 3 times. I didn't check the exact limit closely; it was either 2 or 3 times, with 60000 each time. The points are too easy to earn today. Let's try our luck...

RT @alacheng: Today I'm sharing another founder, who is also the CEO of @anoma, Adrian Brink's podcast interview. Adrian Brink joined Cosmos in 2017, becoming the third core protocol engineer of Cosmos, participating in the construction of the Cosmos tech stack, joining right at the time of Cosmos's fundraising period, ...

The Diamond level of boundless @boundless_xyz, which costs a lot of resources, has been running for a long time. If the signal proofs verified are stuck and not moving (for example, if they haven't moved for several hours), it basically indicates there is a problem. After clicking the x below to save the state, refresh. I was stuck for several hours, then clicked x, and only after refreshing did it go through.

BTC and ETH are the most decentralized, with no downtime, and the safest, no doubt about it. However, Polkadot @Polkadot does not match these two in terms of economic security scale, but its decentralization technology is definitely robust. During the previous inscription craze, the ones that held up were Polkadot and AVAX, but AVAX had high gas issues at that time. Although the adoption was not as expected, you can say its adoption is lacking, but you cannot say its technology is poor.

OpenAI released the technical report for the latest open-source gpt-oss-120b / gpt-oss-20b models. Download link for the Chinese version: Download link for the English version:

Optimum Decentralized Computing Memory Layer Its goal is to build the missing memory layer for Web3, primarily consisting of two product components: Optimum P2P and Decentralized Random Access Memory (DeRAM). It appears to be a valuable infrastructure layer project, especially Optimum P2P; the use case for DeRAM is not very clear. DeRAM implements a decentralized subscription protocol based on a pub/sub model, supporting storage, which seems similar to the web2 pub/sub protocol. Here, I will mainly introduce the Optimum P2P part. Optimum P2P Principle: Optimum P2P accelerates transmission and optimizes the propagation speed of the P2P layer through a technology called Random Linear Network Coding (RLNC), which scatters and shards data for transmission and then reconstructs it. It has two services running on the node side, working in sync with various blockchain nodes. All received blocks will be fetched by the Optimum Agent from the validators. The Optimum Agent is a software running on the validator's machine that can directly read data from the validator's Ethereum client. Block data will be passed to the Optimum Service, which is an adjacent software on the validator's machine, and then it will be broken down into small encoded shards (using RLNC) and sent to other nodes. Once a node receives enough shards, it can reconstruct the complete block, but even before the complete block is reconstructed, the node can start forwarding any received shards to the next node. This is one of the special properties of RLNC, making it very useful for fast data propagation. Besides block propagation, Optimum P2P can also be used for faster transaction relaying from RPC nodes to the memory pool, as well as faster blob propagation. Optimum is a decentralized flexnodes network that anyone can run and connect to any blockchain without permission. Main Value Points: For Validators: Accelerates data propagation, reduces operational costs, increases APY and MEV income. For L1 and L2 Blockchains: Faster block propagation, reduced bandwidth consumption, and optimized storage. For dApp Developers: Improved transaction relaying and prioritization, supporting latency, throughput, and cost-sensitive applications. For End Users: Faster transactions and more responsive interfaces, enhancing user experience. Team: Professor Muriel Médard (Co-founder) Director of the Software Science and Engineering Department at MIT, co-inventor of Random Linear Network Coding (RLNC). Dr. Kishori Konwar (Co-founder) Former Senior Engineer and Scientist at Meta, MIT postdoc, previously a quantitative developer at Goldman Sachs. Kent Lin (Co-founder) Former partner at GSR Ventures, co-founder of Plug and Play Crypto. Funding: Raised $11 million in seed funding. The seed round was led by 1kx, with participation from Robot Ventures, Finality Capital, Spartan, CMT Digital, SNZ, Triton Capital, Big Brain, CMS, Longhash, NGC, and others. Participation Method: Validator Nodes: Early members can participate via Discord:

zk project boundless @boundless_xyz new task for points, hurry up, earn points...

Nova Wallet 10.1 is now available on iOS! Nova is the wallet I currently use the most for @polkadot, and the user experience is quite good. The latest version supports multi-signature. - Multi-signature wallet has now been launched on iOS - Manage multi-signature accounts directly from your iPhone - Automatically add multi-signature wallets based on existing accounts - Create and sign multi-signature transactions.

#zkvm still has innovative products coming out Compared to general-purpose risc-b zkvm like @boundless_xyz, all proofs are based on the proofs of each circuit from a general instruction set. Brevis zkvm adopts - A glue stitching solution, which originated from a blog post by Vitalik Buterin. - Identifying those costly specific operations (usually hash values and signatures) that constitute most of the computation, and then creating dedicated modules to efficiently prove these operations. By combining the inefficient but general vm instruction set proof system with an efficient but specialized proof system, we can achieve the best of both worlds. It’s somewhat similar to the precompiled technology of the EVM, which belongs to circuit-level precompiled technology. - Innovations on the chain side 1) Pure zk proofs, where cost issues still exist. 2) Op-zk proofs, meaning zk proofs are only generated when adjustments are made, allowing the chain to verify the proof. If no adjustments are made, it confirms optimistically. This should belong to a new category of opzk. The core addresses two issues: the cost of zk proofs. It’s a quite pragmatic solution. Detailed introduction:

#zkvm still has innovative products coming out Compared to general-purpose risc-b zkvm like @boundless_xyz, all proofs are based on the proofs of each circuit from a general instruction set. Brevis zkvm adopts - A glue stitching solution, which originated from a blog post by Vitalik Buterin. - Identifying those costly specific operations (usually hash values and signatures) that constitute most of the computation, and then creating dedicated modules to efficiently prove these operations. By combining the inefficient but general vm instruction set proof system with an efficient but specialized proof system, we can achieve the best of both worlds. It’s somewhat similar to the precompiled technology of the EVM, which belongs to circuit-level precompiled technology. - Innovations on the chain side 1) Storing zk proofs, the cost issue still exists. 2) op-zk proofs, meaning zk proofs are only generated when adjustments are made, allowing the chain to verify the proof. If no adjustments are made, it confirms optimistically. This should belong to a new category of opzk. The core addresses two issues: the cost of zk proofs. It’s a quite pragmatic solution. Detailed introduction: