Because it was a community involved quest; to find the fastest python code to gen and write to a file, 1 million addresses.
Not everything is about the puzzles/challenges.
One could say what is the point of providing a bunch of info on add sub div without concrete examples, from start to finish with result, but some do it anyway.
I know it was a "community challenge", I was wondering if it has any significance to nomachine's code when you said 1M address.
Also do you remember few month back when I could find public keys similar to #125 key? Well I will tell you this but it's not going to help you or anyone else.
Here is a new angle to work with subtraction only, try to subtract #130 from end range to get this :
0308360beeb0177961b04eccc33decdf63e23d205abc8ef6355d659d1313459ba7
Now if you just subtract 1 from it:
026a0747b3229f32ce2f0f7bd77a7bd306f6c95d27e7c5bee22a417938d9988605
Now if you add it to #130, you will have :
03e067911ebf6bacf87a8088ab9344c95843aed80b070eed09f9d947c98dfc0249
00000000000000000000000000000003ffffffffffffffffffffffffffffffff
Now if you subtract the above instead of 1, you get this:
035dee726b0fe623224fa1f4d79af66a9a1829213ec675875c619266a5f184e7d1
Once again, if you add the above key to #130, you won't get 1, instead you are actually adding -1 of #130 to #130, you can confirm that by subtracting it from #130.
Ok, why did we get a different result in our first addition? Because we just subtracted 1 from our offset the first time, so no -n result, but when we subtracted a larger key than our offset, the second addition should have given us 1, but why it added -1 of #130 to #130? Because I knew which key was greater than the other, but if you subtract the larger key > 3fffff..... from our offset, the second addition would have resulted in G.
I don't know why I'm explaining modular effect here, this is useless, unless you know a few tricks.😉