æternity is a public, open-source blockchain protocol that enables a platform for next-generation decentralized applications with high scalability. Its core components are written in the functional programming language Erlang and its smart contract language - Sophia - is also functional. æternity has a stellar team of developers including Robert Virding - co-creator of Erlang, John Hughes - co-designer of Haskell, and Ulf Norell - co-designer of the Agda programming language for formal verification. Unlike other blockchain platforms, the æternity protocol itself incorporates a number of essential technological features. State channels for off-chain scaling, oracles for real-world information, and a naming system for increased user-friendliness are all implemented on Layer 1. æternity also features SDKs in Javascript, GO, Phyton, Java, as well as a middleware and a development suite that streamline smart contract development. æternity incorporates the Bitcoin-NG consensus algorithm developed by academics from Cornell University and uses the Cuckoo Cycle mining algorithm for Sybil attack protection. AE tokens, the native cryptocurrency of the æternity platform, is used for both - an economic unit of account and as ballots in the community-driven on-chain governance votes.
Beam Mimblewimble is a scalable, fungible, and confidential cryptocurrency based on the Mimblewimble implementation. WHY BEAM? Core features include complete control over your privacy, All transactions are private by default, No addresses or other private information are stored on the blockchain, Superior scalability due to compact blockchain size, Opt-in Auditability, Support online and offline transactions, atomic swap, hardware wallets integration. Governance model No premine, No ICO. Backed by Treasury Establishing a non-profit foundation to govern the protocol after Mainnet launch How does it work? Wallets’ owners create new transaction using secure channel either online or offline Both wallets participate in signing the transaction using Schnorr protocol Wallet sends transaction to node Each transaction contains a list of Inputs and Outputs represented by Pedersen Commitments, as well as explicit fees and kernels. Each transaction also contains non-interactive zero knowledge range proof to verify that the output transaction value is positive Transaction is verified by the node Each transaction is verified with respect to the recent blockchain state which is stored as a Merkle Tree. The root hash of the tree is recorded in block header along with a proof of work. In addition, each node periodically creates compacted history to allow ‘fast sync’ of new and existing nodes. Transaction is added to the mining pool A block is mined every minute and is sent back to the node for verification and distribution. Mined blocks containing the new transactions are sent to the known peers A valid block that is extending the longest chain is accepted as a new Tip and propagated further until full consensus is reached. Fast sync When a new node connects to the network for the first time it can request compacted history containing only system state and blockchain headers. There is no need to retrieve the entire transaction history.