Main Menu

Shuffle Bounty $200 BitUSD

Started by bytemaster, April 07, 2015, 01:12:48 PM

Previous topic - Next topic

0 Members and 1 Guest are viewing this topic.

pc

Quote from: btswildpig on April 07, 2015, 02:08:41 PM
"order"
this word means "command" or "sequence" in the OP ?
"sequence" in this case
Bitcoin - Perspektive oder Risiko? ISBN 978-3-8442-6568-2 [url="http://bitcoin.quisquis.de"]http://bitcoin.quisquis.de[/url]

btswildpig

"order"
this word means "command" or "sequence" in the OP ?
这个是私人账号,表达的一切言论均不代表任何团队和任何人。This is my personal account , anything I said with this account will be my opinion alone and has nothing to do with any group.

bytemaster

I am looking for a shuffle algorithm for delegates that has the following inputs:

vector<delegate_id>   prev_delegate_order
vector<delegate_id>   top_101_delegates_sorted_by_vote
sha256                        random_seed

I need to calculate the "next_delegate_order" such that the minimum distance between the same delegate is N/2 the number of delegates while maximizing the entropy and mixing.

This algorithm should be implemented in c++ using int64_t as the delegate ID.    I am looking for the best algorithm based upon the consensus on this thread.

Go! 

For the latest updates checkout my blog: [url="http://bytemaster.bitshares.org"]http://bytemaster.bitshares.org[/url]
Anything said on these forums does not constitute an intent to create a legal obligation or contract between myself and anyone else.   These are merely my opinions and I reserve the right to change them at any time.