I don't need no SHA-256, no RIPEMD-160. what is needed is an optimized algorithm that works with non-compression public keys.
The fastest approach to this is not tied to a specific programming language but rather to how well ECC scalar multiplication is optimized. Libraries such as secp256k1 in C or Rust's secp256k1 crate are already highly optimized for this task.
Rng generators is more faster then simple range brute or kangaroo range brute. Kangaroo not provide result with 100% garanty, why people continue use and talk about kangaroo. I think kangaroo and bsgs not specialisation on crack, for ex they not provide option for replace base point, replace scale of range etc
Brute force is like rolling a dice repeatedly at high speed, hoping to land on a specific number. Each roll is random, and you have no control over the outcome, so you're essentially relying on sheer luck. The faster you roll the dice, the quicker you can try different possibilities.
Bitcoin key generation, on the other hand, is more like playing a game of Craps. The game consists of multiple stages which slow down the whole process of winning: you first roll the dice to establish a target (this represents the key generation). After that, you roll again in the hopes of matching or getting closer to the target. In both cases, there's an element of randomness and strategy, but instead of relying purely on luck, Bitcoin generation involves cryptographic rules that govern each stage, making it a complex and structured process which reduce the attacks to zero..
