  In this paper, we will present a new PoW consensus algorithm used in Seele's
main-net, MPoW (Matrix-Proof-of-Work). Compared to Bitcoin's PoW consensus
algorithm, MPoW requires miners to compute the determinants of submatrices from
a matrix constructed with n hashes other than brute-force-hashing using a hash
function to find the target. This paper will evaluate this algorithm's
compatibility with difficulty adjustment. Then we will discuss its efficiency
in countering machines with hashrate advantage, and its feasibility to personal
computers. We believe more innovative consensus protocols can be developed
based on this algorithm.
