Background & Biography
Feist’s professional record is best introduced through the problems his research addresses. His current website identifies cryptography, data availability, polynomial commitments and blockchain scaling as recurring interests. It now describes his day-to-day work at Tempo in terms of consensus and payments. That current affiliation should replace an undated description of him solely as an Ethereum Foundation researcher, while preserving the historical and continuing Ethereum contributions documented in public specifications.
His own biography also identifies a research-advisory role with the Foundation’s Protocol Cluster. The role is reported as stated by Feist, rather than expanded into a management position or authority over Ethereum upgrades. The Foundation is a Swiss institution, which provides the basis for this profile’s qualified geographic association. Research collaboration across an open network does not imply that all contributors live or work in the same jurisdiction.
Feist’s published record combines formal specification work with explanatory writing. The former records decisions in enough detail for implementations to coordinate; the latter helps readers understand why particular trade-offs arise. Those outputs serve different audiences but are complementary. A proposal can be precisely defined and still be difficult for users, application builders or other researchers to evaluate without an explanation of the constraints it is meant to address.
Notable Contributions
EIP-4844 lists Feist among seven authors. It introduced a transaction format carrying blobs, with a separate mechanism for charging for the associated data. The specification separates the blob’s contents from the information directly accessible to Ethereum’s execution environment, while allowing a cryptographic commitment to be checked. This design addresses the cost of publishing data needed by rollups without treating that data as permanently retained execution calldata.
The distinction between publishing data and executing transactions is central to the contribution. Rollups need enough information to reconstruct and check their state, but requiring every base-layer participant to handle all application computation would limit the benefits of moving work elsewhere. Blob transactions provide a specialized data channel. Their usefulness still depends on implementation quality, availability guarantees and how the rollup itself handles verification and user exits.
Feist is also a co-author of EIP-7594, alongside Danny Ryan, Francesco D’Amato, Hsiao-Wei Wang and Alex Stokes. PeerDAS extends the data-availability approach so nodes can check availability while downloading only portions of the total data. The proposal describes erasure coding, data custody, gossip distribution and requests to peers. The aim is to support more data without requiring every participant to download the entire set.
PeerDAS illustrates why scaling is partly a networking problem. Cryptography can authenticate a piece of information, but nodes still have to find peers that possess it and make appropriate sampling requests. The specification’s security discussion addresses attempts to withhold data while making it appear available. Naming these conditions is more informative than describing the protocol as simply faster: its operation depends on a coordinated set of cryptographic and networking assumptions.
Feist’s 2020 introduction to KZG polynomial commitments makes one of the underlying tools more accessible. It explains how a compact commitment can bind a prover to a polynomial and support proofs about selected evaluations. The article distinguishes those properties from stronger claims about hiding information and discusses the need for a trusted setup. It credits the commitment scheme’s originators, Kate, Zaverucha and Goldberg, rather than presenting KZG as Feist’s invention.
His later article on polynomial-commitment multiproofs develops a related problem: efficiently proving multiple evaluations across commitments. It describes a construction using random evaluation and explains how it relates to Verkle-tree proofs. The article also states an important boundary, namely that the construction assumes access to the underlying polynomials and is not a general method for combining isolated proofs without their data. Such limits are part of the result, not a footnote to be removed from its description.
More recent writing broadens the focus to consensus. In December 2025, Feist published an explanation of Minimmit, a protocol he attributes to Commonware. He examines how reduced voting latency relates to a stricter assumption about the proportion of honest participants. This is analysis of another team’s protocol, not a claim that he invented it. It demonstrates continuity in his research approach: a performance improvement must be evaluated alongside the conditions needed for safety and progress.
Feist also maintains a public disclosures page covering professional advisory relationships and investment interests, with a stated December 2025 update date. The existence of that disclosure helps readers evaluate the context of his commentary. It is not an independent audit of conflicts or proof that the list remains complete. The same distinction applies to his website’s statement that commentary about Tempo is his personal perspective rather than an official product announcement.
Why Katharos.ai Follows Dankrad Feist
Katharos.ai follows Feist because his work exposes the details behind broad claims about blockchain scalability. The recurring questions are concrete: what must a participant download, what can it verify, who performs expensive computation and what happens when an adversary withholds information? These questions connect research results to the resources and assumptions faced by actual network operators.
His current work also creates an opportunity to compare design priorities across contexts. A general-purpose blockchain and a payments-focused system may assign different weights to latency, participation and operational simplicity. Coverage should examine those choices directly, avoiding the assumption that one favorable benchmark establishes overall superiority. Feist’s published explanations provide material against which subsequent specifications and implementations can be assessed.
Areas to Follow
- Changes to blob-data capacity and the operational evidence surrounding PeerDAS. - Cryptographic implementation and proof-generation costs, alongside verification costs. - Consensus research that states its fault-tolerance and networking assumptions clearly. - Public Tempo specifications and releases, distinguished from personal research commentary. - Updated professional disclosures and the precise scope of advisory responsibilities.
Reporting Scope
This profile reflects public sources checked through 9 October 2026. Current roles are based on Feist’s own professional site; co-authorship is independently visible in the Ethereum specification records. Swiss geography refers only to the Foundation affiliation. Research descriptions do not certify a deployment’s security, and a named proposal is not credited to Feist alone when its authorship is shared.
Areas of Influence
Exchanges & Infrastructure encompasses data availability, cryptographic verification and consensus mechanisms that support blockchain applications. Feist’s influence is particularly observable where research becomes an inspectable specification or a useful explanation that other engineers can challenge, implement and improve. The editorial focus remains technical contribution and explicit trade-offs rather than token performance.
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.