Secp256k1 - 2 Bit Bias Solver Exercise

[vdog99]

This is just a theoretical Question and Good Exercise. I don't have a magical way to reduce the impossible amount of RAM to do this.

Hypothetically, Let Say you created a program where it is now trivial to solve for 2 Bit Nonce Bias for every Bias Type and Solve the HNP for secp256k1 curve.

How would you validate it and Test for it against the current Blockchain Data? I am aware that Post-2016 or Nonces are deterministic after RFC 6979

Example -
I understand that for 1 Bit Bias or Less the Ladder Leak Paper proves that signatures that were generated by OpenSSL 1.0.2u and 1.1.0l had 1 Bit Nonce Bias so if you had a magical solver
for 1 Bit you could recover sk but what about 2 Bit Bias?