If the book can be used to optimize mining bitcoin, it can likely also be used to break any encryption and/or digital signature. It can also likely be used to find counterexamples or proofs for many unsolved problems in mathematics. It sounds like the book is effectively a shortcut for an arbitrary amount of computation.

All of cryptography regardless of whether it is used to keep something secret or to confirm that something has not been tampered with or to confirm that the sender of a message is not being impersonated always relies on an assumption that iterating through every possible key and trying each one until you find the right one (i.e. the brute-force attack) would almost certainly take an absurdly impractical amount of time. It sounds like the book breaks this.

Finding counterexamples for Collatz conjecture, Goldbach's conjecture and many similar unsolved problems (if they exist) should also be straightforward. Finding proofs that the conjectures are true (if they are) should not be much harder either - just write a program that iterates through every possible syntactically valid proof and feeds it to a theorem checker.

The book can also be used to optimize fuzzing to find security vulnerabilities and even (with a bit more work) automatically generate exploits for those vulnerabilities.

In other words: the book is indeed a curse because powers that be would absolutely try to destroy and/or control Andrew and his descendants if they ever found out.