Anoma BasicsAnoma's Roadmap to MainnetAnoma's roadmap to mainnet consists of three basic phases: devnets, testnets, and mainnet. Anoma will launch first on Ethereum, followed by other chains and ecosystems.
CommunityTL;DW: Intents Discussions' Most Intents TakeawaysMissed Intents Discussions but don’t have seven hours to watch all the videos? We’ve got you covered with the best takeaways from the very intents day of panels on protocols, distributed systems, cryptography, and applications related to intents.
Anoma BasicsAn Introduction to Intents and Intent-centric ArchitecturesAll applications have one primitive in common: the intent. Decentralized intent-completion mechanisms are application-specific and no one has yet proposed one that is generalized and able of completing any intent.
NewsThe Anoma Foundation Announces the 3rd Fundraise for AnomaAnoma is the first ever intent-centric architecture, introducing a new paradigm for building infrastructure layers and a new operating system for decentralized applications. The Anoma Foundation is thrilled to announce the completion of the 3rd round for Anoma – raising a total of USD 25M.
CryptographyDemystifying Aggregatable Distributed Key GenerationA 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.
CryptographyDemystifying HybridDKG - A Distributed Key Generation SchemeHybridDKG 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.
SecuritySide-channel analysis for distributed ledgersIntroducing 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.
CryptographyDemystifying ZEXEZEXE 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.
CryptographyDemystifying recursive zero-knowledge proofsRecursive 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.
CryptographyFerveo Cryptography OverviewFerveo includes a custom-designed distributed key generator & custom-designed threshold decryption scheme intended to meet the performance & security requirements of the underlying consensus mechanism.
Distributed SystemsHeterogeneous Paxos and Multi-Chain Atomic CommitsHeterogeneous 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
CryptographyHash Functions in PlonkupA 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.
CryptographyA 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.
ApplicationsAnoma is putting Graphs back into CryptoIn 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.
CommunityIntents Aren't RealIn this report, you will find a summary of the speaker presentations from Intents Day 0 along with some memes.
CryptographyZexe vs. VeriZexe vs. TaigaThe 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.
Distributed SystemsTyphon's Chimera ChainsChimera Chains generalize shared sequencers. They use a consensus based on Heterogeneous Paxos to simplify cross-blockchain atomic transactions for chains with overlapping trust models.
CommunityIntent-based protocols pt1: unfolding UniswapXIn part 1 of our series on intent-based protocols, we break down UniswapX.
SecurityPrivacy in Tents: an overview of private solving strategiesIn 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
Distributed SystemsThis is not the SUAVE you are looking forIn our follow-up to intent-based protocols pt.1 we examine SUAVE - a marketplace for MEV mechanisms.
Distributed SystemsA brief introduction to Anoma's P2P layerThis 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.
ApplicationsPublic SignalIn 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.
Distributed SystemsTowards an intent-centric topologyInformation flow control, "intentpools", universality, and the end of supply-side blockchain economics.
CompilersLogic Programming with Differential EquationsWe 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.
CommunityThe 1996 Nobel Prize, the Second Price Auction, and ElixirVickrey'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.
CommunityTracing 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.
Distributed SystemsAbstract Intent MachinesAs 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.
CompilersUnderstanding and Arithmetizing Hylomorphism TracesThis 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.
Distributed SystemsRise of the Resource MachinesThe 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.
Distributed SystemsFormalizing Concurrent Programs; The GeneralitiesIn this post, I want to describe the general idea of formalizing concurrent programs, some different approaches, and some connections to more abstract mathematics.
ApplicationsEnvisioning Multichat: Exploring chat application architectures and Anoma's potentialIn this art we will explore Multichat, a distributed and encrypted chat network without any specially designated server operators.
CompilersArithmetizing Computable Programs SimplyWe 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.
CompilersThe Unrealized Potential of String Diagrams for ZKVMsTrees 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.
CryptographyHyperNova by HandBuilding 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.
CryptographySuperSpartan by HandThe 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.
Distributed SystemsIntents from the resource model perspectiveIn this blogpost we explore what intents are and describe two concrete ways to instantiate them in the resource model.
Distributed SystemsSlow GamesThis 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.
EcosystemAnoma in ElixirThis article explains why Anoma is built using the Elixir programming language.
