Question

Using hashlib.scrypt(), find the following:

1. a value for n where r=64 and p=2 that falls in the same 0.05±0.001 time window to compute.

2. What the maximum value for n is if r=64 and p=2 before the library throws a ValueError?

3. Adjust maxmem to pow(1024,3) and see how large of a value you can get for n. How long does this take to compute?

Answer 1

it requires a good configuration to work on such large datasets, you are lucky i have been working on ML projects since last 2years.

i can provid eyou the values, generated on my machine.

1. n was pretty large, that is 10^134, was the value which came under this time frame, but i believe this is completely dependent on your machine power, try it on your machine though.

2. 10^134+1 was the value error on my machine, but , i checked it on more powerful machne also, it can go upto,

10^168

3. 3^989 is the largest value i was able to get for this pow,.

NOTE ; these kind of questions are completely abstract , just to learn by self, no one can judeg on these questions as they are completely machine dependent.

Try to run on your machine once.