Author

Topic: Blockvault: Protocol for a Digital Library of Alexandria (Read 49 times)

sr. member
Activity: 1036
Merit: 350
nice well thought out writeup looks interesting just wondering though. no one can really guarantee data permanence. the best you can hope is the coin appreciates in value so that miners would want to participate but if the coin has a very low value it would make miners more hesitant to want to store all that data. which puts the data permanance part in jeopardy?
member
Activity: 322
Merit: 54
Consensus is Constitution
This is not a functioning coin, I am basically proposing it here looking for input.  Also I proposed the transaction fee alternative idea to the bitcoin technical discussion https://bitcointalk.org/index.php?topic=5377322.new#new

Here is an archive of a wiki page I wrote on it:

https://web.archive.org/web/20211217023208/https://www.naturevault.org/wiki/pmwiki.php/CryptoProjects/Blockvault

Basically it is similar to Arweave but with significant differences.  Here is the section I wrote on arweave which gives a pretty decent overview:

Quote
Another coin worth mentioning is arweave [7]. Like Blockvault they claim to want to be like a digital library of alexandria. This is good and is the only protocol I can find that prioritizes long term data storage. Its miners are incentivized to replicate data, unlike any other storage cryptocurrency I have seen which typically only have any given piece of data saved on only one node. However there are some serious design flaws with arweave.

First they claim the data will be hosted forever with a small one-time fee just like blockvault, however in arweave (unlike blockvault) this is predicated on the value of the crypto that was paid as the fee to increase over time. There is no way to ensure this, as nodes and miners can pick and choose which blocks to store depending on the current value of that original transaction fee investment and whether they like your data or not. In blockvault all nodes and miners have to store all information always period.

Secondly arweave uses "http://". Using http means arweave has two options, either use icann hosted domains like .com or .org which icann can revoke at any time for supposed infringements, or use decentralized domains like .bit, .eth, .crypto which are not recognized by browsers natively. What blockvault does in this regard is rely on block explorer browser websites on the legacy internet (that use "bvid:") where people can browse the data there, or more preferably block explorer browser programs that allow users to browse the blockchain on their own computer if they are running a full node, or connect to someone elses full node. At blockvault we are aiming for a new internet, not to dovetail into the legacy one and inherit it's problems.

Thirdly arweave content is moderated by nodes using all sorts of checks. Moderation is censorship. In blockvault no one can censor the blockchain period. Also like IPFS, arweave hashes the data, not allowing the information to ever be edited once stored. To edit you would need to reupload all the information and pay a new storage fee, which isn't efficient. In blockvault, if you can sign for the page address (bvid) you can edit it, with the original and each subsequent edit preserved forever like github. There are also no storage fees on blockvault (just tiny transaction fees, that are optional by the way), as the miners are primarily incentivized to always store everyones information to win or verify blocks, unlike any other storage crypto.

One unique thing about blockvault is that all nodes have to hold the entire blockchain to both mine and verify transactions.  This means there will be a lot of miners and nodes storing the blockchain, not only a small fraction like is with bitcoin.  The way we enforce this is by hashing the entire blockchain with each mining hash.  Computers right now can hash a few gigabytes per second, so I think this is doable.  Right now on bitcoin asics get upwards of 100TH/s so I think there is some room to hash more data.  Also it would be probably the most asic-proof algorithm to ever be used.  Curious as to people's thoughts on this.
Jump to: