Download here : https://drive.google.com/open?id=1BrRWA1VX0hPepUGcuVSYsd6LDTTyhmI9
Source : https://pdfs.semanticscholar.org/3f64/123ce97a0079f8bea66d3f760dbb3e6b40d5.pdf
Abstract
Source : https://pdfs.semanticscholar.org/3f64/123ce97a0079f8bea66d3f760dbb3e6b40d5.pdf
Abstract
Almost all P2P crypto-currencies prevent double spending and similar such attacks with a bulky “blockchain” scheme, and the ones which do not typically use some sort of pseudo-centralized solution to manage the transactions. Here I propose a purely P2P crypto-currency scheme with a finite blockchain, dubbed the “mini-blockchain”. Each time a new block is solved the oldest block is trimmed from the end of the mini- blockchain so that it always has the same number of blocks. It is argued that the loss of security this trimming process incurs can be solved with a small “proof chain” and the loss of coin ownership data is solved with a database which holds the balance of all non-empty addresses, dubbed the “account tree”. The proof chain secures the mini- blockchain and the mini-blockchain secures the account tree. This paper will describe the way in which these three mechanisms can work together to form a system which provides a high level of integrity and security, yet is much slimmer than all other purely P2P currencies. It also offers other potential benefits such as faster transactions and lower fees, quicker network synchronization, support for high levels of traffic, more block space for custom messages, and increased anonymity.
J.D. Bruce
May 2013. Rev 1.
www.bitfreak.info
