Using the power of a distributed peer-to-peer consensus network, every transaction on the network is cryptographically secured against any adversary. Using a cryptographically sound protocol, Masari ensures that all your transactions are private by default.
By using the RingCT protocol, Masari is able to ensure that all transactions are untraceable, unlinkable, and that amounts transferred are hidden from the public.
All of the privacy features in Masari resolve into true fungibility, which makes its digital currency equivalent to cash or gold, where no transaction can be discriminated against another.
WHM Difficulty Algorithm
A necessary update implementing one of the best known algorithms in order to mitigate flash mining issues as a new altcoin, with a pull request made upstream as a contribution back to Monero.
A new and easy to use GUI wallet was intended to be available, but time constraints pushed instead for porting one over from Monero for use while this initiative is merged with the mobile wallet goal.
Multi-Sig & Subaddress Support
Both upstream features. Multi-sig will allow for trustless off-chain transactions that would otherwise require a counterparty. Subaddresses allow a single Masari private key to issue multiple subaddresses, expanding beyond payment IDs.
We've created our own CN variant in order to further secure against malicious network attacks, while being more stable and CPU friendly.
Uncle Mining (SECOR)
This feature unique to Masari delivers a more secure network, faster blocks, and rewards miners for orphaned blocks.
This is a social protocol being developed as a guideline to encourage contribution and decentralize project stewardship.
Pending further research, this investigates PoW sharding potential of the CryptoNote protocol by taking advantage of one-time public key outputs to partition/shard the transactions into a scalable blocktree.
With many preferring hardware solutions storing one's MSR, Ledger is to be supported as a storage alternative.
Pending preceding research, implementation to be complete by end of year.
Simple Private Tokens (SPT)
Without smart contracts, this features the ability to issue private digital assets in the network easily by the end user, with any computational logic using interchangeable off-chain architecture.
Without masternodes and any protocol level changes, this features the ability for a merchant to achieve high confidence that a transaction will get confirmed so that their pending orders can either be filled immediately.
I/O bound PoW
Our current CryptoNight-Fast variant (as all others) is only temporary. Inspired by Cuckoo Cycles, alternative approaches are to be looked into that are I/O bound, evening the playing field for miners from mobile devices to ASICs, allowing for an eco-friendly yet secure network.
Abstract: This paper details the cryptocurrency Masari's implementation and transition to a Weighted-Weighted Harmonic Mean difficulty adjustment algorithm in order to smoothly adjust its difficulty target so that the chain maintains a steady two-minute block time. The original idea for this algorithm comes from Tom Harold and was modified by Scott Roberts. The original C++ implementation was done by Thaer Khawaja of the Masari Core Team. This implementation has since been adopted by several other cryptocurrency projects, and has paved the way for other difficulty adjustment algorithms such as LWMA.
Abstract: Since Bitcoin's inception and introduction of cryptocurrency, alternative iterations of permissionless decentralized peer-to-peer electronic cash have been developed. However, most of these systems have the same blockchain properties that subsequently retain similar on-chain scalability limitations to Bitcoin. With the introduction of the SECOR protocol, we propose a simple version of Uncle Mining, serving the purpose of faster block emission rates while further securing the network by rewarding miners for otherwise-orphaned blocks, solving in part some of the inherent scalability limitations of blockchain technology. These added properties are achieved by introducing block weight and differentiating it from block difficulty in a hash-based proof-of-work (PoW) system that achieves consensus via the heaviest chain in the network.
One of the biggest problems to Blockchain scalability is block size, where too large a block will have propagation time and centralization concerns, while one too small will cause a network's failure to converge on a main chain. In practice, one can argue a lower bound of approximately 15 seconds, given proper management of orphaned blocks and a small upper bound on block size . Therefore, in order to increase transaction throughput while maintaining the secure concept of a Proof of Work (PoW) block in a permissionless decentralized network, one must be able to mine multiple blocks in parallel. This paper proposes Blocktree, a tree-partitioned structure that would fundamentally extend that of the Blockchain's linear nature.