Anoma is a cybernetic consensus system for causal accounting. Using Anoma, agents can create, merge, and verify cryptographically content-addressed histories in a manner which enforces arbitrary logical relations, including directed and undirected identity relationships and a distributed linear resource logic. These logics are used as the substrate for a cryptographic accounting system which provides a quantifiable view of entanglement, a pairwise measure of the degree of a particular kind of relationship between two identities. Different measures of entanglement can be fed back into the system to inform local choices which require trust, such as delegation of data storage and consensus provisioning, allowing for automatic reduction of computational resource expenditure in high-entanglement interactions. These measures can also be input into and output from the system in order to track relations of interdependence in the external world.
Consensus over history in conjunction with user data input allows for the provisioning of causal accounting, in that the system can combine local information about local causal dependence and local agent preferences into a gestalt system model of causal and preference relations, and provide pairwise and relative measures of preference satisfaction as outputs which can be used for resource provisioning decisions in the future.
Anoma's architecture is scale-free, in that the system's fundamental unit of cryptographic identity is closed under composition, so the system can model relational topologies spanning arbitrary levels of individuality. Under the assumption of an inverse-power law with regards to economic distance, the network of real relations viewed from outside will take the form of a fractal, i.e. recurrence of form independent of scale.
Anoma provides computational integrity (correctness) and informational locality (privacy) on the basis of cryptographic assumptions. The protocol architecture abstracts cryptographic primitives by their information-theoretic properties, so implementations of particular primitives can be chosen and updated for availability, maturity, and performance over time.
These documents describe the architecture of the Anoma protocol. They are intended to be complete, in that enough is said to define precisely what a valid implementation of Anoma must do, and minimal, in that no more is said than that.
Anoma is free, in both the senses of "free speech" and "free beer". The source for these documents is on Github, permissively licensed, and they can be forked or edited as you like. At present, this particular repository is stewarded by the Anoma Foundation. Contributions are welcome.
NOTE: These documents are not yet complete. If you're reading this page right now, there's a high chance you might be interested in Namada.