Background & Biography
He holds a professorship in Electrical Engineering at Stanford. His university biography lists a professional office in California. This profile therefore uses the United States and North America as professional associations, without making a claim about citizenship or private residence.
In a 2022 interview, he described a career shaped by changes in the problems engineers needed to solve. His doctoral research concerned networking; he subsequently turned toward wireless communications and later studied questions arising from genome sequencing. He recalled entering blockchain research in 2018 through a group of collaborators, setting aside substantial time to learn an unfamiliar field. His explanation of teaching followed the same instinct: help students understand a unifying principle from which they can work out further results. The continuity in this account is an approach to learning and problem selection, rather than a claim that expertise in one field automatically settles another.
The company’s 2026 announcement involving Ledger supplies a more commercial setting for his work. It attributed to him an interest in allowing holders to use their coins under conditions they could verify. The announced integration focused on making transaction approvals understandable on signing devices. Connections to the companion app and additional staking support were also described as planned work. The release establishes the announcement and its stated aims; it does not independently establish subsequent delivery.
Notable Contributions
Ebb-and-Flow, coauthored with Joachim Neu and Ertem Nusret Tas, addresses a tension between keeping a ledger usable as participation changes and preserving firm confirmations when communication breaks down. The authors, who declare equal contributions, provide two related views: an available history that grows and a finalized prefix. A client can choose the assurance appropriate to its task. Their snap-and-chat construction combines a protocol that keeps moving with a separate mechanism that orders confirmed snapshots. The proofs concern a fixed, permissioned membership and specified bounds on dishonest participation. Progress of the finalized view additionally depends on communication and honest participation eventually recovering. An available history may diverge when communication splits, so choosing that view carries different consequences from waiting for finality.
DispersedLedger, another coauthored study, examines what happens when participants have different or changing bandwidth. Agreement on which blocks are available and in what order is separated from downloading all their contents. Coded fragments let data be spread across participants, while the AVID-M component checks consistency during retrieval. A linking mechanism brings correctly proposed blocks missed in one round into a later common ordering. This separation allows participants to retrieve data at their own rates. Its consortium setting assumes fixed membership, fewer than one-third faulty nodes and eventual message delivery. Consistently slow participants can still fall behind, and opening submission to untrusted clients introduces spam concerns. The reported research prototype measurements describe those experiments rather than universal operating performance.
Information Dispersal with Provable Retrievability for Rollups, coauthored with Kamilla Nazirkhanova and Joachim Neu, asks how participants can substantiate their ability to reconstruct records under explicit conditions. The construction couples data commitments with a recovery certificate assembled from participating storage servers’ acknowledgments. Coded fragments are checked for compatibility, allowing retrieval without requiring every participant to keep a complete copy. The manuscript credits his two collaborators equally without allocating personal responsibility for individual mechanisms. Its guarantees depend on fault limits and eventual delivery. Its KZG construction requires trusted setup. An optional privacy extension assumes non-colluding, honest-but-curious nodes, and the analysis leaves storage incentives outside its treatment. These boundaries matter when interpreting recoverability as an operational service.
Boomerang studies payments divided across several paths. If a transfer waits for every fragment, one slow route can delay completion and tie up liquidity. The coauthored construction adds redundancy so that enough successful fragments can complete a payment without waiting for every attempted path. Its cryptographic arrangements give the payer recourse if the recipient claims more than intended. This is a conditional design whose guarantees depend on timing rules and cryptographic assumptions. The manuscript explores an additional scripting operation and an alternative using adaptor signatures. Its evaluation used a simplified prototype with simulated communication delays. Those choices are important when assessing the gap between a research result and an operational payment network; the paper alone does not establish a live rollout.
Bitcoin Staking, written by seven coauthors, considers collateral held on one chain that backs participation in another. It combines extractable one-time signatures, a finality mechanism, locking arrangements and timestamps in both directions. The design links provable misbehavior to a consequence for bonded funds and specifies when those funds can be released. The analysis assumes the underlying chain’s integrity, cryptography, network synchrony and available watchtowers. Its committee theorem uses unanimous m-of-m signing with at least one honest participant; the measured implementation instead uses six signatures from nine members. Those are distinct assumptions. Some modeled conditions trigger a halt to protect safety, sacrificing continued operation. The May 2026 manuscript reports deployment, but its controlled resource measurements are not independent evidence of current production performance.
Why Katharos.ai Follows David Tse
Katharos.ai follows the method described in his interview: seeking coherent explanations, learning alongside collaborators and reconsidering how useful engineering questions are framed.
The bandwidth study illustrates why operational constraints deserve attention: distributing data and agreeing about it impose different demands on a network.
Areas to Follow
- How participation assumptions and recovery conditions affect the choice between an available history and finalized confirmations.
- Evidence that a retrieval service meets its fault, setup and storage assumptions beyond a narrowly specified experiment.
- Evaluations of redundant payment routing under realistic traffic, liquidity constraints and communication delays before drawing deployment conclusions.
- Documentation connecting actual committee rules, watchtower operation and withdrawal behavior to the assumptions behind remote staking research.
Reporting Scope
This profile covers documented professional roles and selected collaborative research. It distinguishes authors’ formal arguments, experimental measurements and company announcements from independently established operating outcomes. Coverage is informational and does not certify a protocol, assess an individual investment’s suitability or recommend committing funds. Future reporting should identify the version and evidence behind any changed claim.
Areas of Influence
Investment & Founders reflects his documented company-building role and participation in explaining the proposed signing experience to prospective users.
Exchanges & Infrastructure reflects the practical relevance of separating consensus traffic from bulk data movement in distributed systems.
Photo: Stanford
Katharos.ai publishes this profile for information, based on the sources listed. Inclusion is not an endorsement of the individual, their organizations, or any investment product.
Source notice: Information and images are attributed to the external sources listed. Katharos.ai does not endorse the subjects or claims described and does not independently certify the authenticity of every source statement or image.