[BangPypers] What is the output of this python program?

Shabda Raaj shabda at agiliq.com
Sun Apr 7 07:56:06 CEST 2013

I saw this Java question on SO and ported to Python.


Here is the searcher function:

It tries to find the seeds using brute force.

Is there a way to optimize the searcher function? For example finding seed
for "hello" takes less than a minute. Finding  the seed for "hello world"
was taking longer than I was willing to let the program run. (The Python
random algo is Mersenne twister, which is a non cryptographic PRNG, so it
*might* be possible to find seeds without brute forcing.).

Related, we were recently discussing these (in our office) in terms of
Bitcoin type proof of work. Finding the seed for words is cpu intensive and
is a proof of work. Verifying the seed is trivial in cpu time.


Agiliq.com - Building Amazing Apps
agiliq.com/blog/ | github.com/agiliq
US: +13152854388 | IN: +919949997612 | Skype: shabda.raaj
Our Android Apps <https://play.google.com/store/apps/developer?id=Agiliq> | Our
iOS Apps <https://itunes.apple.com/us/artist/agiliq/id407918088>

More information about the BangPypers mailing list