Hedera is a decentralized public network where developers can build secure, fair applications with near real-time consensus. The platform is owned and governed by a council of global innovators including Avery Dennison, Boeing, Deutsche Telekom, DLA Piper, FIS (WorldPay), Google, IBM, LG Electronics, Magalu, Nomura, Swirlds, Tata Communications, University College London (UCL), Wipro, and Zain Group. The Hedera Consensus Service (HCS) acts as a trust layer for any application or permissioned network and allows for the creation of an immutable and verifiable log of messages. Application messages are submitted to the Hedera network for consensus, given a trusted timestamp, and fairly ordered. Use HCS to track assets across a supply chain, create auditable logs of events in an advertising platform, or even use it as a decentralized ordering service.
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.