• 1 Post
  • 288 Comments
Joined 3 months ago
cake
Cake day: March 28th, 2024

help-circle
  • The second premise is very dependent on the algorithm and the hardware itself. “Faster” can be very different when parallelization comes into play. Baring that, ASIC’s also a thing. Also, Moore’s law has not been very relevant since around 2020? The new Moore’s law is power efficiency and not transistor density. Say for example, we’ve peaked at 5GHz on a single core performance with x86 ISA. Then the next step is how to reduce the power consumption for the same 5GHz.

    Now, the readme mentioned about using Argon2id. A cpu-memory-hard function. So you are also limited by the theoretical maximum memory that you could allocate to crack the puzzle faster.

















  • Its already in your word. Proportional. A proportional control, or P control (generally, a PID with the K_I and K_D set to 0)

    Alright some edit as I will try to explain my answer. Say for example a value ‘x’ is > 0 and < 100 (so, 0 < x < 100). In this case, the point that you wanted to reach is 100, such that x is always getting bigger and closer to 100 (x->100). If you subtract x from 100, you get the remaining, call it ‘y’, that you need to add to get to 100 (y=100-x). So now, the rate of change must be proportional to that number. I.e., as x gets closer to 100, y will get smaller. How much faster is determined by a proportionality constant, that can be called K_P.