Research Brief · Lead record
A June 2026 arXiv preprint describes G-Lox, a bridge-distribution system that uses two-server distributed point functions and secure two-party computation so no single server learns group identifiers or group-to-bridge assignments.
Research Brief
A new arXiv preprint describes a smart-contract prototype that answers GA4GH Beacon variant-count queries over encrypted data on a fully homomorphic Ethereum Virtual Machine, releasing results only to a named requester via an on-chain access-control list.
Claims Brief
US20260172254A1, published June 18, 2026 and assigned to PwC Product Sales LLC, claims a decentralized audit run as iterative local epochs that exchange information over a privacy-preserving framework built on a zero-knowledge proof protocol. It is a published application, not a granted patent.
Research Brief
An arXiv paper builds a competitive-equilibrium model of useful-work consensus, finds three regimes, and argues attack cost stays tied to the block reward.
Research Brief
An arXiv study reconstructs the 2023 USDC depeg from high-granularity transaction data, finding a bifurcated contagion pathway and wallet-level flight to multi-coin portfolios.
Research Brief
An arXiv paper flips crypto compliance from platform-side tracing to user-side zero-knowledge provenance, with O(1) on-chain verification at about 800k gas.
Research Brief
An arXiv paper applies a Groth16-style commit-then-prove pipeline to peer-to-peer energy trading, proving trade guidance is correct without revealing grid-sensitivity data.
Research Brief
An arXiv paper offloads Blake3 plotting to CUDA and SYCL kernels, reporting a 59.2x speedup over single-threaded CPU and beating a 384-thread CPU configuration.
Research Brief
With bridge exploits accounting for hundreds of millions in losses, an arXiv paper systematizes interoperability threats into five categories and pairs each with countermeasures.
Research Brief
An arXiv paper formalizes four fairness properties on-chain auctions need and builds a Groth16-based protocol that proves a bid in 13ms while hiding it from the proposer until reveal.
Research Brief
An arXiv paper runs the first controlled hardware comparison of NTT- and SumCheck-based proving primitives, finding the better choice depends on polynomial degree and SRAM budget.
Research Brief
An arXiv paper argues the under-studied peer-to-peer layer is where Data Availability Sampling bottlenecks, and proposes network coding to route fragments more robustly than Ethereum's current design.
Research Brief
An arXiv paper picks apart the reference Verkle implementation, proposes a hypertree decomposition, and claims a 57% heap cut and 4.85 PB/year of network-wide savings.
Research Brief
A new arXiv study reconstructs nearly two million reverted Polymarket settlements and attributes them to four attack vectors that turn matched orders into ghosts.
Research Brief
A June arXiv paper claims to push consensus inter-proposal time below a single network delay by staggering parallel atomic-broadcast instances and merging their logs deterministically.
Grant Watch
US12,211,042 is the latest in a Block lineage that picks a chain for a token at transaction time. The family — four grants, one specification — is the landscape signal, with stablecoin balances quietly threaded through.
Grant Watch
A card network keeps patenting the plumbing between a tokenized account and a controlled payment number — the unglamorous layer where stablecoin and card rails will actually meet. The assignee pattern is the signal.
Read Claim 1
US12,640,947 claims a cluster-based scoring consensus with multi-queue scheduling and cooldown periods to stop any one node dominating. The recited limitation is participation by merit, not by hashpower or stake.
Grant Watch
The third grant in a single ZKP-payments lineage shows a card network methodically fencing a smart-contract purchase flow that hides the buyer behind a proof. The estate, not the lone patent, is the story.
Read Claim 1
US11,323,243 turns endorser responses into a zero-knowledge proof that a transaction was validly endorsed, then commits the proof — not the endorsements — to the chain. The limitation is proving endorsement without revealing it.
Read Claim 1
US12,014,361 fences a flow where operator devices supply key-encryption keys on demand, the platform decrypts shares, reconstructs a signing key, validates it, then authorizes the transfer. The gate is operator participation.
Read Claim 1
US12,362,918 claims deriving child key shares from parent shares with a second random generator, preserving key-refresh while hardening derivation. The recited limitation is the offset computed with G′.
Read Claim 1
US12,615,147 covers moving encrypted private-key shares between two cloud data centers without ever reconstructing the key. The limitation that matters is who holds the export keys.
