Anoma Research

Cryptography
Demystifying Aggregatable Distributed Key Generation
A novel component of Anoma is a Distributed Key Generation (DKG) scheme. George Gkitsas describes the concepts in DKG, starting with simple constructions, building up to the aggregatable DKG.
Read more
Cryptography
Demystifying HybridDKG - A Distributed Key Generation Scheme
HybridDKG is one of the latest distributed key generation schemes and can operate in an asynchronous environment, making it the most viable DKG scheme to use over the internet.
Read more
Security
Side-channel analysis for distributed ledgers
Introducing side-channel analysis/attacks (SCA) and counter-measures and to provide directions that can help security assessments take them into consideration. Side-channels are relevant to cryptographic implementations, and as such they introduce a class of attack vectors in the blockchain context.
Read more
Cryptography
Demystifying ZEXE
ZEXE is a ledger-based system that allows for the running of multiple applications atop the same ledger in a way that transactions reveal no information about the particular computations which are performed.
Read more
Cryptography
Demystifying recursive zero-knowledge proofs
Recursive zero-knowledge proofs are new cryptographic primitives relevant to the Anoma blockchain use case. In this article, we investigate the possible alternatives for verifying blockchain circuits efficiently. Our main interest is in estimating the efficiency of pairing-based constructions.
Read more
Cryptography
Ferveo Cryptography Overview
Ferveo includes a custom-designed distributed key generator & custom-designed threshold decryption scheme intended to meet the performance & security requirements of the underlying consensus mechanism.
Read more
Distributed Systems
Heterogeneous Paxos and Multi-Chain Atomic Commits
Heterogeneous Paxos exploits the high intersection between validator sets of different blockchain to create a heterogeneous consensus protocol for atomic multi-chain transactions & extends the capabilities of IBC to allow for arbitrary communication between chains within an atomic transaction
Read more
Cryptography
Hash Functions in Plonkup
A quick overview of the proving system and show how to write a circuit that computes a small part of a common hash function that benefits greatly from the inclusion of lookups alongside arithmetic gates.
Read more
Cryptography
A Vamp-IR's Guide to Arithmetic Circuits (and Perfectly Boiled Eggs)
A primer on the concept of arithmetic circuits. We will take a look at what arithmetic circuits are, what they are used for, what tools are there for working with them, including the tools we develop here at Anoma, and what we can do with the circuits using these tools.
Read more
Applications
Anoma is putting Graphs back into Crypto
In this article, we will explain CoFi including MTCS & Circles, describe what an application on Anoma could look like, and illustrate how CoFi and Anoma form a beautiful paring.
Read more
Community
Intents Aren't Real
In this report, you will find a summary of the speaker presentations from Intents Day 0 along with some memes.
Read more
Cryptography
Zexe vs. VeriZexe vs. Taiga
The goal of this article is to understand the main architectural differences between Taiga and prior work such as Zexe and Verizexe, and the realm of posibilites, solutions and challenges that this new paradigm brings.
Read more
Distributed Systems
Typhon's Chimera Chains
Chimera Chains generalize shared sequencers. They use a consensus based on Heterogeneous Paxos to simplify cross-blockchain atomic transactions for chains with overlapping trust models.
Read more
Community
Intent-based protocols pt1: unfolding UniswapX
In part 1 of our series on intent-based protocols, we break down UniswapX.
Read more
Security
Privacy in Tents: an overview of private solving strategies
In this article, we define what private solving is, explain why we care about it, and discuss the various approaches that could be used to enhance privacy in the counterparty discovery phase
Read more
Distributed Systems
This is not the SUAVE you are looking for
In our follow-up to intent-based protocols pt.1 we examine SUAVE - a marketplace for MEV mechanisms.
Read more
Distributed Systems
A brief introduction to Anoma's P2P layer
This blog introduces Anoma's P2P overlay architecture, which aims to accommodate node heterogeneity while retaining the benefits of current overlays through the concept of sovereign domains.
Read more
Applications
Public Signal
In this article, we will introduce an application tentatively named Public Signal. The basic idea is to build an intent-centric version of Kickstarter which, in addition to being supply-side driven, can be demand-side driven.
Read more
Distributed Systems
Towards an intent-centric topology
Information flow control, "intentpools", universality, and the end of supply-side blockchain economics.
Read more
Compilers
Logic Programming with Differential Equations
We explore differential equations as a surprisingly flexible form of computation. We explore ODEs capable of encoding and solving complex logic problems, unlocking potentially efficient ways to approach tasks like graph coloring and prime factorization.
Read more
Community
The 1996 Nobel Prize, the Second Price Auction, and Elixir
Vickrey's second price auction is a splendid example of a protocol. We can look at three fundamental aspects of protocols — protocol design, protocol specification, and protocol implementation.
Read more
Community
Tracing Anoma Research Topics (ART)
ARTs serve as a constant reminder that knowledge is our most valuable resource—and sharing it is our greatest strength. By opening our research in ART reports, we commit to promoting a more resilient and transparent ecosystem around Anoma.
Read more
Distributed Systems
Abstract Intent Machines
As part of our ongoing research into intents, we've formulated what we believe to be a minimal framework for describing intent processing. In this post, we introduce the concept of an "intent machine", entities capable of processing user intents and transforming system state accordingly.
Read more
Compilers
Understanding and Arithmetizing Hylomorphism Traces
This short post is intended to summarize some work on a simple exercise that may be useful to keep in mind when arithmetizing purely functional programs.
Read more
Distributed Systems
Rise of the Resource Machines
The Anoma Resource Machine (ARM) is the part of the Anoma protocol that defines and enforces the rules for valid state updates that satisfy users' preferences. The role of the ARM in the Anoma protocol is similar to the role of the EVM in the Ethereum protocol.
Read more
Distributed Systems
Formalizing Concurrent Programs; The Generalities
In this post, I want to describe the general idea of formalizing concurrent programs, some different approaches, and some connections to more abstract mathematics.
Read more
Applications
Envisioning Multichat: Exploring chat application architectures and Anoma's potential
In this art we will explore Multichat, a distributed and encrypted chat network without any specially designated server operators.
Read more
Compilers
Arithmetizing Computable Programs Simply
We discuss different ways of encoding computable functions, describing nuances and limitations, before ending on the simplest known method using an intentionally complete operation that's simpler and easier to use than a Turing machine.
Read more
Compilers
The Unrealized Potential of String Diagrams for ZKVMs
Trees for formal syntax have myriad deficiencies which can be overcome by string diagrams. How string diagrams fix trees also makes them well suited for arithmetization into universal circuits, which can be viewed as ZKVMs for domains that go beyond mere program execution.
Read more
Cryptography
HyperNova by Hand
Building on top of the techniques explored with SuperSpartan in part 1, the aim of this article is to unbundle the folding mechanism of the HyperNova protocol by writing it by hand. There is much wisdom hidden in the details.
Read more
Cryptography
SuperSpartan by Hand
The goal of this article is to dive into the techniques behind the SuperSpartan's polynomial IOP, which uses the sum-check protocol to prove CCS instances, by writing the protocol explicitely for a specific example. This is part 1 of a two-post series. These techniques used in SuperSpartan are at the core of the HyperNova protocol that will be explored in part 2.
Read more
Distributed Systems
Intents from the resource model perspective
In this blogpost we explore what intents are and describe two concrete ways to instantiate them in the resource model.
Read more
Distributed Systems
Slow Games
This article is a summary of *Slow Games; Policy Enforcement under Uncertainty*. We explore the slow game by reviewing a conceptual framework, lossy compression model, an example game model, simulations, and future directions.
Read more
Ecosystem
Anoma in Elixir
This article explains why Anoma is built using the Elixir programming language.
Read more

More Resources