Algorand
Denominations | |
---|---|
Symbol | ALGO |
Development | |
Original author(s) | Silvio Micali |
White paper | https://arxiv.org/abs/1607.01341 https://eprint.iacr.org/2017/454 https://eprint.iacr.org/2018/377 |
Initial release | April 2019 |
Code repository | https://github.com/algorand |
Development status | Active |
Written in | Python, TypeScript (smart contract programming languages); Go (implementation language) |
Developer(s) | Algorand, Inc. |
Ledger | |
Ledger start | June 2019 |
Supply limit | 10,000,000,000 ALGO[1] |
Website | |
Website | algorand |
Algorand is a proof-of-stake blockchain and cryptocurrency.[2] Algorand's native cryptocurrency is called ALGO.
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.
Algorand may also refer to the private corporation based in Boston,[7][8] as well as to the nonprofit Algorand Foundation Ltd., incorporated in Singapore.[9][10][11]
History
[edit]Algorand was founded in 2017 by Silvio Micali, a computer scientist and professor at the Massachusetts Institute of Technology (MIT).[12][13]
Algorand's test network was launched to the public in April 2019.[14]
Following successful testing and refinements, the main Algorand network was officially launched in June 2019.[15]
Governance
[edit]Algorand Foundation Ltd. manages award funding, cryptographic research, on-chain governance, and decentralization of the Algorand network including nodes. The Algorand protocol specifications are maintained by the Algorand Foundation.[16] The development of the Algorand protocol reference implementation is overseen by Algorand Technologies.[7] The foundation is led by CEO Staci Warden.[17] The foundation also conducts developer programmes, accelerators and other activities in Africa[18] and India.[19]
Algorand Foundation Ltd. issues quarterly votes for the stakes of ALGO to vote on.[20] These proposals include implementation of DeFi.[21][22][23][24]
Design
[edit]Algorand can only be forked intentionally through soft forks and source code forks.[25][26]
Consensus algorithm
[edit]Algorand uses a Byzantine agreement protocol that leverages proof of stake,[27][28][29] which contributes to its energy efficiency.[30][31] It is a competitor to blockchains such as Ethereum.[32] Researchers have found its protocol to be highly secure.[33]
Cryptographic sortition
[edit]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.[34] 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).[25][35][36]
Verifiable random function
[edit]The cryptographic sortition implementation relies on the verifiable random function (VRF) cryptographic primitive. The VRF consists of two algorithms: generation and verification. When each user participating in the Algorand consensus protocol runs the VRF, the VRF acts on a safe public seed[37] (Q, system wide parameter, published in past blocks) to generate a uniform pseudo-random number (h), along with a proof (𝜋), using a user's secret key (of a public / secret key pair, Pk / Sk). The result can then be easily and publicly verified (as true or false) using the public seed (Q), the result (h), the proof (𝜋) and the user public key (Pk).
The consensus protocol requires users to generate the VRF key pairs before the safe public seed Q has been agreed, ensuring that the cryptographic sortition is robust with respect to brute force attacks (both on the safe public seed Q and users' secret keys Sk). The cryptographic sortition is also robust with respect to Sybil attacks (splitting users' ALGO tokens in multiple fake users gives no advantage in the sortition).
Consensus steps
[edit]Consensus on Algorand requires three steps to propose, confirm, and write the block to the blockchain.[38] The 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.[39]
Block proposal
[edit]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.[35][36][39]
Proposals filtering
[edit]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.[39]
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.[35][36][39]
Certify block (commit)
[edit]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).[39]
If the certify committee achieves consensus on a new block, then the new block is disseminated across the network and appended to the ledger.[25][40][41]
Within the Algorand consensus protocol, membership in all the committees changes every time a new step is run. This protects users against targeted attacks, as an attacker will not know in advance which users are going to be on a committee.[19] According to an external security audit, the model also accounts for timing issues and adversary actions, e.g., when the adversary has control over message delivery.[42][39]
Recovery
[edit]The Algorand consensus protocol privileges consistency over availability (CAP theorem).[43] 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 recovery mode of the protocol ensures that the block production resumes immediately, with no need of reconciliations or reorganization, as soon as a Byzantine Agreement is reached again.[39]
Network
[edit]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).[44]
Other features
[edit]In 2024, Algorand Foundation launched an open-source standard for more secure communications between wallets.[45]
Algorand uses the post-quantum signature scheme Falcon (signature scheme).[46]
ALGO
[edit]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]
Adoption
[edit]Since 2019, Algorand has been a partner of World Chess.[47]
In 2021, Italia Olivicola, Italy's largest olive and olive oil producers' organization, partnered with Euranet to implement blockchain technology based on Algorand.[48] SIAE, the Italian Society of Authors and Publishers, also announced a project on copyright management using Algorand in the same year.[49]
In 2022, Algorand's blockchain was used by Robert Irwin and the Australia Zoo for a series of NFTs.[50][51]
In 2023, Italy's 'Fideiussioni Digitali' initiative to reduce fraud in bank and insurance guarantees, selected Algorand as its blockchain.[52]
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.[53]
The Algorand blockchain had its first tokenized money market fund launch in June 2024.[54]
References
[edit]- ^ a b Daly, Lyle (2022-05-16). "What is Algorand (ALGO)?". The Motley Fool. Retrieved 2024-10-20.
- ^ Gilad, Yossi; Hemo, Rotem; Micali, Silvio; Vlachos, Georgios; Zeldovich, Nickolai. "Algorand: Scaling Byzantine Agreements for Cryptocurrencies". SOSP '17: Proceedings of the 26th Symposium on Operating Systems Principles. Retrieved 2024-10-26.
- ^ "SEC complaint against Bittrex" (PDF). SEC.gov. Retrieved 2024-10-26.
- ^ "SEC complaint against Binance" (PDF). SEC.gov. Retrieved 2024-10-26.
- ^ "SEC complaint against Kraken" (PDF). SEC.gov. Retrieved 2024-10-26.
- ^ "SEC complaint against Cumberland" (PDF). SEC.gov. Retrieved 2024-10-26.
- ^ a b "Algorand LLC". Bloomberg.com. Retrieved 2024-10-20.
- ^ "Algorand, Inc". opencorporates.com. Retrieved 2023-05-29.
- ^ "Algorand Foundation Ltd". Bloomberg.com. Retrieved 2024-10-20.
- ^ "Personal Data and Privacy Policies". algorand.com. Retrieved 2023-05-29.
- ^ "Algorand Foundation Ltd. : OpenCorporates". opencorporates.com. Retrieved 2023-05-29.
- ^ Zhao, Helen (2018-02-23). "Bitcoin and blockchain consume an exorbitant amount of energy. These engineers are trying to change that". CNBC. Retrieved 2021-04-03.
- ^ "MIT professor debuts high-speed blockchain payments platform Algorand". VentureBeat. 2018-02-15. Retrieved 2021-04-03.
- ^ "Algo VC Fund Raises $200M to Fast-Track Its Own Cryptocurrency". www.bizjournals.com. Retrieved 2021-04-03.
- ^ "Bahrain's Shariah Review Bureau Certifies Blockchain Firm Algorand As Shariah Compliant". Crowdfund Insider. 2019-10-23. Retrieved 2021-04-03.
- ^ "Algorand Foundation announces global winners for its $50M blockchain research and education programme". www.algorand.foundation. Retrieved 2022-09-28.
- ^ "Our Team". www.algorand.foundation. Retrieved 2023-05-29.
- ^ Abiodun, Alao (2024-08-30). "Taraba, Algorand empower youths with blockchain skills". The Nation Newspaper. Retrieved 2024-10-20.
- ^ a b Bhardwaj, Shashank (2024-02-20). "AlgoBharat And Telangana's T-Hub Introduce A Startup Lab Program For Web3 Startups". Forbes India. Retrieved 2024-10-20.
- ^ "Governance". www.algorand.foundation. Retrieved 2022-10-02.
- ^ "Community governance period4 voting measures". www.algorand.foundation. Retrieved 2022-10-02.
- ^ Morini, Massimo (2022-07-15). "Algorand Community Governance: Period 2 Review". Algorand Foundation. Retrieved 2022-10-02.
- ^ Morini, Massimo (2022-07-15). "Algorand Community Governance: Period 3 Review". Algorand Foundation. Retrieved 2022-10-02.
- ^ "Community governance period3 voting measure 1 DeFi Participants". www.algorand.foundation. Retrieved 2022-10-02.
- ^ a b c Lepore, Cristian; Ceria, Michela; Visconti, Andrea; Rao, Udai Pratap; Shah, Kaushal Arvindbhai; Zanolini, Luca (14 October 2020). "A Survey on Blockchain Consensus with a Performance Comparison of PoW, PoS and Pure PoS". Mathematics. 8 (10): 1782. doi:10.3390/math8101782. hdl:2434/773710.
- ^ 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. ISBN 978-3-030-97950-8.
- ^ Bartoletti, Massimo (2020). "A formal model of Algorand smart contracts" (PDF). Financial Cryptography and Data Security 2021. arXiv:2009.12140.
- ^ Xiao, Y.; Zhang, N.; Lou, W.; Hou, Y. T. (28 January 2020). "A Survey of Distributed Consensus Protocols for Blockchain Networks". IEEE Communications Surveys and Tutorials. 22 (2): 1432–1465. arXiv:1904.04098. doi:10.1109/COMST.2020.2969706. ISSN 1553-877X. S2CID 102352657.
- ^ Wan, Shaohua; Li, Meijun; Liu, Gaoyang; Wang, Chen (2020-11-01). "Recent advances in consensus protocols for blockchain: a survey". Wireless Networks. 26 (8): 5579–5593. doi:10.1007/s11276-019-02195-0. ISSN 1572-8196. S2CID 213063001.
- ^ Zhao, Helen (2018-02-23). "Bitcoin and blockchain consume an exorbitant amount of energy. These engineers are trying to change that". CNBC. Retrieved 2024-10-20.
- ^ Alzoubi, Yehia Ibrahim; Mishra, Alok (2023). "Green blockchain – A move towards sustainability". Journal of Cleaner Production. 430: 139541. Bibcode:2023JCPro.43039541A. doi:10.1016/j.jclepro.2023.139541. hdl:11250/3102853.
- ^ Sigalos, MacKenzie (2021-10-02). "Ethereum had a rough September. Here's why and how it's being fixed". CNBC. Retrieved 2024-10-20.
- ^ 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. ISBN 979-8-4007-0050-7.
- ^ Gilad, Yossi; Hemo, Rotem; Micali, Silvio; Vlachos, Georgios; Zeldovich, Nickolai (2017). "Algorand: Scaling Byzantine Agreements for Cryptocurrencies". Cryptology ePrint Archive. Retrieved 2024-10-21.
- ^ a b c Xiao, Y.; Zhang, N.; Lou, W.; Hou, Y. T. (28 January 2020). "A Survey of Distributed Consensus Protocols for Blockchain Networks". IEEE Communications Surveys and Tutorials. 22 (2): 1432–1465. arXiv:1904.04098. doi:10.1109/COMST.2020.2969706. ISSN 1553-877X. S2CID 102352657.
- ^ a b c Wan, Shaohua; Li, Meijun; Liu, Gaoyang; Wang, Chen (2020-11-01). "Recent advances in consensus protocols for blockchain: a survey". Wireless Networks. 26 (8): 5579–5593. doi:10.1007/s11276-019-02195-0. ISSN 1572-8196. S2CID 213063001.
- ^ "specs/dev/abft.md at master · algorandfoundation/specs". GitHub. 2019-05-28. Retrieved 2024-10-20.
- ^ "Algorand consensus". Algorand Developer Portal.
- ^ a b c d e f g Chen, Jing; Gorbunov, Sergey; Micali, Silvio; Vlachos, Georgios (2018). "Algorand Agreement: Super Fast and Partition Resilient Byzantine Agreement". Cryptology ePrint Archive. Retrieved 2024-10-21.
- ^ Xiao, Y.; Zhang, N.; Lou, W.; Hou, Y. T. (28 January 2020). "A Survey of Distributed Consensus Protocols for Blockchain Networks". IEEE Communications Surveys and Tutorials. 22 (2): 1432–1465. arXiv:1904.04098. doi:10.1109/COMST.2020.2969706. ISSN 1553-877X. S2CID 102352657.
- ^ Wan, Shaohua; Li, Meijun; Liu, Gaoyang; Wang, Chen (2020-11-01). "Recent advances in consensus protocols for blockchain: a survey". Wireless Networks. 26 (8): 5579–5593. doi:10.1007/s11276-019-02195-0. ISSN 1572-8196. S2CID 213063001.
- ^ Alturki, Musab A.; Chen, Jing; Luchangco, Victor; Moore, Brandon; Palmskog, Karl; Peña, Lucas; Roşu, Grigore (2020). "Towards a Verified Model of the Algorand Consensus Protocol in Coq". Formal Methods. FM 2019 International Workshops. Lecture Notes in Computer Science. Vol. 12232. pp. 362–367. arXiv:1907.05523. doi:10.1007/978-3-030-54994-7_27. ISBN 978-3-030-54993-0. S2CID 196471153.
- ^ Lewis-Pye, Andrew; Roughgarden, Tim (2020-06-18). "Resource Pools and the CAP Theorem". arXiv:2006.10698 [cs.DC].
- ^ Lepore, Cristian; Ceria, Michela; Visconti, Andrea; Rao, Udai Pratap; Shah, Kaushal Arvindbhai; Zanolini, Luca (2020-10-14). "A Survey on Blockchain Consensus with a Performance Comparison of PoW, PoS and Pure PoS". Mathematics. 8 (10). MDPI AG: 1782. doi:10.3390/math8101782. hdl:2434/773710. ISSN 2227-7390.
- ^ "Algorand Debuts LiquidAuth for More Secure Crypto Communications". PYMNTS.com. 2024-06-26. Retrieved 2024-10-20.
- ^ "Algorand: Pioneering Falcon Post-Quantum Technology on Blockchain". 2022-08-17. Retrieved 2024-11-27.
- ^ "World Chess announces plans for 'hybrid IPO'". Financial Times. Retrieved 2024-10-20.
- ^ "Una blockchain avanzata per il settore olivicolo-oleario di ItaliaOlivicola". TeatroNaturale.It (in Italian). Retrieved 2024-10-20.
- ^ Monaco, Daniele (2021-03-25). "Anche Siae sperimenta gli Nft". Wired Italia (in Italian). Retrieved 2024-10-20.
- ^ "Robert Irwin announces Australia Zoo's first ever collectible NFT series". 7NEWS. 2022-06-12. Retrieved 2024-10-20.
- ^ Venz, Sophie (2022-08-16). "Australia Zoo uses carbon-negative blockchain technology to release NFT collection". SmartCompany. Retrieved 2024-10-20.
- ^ Hall, Ian (2023-01-04). "Public blockchain confirmed for Italian bank guarantees project". Fintech news for government and public sector professionals. Retrieved 2024-10-20.
- ^ "AlgoBharat & SEWA Partner to Launch Digital Health Passport for Informal Sector Women". CNBC-TV18. 2024-03-06. Retrieved 2024-10-20.
- ^ "First tokenised money market fund launched on Algorand". ThePaypers. 2024-06-27. Retrieved 2024-10-20.