The SEC has filed several lawsuits[3][4][5][6] alleging ALGO is a security which is subject to regulation under U.S. securities laws, along with a few other crypto assets.
The Algorand Foundation funded an article which claims Algorand's overall protocol frame-work is sound under certain conditions.[22]
Cryptographic sortition
The core principle of Algorand consensus is the cryptographic "self" sortition. The sortition procedure runs locally and privately, on each node of the network participating in the consensus protocol, without a centralized coordination.[2] The goal of the sortition algorithm is randomly selecting a subset of users participating in the consensus protocol (committees) ensuring two properties: the sortition's result can be easily verified once it is published, while it can not be determined ahead of time by malicious adversaries. The number of selected users in the sortition (committee size) is defined as a statistical expectation on the outcome of a pseudo-random process. The likelihood that a given user will be selected (in the committee) is influenced by the number of ALGO tokens held by that user (the stake).[15][18][19]
Consensus steps
Algorand's consensus steps are: block proposal, proposals filtering (soft vote) and committing the block (certify vote). Each step relies on an independent run of the cryptographic "self" sortition, to elect a voting committee with different sizes (statistical expectations on the sortition outcome) and voting thresholds.[23]
Block proposal
In the first step the cryptographic sortition selects a subset of users (proposal committee) which assemble and propose a block for the next round of the protocol. At the end of the step there will be a few block proposals (the protocol is tuned with a statistical expectation of 20 proposals) with different random priorities. After determining if a user is on the proposal committee, that user can build a proposed block and gossip it to the network for review/analysis during the second phase. The user includes the result of the VRF (h) and cryptographic proof (๐) in their block proposal to demonstrate committee membership.[18][19][23]
Proposals filtering
In the second step the nodes in the networks wait for an adaptive period of time (๐), measured by nodes' local clocks, to be sure that the block proposals gossiped in the previous steps have been observed.[23]
A new cryptographic sortition selects a subset of users (soft vote committee) to vote and reach a Byzantine Agreement (called "BA*") on the proposal with highest priority. When users have determined that they are in this second-phase voting committee, they analyze the block proposals they have received (including verification of first-phase committee membership) and vote on the highest priority one.[18][19][23]
Certify block (commit)
Once a threshold of votes is reached in the previous proposals filtering step, the third and last step of the protocol begins. A new cryptographic sortition selects a subset of users (certify committee) to vote and reach a Byzantine Agreement on the content of the proposed block with respect to the state of the ledger (e.g. the block does not contain double spending, overspending or any other invalid state transition between accounts).[23]
If the certify committee achieves consensus on a new block, then the new block is disseminated across the network and appended to the ledger.[15][18][19]
Algorand funded a security audit[24] which claims their model also accounts for timing issues and adversary actions, e.g., when the adversary has control over message delivery.[25]
Recovery
The Algorand consensus protocol privileges consistency over availability (CAP theorem).[26] If the network is unable to reach consensus over the next step (or block), within a certain time, the protocol enters in a recovery mode, suspending the block production to prevent forks (contrary to what would happen in blockchains based on the "longest-chain principle", such as Bitcoin). The Algorand team claims the recovery mode of the protocol ensures that the block production resumes eventually, with no need of reconciliations or reorganization, if a Byzantine Agreement is reached again.[23]
Network
An Algorand network is a distributed system of nodes, each maintaining a local state based on validating the blockchain and the transactions therein. Nodes are spread geographically, communicating with each other over the Internet. The integrity and the consistency of the global network state and distributed ledger is maintained by the consensus protocol. Algorand nodes communicate through message gossiping (broadcasting) either in peer-to-peer or via relay nodes (which facilitate efficient broadcasting with minimal message hops and low latency).[15]
ALGO
The unit of account of the Algorand protocol is the ALGO. The protocol's supply of ALGO is limited to 10 billion units. One ALGO is divisible to six decimal places, the smallest unit is called microALGO (๐ALGO), equal to 1/1,000,000 (one millionth) ALGO.[1]
In 2021, Italia Olivicola, Italy's largest olive and olive oil producers' organization, partnered with Euranet to implement blockchain technology based on Algorand.[28]SIAE, the Italian Society of Authors and Publishers, also announced a project on copyright management using Algorand in the same year.[29]
In 2023, Italy's 'Fideiussioni Digitali' initiative to reduce fraud in bank and insurance guarantees, selected Algorand as its blockchain.[32]
In 2024, CNBC-TV18 reported that Algorand's blockchain was being tested for use in a digital identification to help women in India access public health programs.[33]
The Algorand blockchain had its first tokenized money market fund launch in June 2024.[34]
^Arslanian, Henri (2022). "The Emergence of New Blockchains and Crypto-Assets". The Book of Crypto. Cham: Springer International Publishing. pp. 99โ119. doi:10.1007/978-3-030-97951-5_4. ISBN978-3-030-97950-8.
^Blum, Erica; Leung, Derek; Loss, Julian; Katz, Jonathan; Rabin, Tal (2023-11-15). "Analyzing the Real-World Security of the Algorand Blockchain". Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security. ACM. pp. 830โ844. doi:10.1145/3576915.3623167. hdl:1721.1/153140. ISBN979-8-4007-0050-7.