Last week we trespassed into the realm of RTP with 2 GPUs, this week we broke the 8 second barrier with zilkworm-airbender @eth_proofs Next-stop: Avg latency less than 10 seconds

Fil-C is a C/C compiler that builds C/C projects into a binary with "complete memory safety". It is a great project by @filpizlo. In part because it is so easy to do, I am going to make sure that all the production-quality projects I manage support Fil-C directly. For the most part, this means skipping over direct assembly calls. You can still have the assembly calls, but you need some alternatives code path when building with Fil-C. As a side benefit, running the code with Fil-C serves as a sanitizer: if there is any bad memory business going on, Fil-C will just crash you out. Interestingly, Fil-C has no escape hatch. It is a totalitarian approach.

Researchers just proved that every single elementary function, sin, exp, log, sqrt, comes from one single binary operator. It is like finding the “God Particle" for calculus. In computer science, every complex program breaks down to a single logical operator: the NAND gate. It is the fundamental building block of all digital reality. But for continuous math, physics, engineering, machine learning, we thought we needed a massive toolbox. Addition. Subtraction. Trigonometry. Logarithms. Every scientific calculator and neural network has to juggle all of them. Until today. But this paper proved that every single mathematical function can be generated by a single, bizarre binary operator. eml(x,y) = exp(x) - ln(y). Combine that with the number 1, and you can build everything. Pi. The square root. Sine and Cosine. Arithmetic. It is all just the exact same operator, repeating over and over again in a binary tree. Nobody anticipated this existed. It was found by systematic exhaustive search. But the implications for AI are massive. Instead of an AI struggling to combine different mathematical rules to discover a new scientific law, it can just use a single, uniform architecture. One trainable circuit. One repeatable node. We thought the language of the universe was complex. It turns out, it's just one equation repeating in the dark.

GPU prices aren't gonna like this. Sub-12 second #etheruem #zkevm proving achieved on just 2 5090s ethproofs.org/clusters/5a74e… As a great man once said, "basically a toaster"

In the future, EVM will spend more time computing gas than computing.

Announcing powdr-wasm! powdr-wasm is an optimized zkVM for WASM, built on top of @openvm_org and the novel 𝑐𝑟𝑢𝑠ℎ ISA. Early benchmarks already show 1.5x fewer trace cells & faster proof times compared to RISC-V (OpenVM). It also supports Go guests via WASI! 👇

TIL you can do uint512 addition with AVX512. numberworld.org/y-cruncher/i…

Solidity compilation is now 5x faster than it was in 2023. The @solidity_lang team has been grinding on backend modernization, and they're not stopping. Next on their list is killing "stack too deep" errors for good. This is the kind of work that doesn't make headlines but keeps Ethereum moving.

Great post! On the security of autoprecompiles: we're working on multiple fronts: - optimizer & equiv checker in Lean - FV proving equiv of R5 code & generated circuits - simplifying the Rust code to a minimal core In the end autoprecompiles will enable better perf & security!

The fact drives a lot of talent away. You can just do things, but it must already be on Vitalik's todo list.

Fans of the C language, embedded engineers, compiler engineers -- take a look at this RFC to bring null safety and modern type narrowing to the clang compiler! discourse.llvm.org/t/rfc-flo…

Does the Fusaka upgrade still count as 100% uptime?

What time is it forking?

We’re thrilled to welcome @rodiazet to the Solidity team! Many of you already know his work from the Ipsilon team, where he contributed important features such as EOF support in the Solidity compiler, as well as earlier contributions during the Ewasm development efforts. With a strong background in compiler design, deep knowledge of EVM internals, and his ongoing work on evmone, a fast C EVM implementation and crucial part of the Solidity testing stack, he brings invaluable expertise to the team. On top of that, as an Ethereum core dev, he’s well versed in the protocol design process, including shepherding EIPs and contributing to core decision-making. This hire helps replenish team capacity following the personal and organizational changes earlier this year. Radek will strengthen the C side of the Solidity compiler, contributing to backend and optimizer features including SSA-CFG and ethdebug. We’re excited for what we’ll build together. Welcome aboard!

Rust's biggest achievement might be annoying C programmers so much that they finally made it memory-safe.

The era of slow, bulky archive nodes is officially over. Erigon v3.3 introduces highly efficient, indexed historical MPT proofs, which slash storage costs and deliver 5x faster retrieval speeds. This upgrade unlocks massive benefits across the ecosystem, particularly by enabling trustless historical state access for L2 scaling and the ZK future. Discover why this feature is essential and the mechanism Erigon used to achieve it! erigon.tech/erigon-v3-3-intr… #ethereumnewstoday #scaling #zk @ethereumfndn

Now that Erigon v3.3 has finally been released, I am happy to announce that we fully released our data model to store historical merkle proofs. Now operators can query eth_getProof at any block efficiently (and under 20 TB)! It is a somewhat niche feature used mostly by ZK and bridges but one that completes the client nonetheless! Here is the blog post alongside a technical explainer on how it works: erigon.tech/erigon-v3-3-intr…

2 weeks of zilkworm-hypercube Averaging around 35-40 seconds of proving time (thanks @SuccinctLabs for the prover new rv64 zkvm) But we are hitting 60M gas blocks where things may start to fall apart (see @eth_proofs dashboard) Efficiency is crucial in scaling #ethereum L1

zkVM question: How do you prove a specific guest program has been executed?