Preloader image

Masari Research Corner

The Masari Research Corner researches innovation in privacy and cryptocurrency technology within the context of advancing Masari's protocol

WWHM Difficulty Adjustment Algorithm

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.

Simple Extended Consensus Resolution: Uncle Mining On The Blockchain

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.

CryptoNote Blocktree: Partially Asynchronous Metablock Consensus

Abstract: 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 [1]. 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.