Quote from: CrunchyF on Today at 07:56:45 PM

Quote from: WanderingPhilospher on Today at 07:26:04 PM

So your speed (30MKey/s) does not include actually searching for/finding and writing/storing distinguished points to RAM/file?

Exactly, but i'don't think it will decreases dramatically the performance.

in the way i'm imagine the system, the clients (lots of ARM CPUs) will be only dedicated to be wild or tame kangaroo and to performs pure increments in the random walk.

If a distinguished point is found (i've to find a way to be faster as possible) : example (AND mask beetween the first of the 5 limbs (5*52bits)of X and the desired DP,
the client send the X coordinate through a socket to the centralized server (computer with and hashtable checking continuously if a collision is found between received x coordinate and previously ones ).
I think it will not slow significantly the computing because a client send a message to the server only 1 on 2^DP times on average and a the stop of computing during the socket communication can be optimised to be fast.

I don't know your setup so I'm just asking questions.

So each tame or wild thread, must jump, check for dp, if dp send to hashtable and then jump again, if no dp, jump again, rinse and repeat.

In your test, you merely walked through 1 billion random points, correct?