与「Privacy」相关的搜索结果

The latest work has been focused on what happens after a user already has exposure. Getting into a position is only one part of the experience. Managing it needs to feel just as clear. We’re refining how users can understand what they currently hold, what actions are available, and what happens when they make a change. None of this is about adding complexity for the sake of features. It’s the opposite. We want someone to open Zero Stocks, understand their position quickly, make the change they want, and move on without wondering whether they missed something. The privacy infrastructure can be complex underneath. The product itself shouldn’t feel that way.

The cryptographic world computer: My attempt to express in somewhat concise terms the true meaning of basically everything planned to happen to Ethereum starting from the fork after Hegota. It's really not just a blockchain anymore. It's a hybrid architecture that combines together blockchains and modern cryptography, to enable much more powerful properties. FOCIL, EIP-8288, Lean consensus, state management, formal verification, advanced mempool improvements (including privacy), and the longer-term specter of obfuscation all mentioned.

I've created a new Grok Bot Tutorial template for anyone new to Grok @Bot. This hands-on course includes 20 lessons. It walks you through every feature step by step, with real exercises and tips so you get the most out of Grok Bot. Download: The 20 lessons: 1) Talking to your assistant 2) Files, images, and voice 3) Research & writing 4) Connecting your apps 5) Calendar and scheduling 6) My own computer & browser 7) Working on your own computer 8) Routines 9) Staying in control 10) Privacy and security 11) Memory and preferences 12) Skills 13) Showing it how to do something 14) A team of assistants 15) Sharing and templates 16) Customizing, and fixing things 17) Using it for your job or business 18) Travel and everyday errands 19) Money and finances 20) Buying things for you

这是 Crypto 最后一轮像样的牛市 Lao Bai @Wuhuoqiu 讲很清楚了：RWA、Perp、Privacy，先看谁真的有 PMF、收入和流动性 Alpha 还在，但游戏规则已经变了

COPE’s @seanorr says City Hall must require the disclosure of “significant AI use” by those in power, and ensure AI privacy safeguards are in place: “We weren’t elected to outsource our judgement — no matter how many AI agents Ken Sim uses.”

A year ago, we soft-launched Tor VPN Beta as a way to extend Tor's privacy protections beyond the browser to an entire Android device. Since then, we've been able to learn from how people are actually using it in real-world scenarios. Learn more about what makes our per-app circuit isolation different from commercial VPNs, the surprising UX lesson when trying to bypass blocks, and the mobile foundation we're building for what's next.

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.

Confidential Intents TVL just crossed $50 million. Now $20M away from the $70M snapshot trigger for the near@3.33 campaign. $100 confidential balance on near​.com and one confidential swap is all it takes to qualify for Drop 1. The privacy renaissance runs on NEAR.

"You can set rules that apply beyond your Zone." Prividiums strike the perfect balance between mobility and privacy enabling, for the first time, Institutions to issue assets that travel with their set rules across other Zones. 🎤 @gluk64 📍 @ethconf