Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Matthews Lab
Search
Search
Appearance
Log in
Personal tools
Log in
Pages for logged out editors
learn more
Contributions
Talk
Editing
Datachain
(section)
Page
Discussion
British English
Read
Edit
Edit source
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
Edit source
View history
General
What links here
Related changes
Special pages
Page information
Appearance
move to sidebar
hide
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
= Attacking the datachain = Since you’re attaching submissions to the minting of new rewards within a chain you would need to use a hybrid proof-of-work system where submissions were also mined using standard hashcash style proof-of-work (or just stamp them with Bitcoin.) Otherwise Google can come along and replace the entire chain in 1 nano second. There is also the issue of reverse engineering the AI to produce thousands of random garbage images that would all be considered valid. To stop that problem, the data set would likely have to be specified beforehand by using hashes – for example by using meta-data collected from a list of torrent files that is then distributed with the DAS at the time of its creation. The final problem is that you would need to find a way to verify that submissions were unique so that minor alterations couldn’t produce millions of new matches. There are algorithms that can do that without effecting the decentralized nature of the DAS, however the problem with that is – the algorithm would likely have exponential properties since it would need to check every past image against new solutions (this is bad.) Alternatively, you could just ignore duplicates. Doubtless to say that a vast number of duplicates would still occur but if you restricted solutions so that they can only come from a valid pre-existing set of files based on meta-data: the incentivisation structure would probably still work. <span id="future-work"></span>
Summary:
Please note that all contributions to Matthews Lab may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Matthews Lab:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)