9631
BitShares PTS / Any volunteers to stop mining?
« on: November 08, 2013, 09:38:33 pm »
You know, so the network can behave better?
Yeah, I didn't think so
Yeah, I didn't think so
This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.
i can make an UI design for the wallet ..
bytemaster, hope you saw my response. I think you underestimated the issue:
https://bitcointalk.org/index.php?topic=325261.msg3523201#msg3523201
The fact that the algorithm uses a constant amount of memory regardless of the hash output size means that no matter how large MAX_MOMENTUM_NONCE or SEARCH_SPACE_BITS values are, the memory requirements are essentially zero. This means that no matter how slow the algorithm, it's infinitely more efficient (memory vs collision rate) than the current implementation.
Given that it requires a constant amount of memory, Momentum as a proof-of-work is essentially equivalent to scrypt/md5/sha512 on a higher difficulty.
Now, if H is a random function on an m-element set, then, by the birthday paradox, the expected number of steps
Wow great work guys! I am taking some time to digest it all and really wish the bounty would have been taken more seriously prior to launch.
If the input is given as a subroutine for calculating ƒ, the cycle detection problem may be trivially solved using only λ+μ function applications, simply by computing the sequence of values xi and using a data structure such as a hash table to store these values and test whether each subsequent value has already been stored. However, the space complexity of this algorithm is λ+μ, unnecessarily large. Additionally, to implement this method as a pointer algorithm would require applying the equality test to each pair of values, resulting in quadratic time overall. Thus, research in this area has concentrated on two goals: using less space than this naive algorithm, and finding pointer algorithms that use fewer equality tests.