与「ing」相关的搜索结果

A note on recursive STARK mempools (EIP-8288) This is an EIP that I am hoping we can get included in I-star (the fork after Hegota) that you can think of as the next step after Frames, that would unlock extreme amounts of power. Particularly: * Ultra-cheap quantum-safe signatures (SPHINCS-). Much of the cost savings comes from the fact that the signature data (~3 kB) does not have to go onchain * Ultra-cheap quantum-safe privacy protocols. Status quo minimum cost for private txs is ~300k if you engineer very well (no one does), status quo quantum-safe is ~10M gas, this could reduce it to low tens of thousands. * Universal support for your favorite new signature or proof scheme without needing EVM changes. Whatever you use (Falcon, ML-DSA, some other lattice-based thing, something code-based or isogeny-based or even more esoteric), you can just wrap it client-side in a STARK, onchain gas cost low tens of thousands just like privacy protocols. Hopefully, Ethereum will never need "please support my favorite cryptographic algo" politics again. * Private account abstraction: keep your account logic private, and in a private location onchain. Then you can make one transaction to change the ownership of all your onchain state - accounts, defi positions, privacy protocol notes, everything - without revealing which objects' ownership you're changing. Here's how it works. Your transaction can include a type of frame that we call a "dependency frame". The frame is a list of statements, asserting claims like "message hash M was signed by SPHINCS- public key P" and "data hash D was proven to satisfy a statement defined by verification key V". When you send your transaction, you send it in an envelope, which includes a signature or a STARK for each statement in a dependency frame. Once the transaction reaches the mempool, nodes aggregate them. Each node runs a loop: wait one tick (eg. 500ms), aggregate all new envelopes (either single-tx or multi-tx) that you've seen, remove any transactions that are expired, generate a STARK recursively proving all dependencies, and send a new multi-tx envelope containing that STARK. Hence, the bandwidth load is bounded: each node's outbound is one STARK (~100-300 kB) per tick, plus each transaction getting broadcasted through the network once (as happens already). The block builder acts as "yet another mempool node", receiving envelopes from the mempool (plus any side channels), generates its own STARK covering the subset of transactions it intends to include in the block, and adds that STARK to the block. Total onchain overhead: one STARK (100-300 kB), plus 96 bytes for each statement being proven. This is what I've called before ( ) "The Proof Singularity". Today, we have all the ingredients to actually implement it. As a developer, this requires a somewhat different workflow than you are used to, but it is conceptually simple. Any signatures or STARKs, you put into a separate frame. Then the main logic that today is verifying a signature or STARK, you replace with checking for the existence of a frame that includes the correct statement as a dependency. Examples of useful statements: * [tx sighash] verifies against [the pubkey at sload(0)] * there exists a secret and a merkle branch such that hashing secret+0 and applying the merkle branch outputs (public) root R, and hashing secret+1 outputs (public) nullifier N * there exists a secret address A, salt S and signature Z such that sload(0) = hash(A, S) and a merkle proof of address A inside a recent ethereum state contains some pubkey D where [tx sighash] was signed by D [this is private account abstraction; all variables except [tx sighash] and sload(0) are private; you can also make D a STARK verification key] * there exists an ML-DSA signature signing [tx sighash], that verifies against an ML-DSA pubkey whose hash is sload(0) At the core, this is moving any compute and data other than bookkeeping "business logic" outside the core path of Ethereum execution, sharding and parallelizing it via the mempool. Notice also that this requires agreeing on a _language_ (aka. an ISA) for the recursive STARKs to define statements in. The current leading candidate is RISC-V. So this would also de-facto be Ethereum adding RISC-V (or something else we decide on) as a canonical ISA - a big decision that should be done carefully, but that I think will be necessary to drive Ethereum forward.

Follow my incredible press team who fight so hard for President Trump. I couldn’t have done this job without them! 🇺🇸 @PatAdams96 @AnnaKellyGOP @KushDesai47 @MicahStopperich @LizHuston33 @TaylorRogers37 @Davis_Ingle @AllisonSchuste @Olivia_Wales @KieghanNangle @LaurenKBis

Recipe links are easy to find, but ingredients are often buried. A report says this is common and points to cleaner, table-style layouts. For your food posts, put ingredients and steps front; for examples, open this post.

Los videos del desastre en Nepal son impactantes, cada uno es más impresionante que el otro. Este en particular, la resistencia del puente es notoria. Los ingenieros/técnicos que lo hicieron deben sentirse orgullosos. Probablemente salvo vidas al momento de la tragedia.

Hernes, hermana de Cilia Flores, es madre de Efraín Antonio, conocido como uno de los narcosobrinos, y de Marcos Antonio, abogado y excandidato a alcalde de San Diego. ¿Qué papel juega este último en un juicio contra un ingeniero de Carabobo? 📍

NVIDIA Vera Rubin NVL72 production racks are here. The compute tray is engineered for fast compute, assembly, and serviceability. Manufacturing is 100% automated, and every tray goes together in one minute. Congratulations to @Microsoft on the first operational Vera Rubin NVL72 racks, now rolling off @HonHai_Foxconn Ingrasys lines.

Imagine being 10 years old and seeing a Starship just off your island. That happened to Ellyse Ingwersen on Australia’s Christmas Island: “It was a really cool spaceship, I think it’s like a once in a life opportunity.” ❤️🚀

J Cole shouts out the Timberwolves at his concert in Minnesota: “Y’all got my favorite n**** Ant-Man in this motherf***er… and to make even more unfair, y’all got my other favorite n**** LaMelo Ball in this mother… oh my god. Y’all gone be a f***ing problem.” (via @TargetCenterMN)

🚨¡BOMBAZO! El ingeniero que creó Claude Code desde cero acaba de soltar un video de 28 minutos que es puro oro: cómo escribir prompts que realmente entregan resultados brutales. He visto cursos de 300 dólares que no llegan ni a la suela de lo que él explica en los primeros 10 minutos. Archivos CLAUDE.md, atajos de memoria, sesiones paralelas y patrones de prompting que casi nadie usa… Todo en un solo video. Completamente gratis. Sin relleno. Da igual si eres desarrollador, estás empezando o ya llevas meses con Claude: esto te cambia el juego desde hoy. Guárdalo. Míralo. Compártelo.