>> (p.1)
    Author Topic: "Hash Chains" an idea for a new kind of "proof"  (Read 989 times)
    CIYAM (OP)
    Legendary
    *
    Offline Offline

    Activity: 1890
    Merit: 1111


    Ian Knowles - CIYAM Lead Developer


    View Profile WWW
    July 09, 2014, 05:15:55 PM
    Last edit: July 09, 2014, 05:47:30 PM by CIYAM
     #1

    I have been playing around with a new idea for "proof" that might be suitable for a new kind of blockchain.

    Blocks would be created by accounts whose hash matches closest to "hash chain" hashes published in previous blocks (yes - controlling the number of accounts that can be created is a key issue but one I have already considered).

    For those not familiar with what a "hash chain" is let me quickly illustrate (using MD5):

    MD5( "test" ) = 098f6bcd4621d373cade4e832627b4f6
    MD5( "098f6bcd4621d373cade4e832627b4f6" ) = fb469d7ef430b0baf0cab6c436e70375
    MD5( "fb469d7ef430b0baf0cab6c436e70375" ) = 25ab3b38f7afc116f18fa9821e44d561

    so to create a new account a node published the hash: 25ab3b38f7afc116f18fa9821e44d561

    When they "create their first block" they need to include the hash fb469d7ef430b0baf0cab6c436e70375 which can be easily checked to be correct from their initially published hash to be the "previous hash" (and cannot be reversed due to the fact that crypto hashes are irreversible).

    For their next block they would need to publish 098f6bcd4621d373cade4e832627b4f6 and they would "run out of the ability to create new blocks" once they have got this far.

    Apart from weak seeds (and MD5 for example purposes) can anyone explain any serious technical issues with this idea?

    With CIYAM anyone can create 100% generated C++ web applications in literally minutes.

    GPG Public Key | 1ciyam3htJit1feGa26p2wQ4aw6KFTejU
Page 1
Viewing Page: 1