Topic: keysubtracter - test - development requests - bug reports (Read 2175 times)

I am trying to follow what you are saying as well, as I have a Windows version, and want to make sure there are no bugs, as you say.

When I run your command line flags:  WindowsKeySubtractorv2.3 -p 0265119A9E94A135BAE5E03AD6F41DA5D7D7CC5873448FFC7B2F2304B520DBE133 -s -a -n 32 -f publickey -o 0x10to0x100.txt -r 0:13CD125F2165F8510DBA46008014A09

(with my Windows version), I get:


If I take the first one you show different, (the 4th down the list, and run it with keymath) I get:


But you get something like this:
036e531664a1356caf0e253a3c1cd6f46724358cbcc07892c6a34f94769f9554fa

It would help if you would post the entire output file, as I did above, to see all your results, to better understand, if there is a disconnect or something.

now check the out put off ecc tool and subtract its not same alltime

@farshadbbb Thank you for report it, but I think that you don't full understand how it works:

Lets run the values that you suggested but with all the offset comment information.

Command:

Output:


Lets take any value example:

Now using modmath or keymath:


So in general if your substracted key is:

the Target key is


This work with all the values given by the output of keysubtracted.

Hava a nice day

                                                                                                      8F39E9339CB57B4FD233864AC7E50481DCFD8725979E79B487494451A6DE5B44
 + 1645007837268601581759340926449306128 ====>                   +                                                         13CD125F2165F8510DBA46008014A10
                                                                                                      __________________________________________________________________
                                                                                                     8F39E9339CB57B4FD233864AC7E50481DE3A584B89B4D9399824E8B1AEDFA554 


but subtrac gave us this


8f39e9339cb57b4fd233864ac7e50481de3a584b89b4d9399824e8b1aedfa54d        036e531664a1356caf0e253a3c1cd6f46724358cbcc07892c6a34f94769f9554fa

KEY SUBTRACTOR DON WORK WEELL
1EELvJCgvKkxR9pemz3vjT9ExV4JwA8EUU    adress
8F39E9339CB57B4FD233864AC7E50481DCFD8725979E79B487494451A6DE5B44    pv key 0265119A9E94A135BAE5E03AD6F41DA5D7D7CC5873448FFC7B2F2304B520DBE133   pubkey
------------------------use keysubtracter     ./keysubtracter -p 0265119A9E94A135BAE5E03AD6F41DA5D7D7CC5873448FFC7B2F2304B520DBE133 -n 32 -f address  -o  0x10to0x100.txt  -x -r 0:13CD125F2165F8510DBA46008014A09


results   
1GsPaXkdFKq4Bjdjai46XJp59e4Zggq2dT 8F39E9339CB57B4FD233864AC7E50481DD115437F6BFDFACD856FE97A75E6FE5 02A5A025764100E0A61B73C3B6B3E7AAF2DC16D828156E06C39EF1FE6861DDA86A
1MQJpZo1mfuvNdk3GQeB5tokM2FYcutNgo 8F39E9339CB57B4FD233864AC7E50481DD25214A55E145A52964B8DDA7DE8486 0310CA2B0AFE2A8B218F56D9E5DDA2A92B90DEA6D5D45824464D3EFCD297A6AE13
1LBVtevjQetHrhFpnP3GxVhoaSoeB4e8pg 8F39E9339CB57B4FD233864AC7E50481DD38EE5CB502AB9D7A727323A85E9927 02DA040AA5E121ADD16D5AE06B65E39801185401BEFB44F55FE8DC77FFC5FA756C
1CXx3rSFVBBfdVNDVNgZJFZDxt9ytkjysx 8F39E9339CB57B4FD233864AC7E50481DE3A584B89B4D9399824E8B1AEDFA554 0385CD34FBE923F770A51FEBD5C7C3249727A049859BC6581CA53C997F76052709
1ADw5YSCS1Jovix3XuEMYt6VpAncVwg4x  8F39E9339CB57B4FD233864AC7E50481DD4CBB6F14241195CB802D69A8DEADC8 02D28F2BADB89E7A2F8F44911F7FC8129984888A5B6F80747C4740F1BDF4CF881A
1EfeYSuMyvDKTcLt8jLsszMUQC6AJ4xigE 8F39E9339CB57B4FD233864AC7E50481DD6088817345778E1C8DE7AFA95EC269 02765794A6E3E7C5E73415A2E8A671D7080E8BD6F44E504BF4E88E9D5F09FF10E8
1z1knxXkVikqGXg3ius86GiPbsSZiwi3S  8F39E9339CB57B4FD233864AC7E50481DD745593D266DD866D9BA1F5A9DED70A 0297828E7DB0FBC26063BCE0942755BC68AE983A9160CC393CE757D9A5FFC039C3
1MtJGJ3XPBD9hUz1dWYVn8dabmTxQwXyuQ 8F39E9339CB57B4FD233864AC7E50481DD8822A63188437EBEA95C3BAA5EEBAB 03F495895E94768FF4DB43824EF319F4E1626476B784B686D9288F15D57EF06BE5
1CbEr7CAGZwE2Cqu1nrp3nSYYqSZYQdBiD 8F39E9339CB57B4FD233864AC7E50481DD9BEFB890A9A9770FB71681AADF004C 02F4958FD72F0550109D3C8A3F198156AD92F2658E2BEF65EF7CEDCBCD1CE10A99
1BJEjxqA8pMCUTEpGbr4UFa37g4j77G2ur 8F39E9339CB57B4FD233864AC7E50481DDAFBCCAEFCB0F6F60C4D0C7AB5F14ED 03A7A7035F849E1F3A043800141CE70734A3EBCFF878F5DD98AD65B46CF09A8501
1NRfvxBGhztkQreqCK2j4dGTZUyruqgs1m 8F39E9339CB57B4FD233864AC7E50481DDC389DD4EEC7567B1D28B0DABDF298E 03557D8BB835AC1F812238C316DEA5B18056C059896743CA4357E6E7DF8F20BBCB
1MQgJomzMWy92prcLYApEg1YcqTjgSWV4N 8F39E9339CB57B4FD233864AC7E50481DDD756EFAE0DDB6002E04553AC5F3E2F 02E8B6285C9C2EEB5245923BCB5810B42FC6957F883A1BF06EBF3BDDCF5D28E432
1CVkS4h6Qs2ajw8xDMuAfAgDTgvKFuHKVF 8F39E9339CB57B4FD233864AC7E50481DDEB24020D2F415853EDFF99ACDF52D0 03B0852769C61BC92EBB4B8E0325189803A7672D7AFF8138FCAF7E0912FB6DB83B
1BPWQgdfrw11P9eskfYQ3vZWg1zNXTN1Z4 8F39E9339CB57B4FD233864AC7E50481DDFEF1146C50A750A4FBB9DFAD5F6771 0292B9A4A62C9B11C2B74F5A112C3AE6F8205A812E50E1A998B72A3572206B2E60
1PbSvzjbCybcSFipSERiMd9UtCndWGrKfJ 8F39E9339CB57B4FD233864AC7E50481DE12BE26CB720D48F6097425ADDF7C12 0283CD0F56A1F1444437BB9BB527E6E23FD187F39A46CF5BAAE15635204D0BCE0B
19D1qGRrwP9ot36GPg9Qvyjx9pHvP98muF 8F39E9339CB57B4FD233864AC7E50481DE268B392A93734147172E6BAE5F90B3 021118F300AF0FE59577E4ECEFDC11F36D5CB910413D264726A767FD21A15DEE1C
 but if u chek some results are false and couse after one false if u want get subs from subs all beacame false
true result is
8F39E9339CB57B4FD233864AC7E50481DD115437F6BFDFACD856FE97A75E6FE5 02A5A025764100E0A61B73C3B6B3E7AAF2DC16D828156E06C39EF1FE6861DDA86A
8F39E9339CB57B4FD233864AC7E50481DD25214A55E145A52964B8DDA7DE8486 0310CA2B0AFE2A8B218F56D9E5DDA2A92B90DEA6D5D45824464D3EFCD297A6AE13
8F39E9339CB57B4FD233864AC7E50481DD38EE5CB502AB9D7A727323A85E9927 02DA040AA5E121ADD16D5AE06B65E39801185401BEFB44F55FE8DC77FFC5FA756C
8f39e9339cb57b4fd233864ac7e50481de3a584b89b4d9399824e8b1aedfa54d 036e531664a1356caf0e253a3c1cd6f46724358cbcc07892c6a34f94769f9554fa
8f39e9339cb57b4fd233864ac7e50481dd4cbb6f14241195cb802d69a8deadc6 03616ae6fe2c6c7a9a97027c52305cccc9b64758916eaf4dfb2db994d4d65ce2f7
8f39e9339cb57b4fd233864ac7e50481dd6088817345778e1c8de7afa95ec267 03191794e225b3fed0391261c5ed25616d38f0c33497d164f370912fdbae9bc1f6
8f39e9339cb57b4fd233864ac7e50481dd745593d266dd866d9ba1f5a9ded707 029383a890b195a64848c6bf50e68b924fd62ad545555005ef2db3c643af744ace
8f39e9339cb57b4fd233864ac7e50481dd8822a63188437ebea95c3baa5eeba8 0309ddd0888be5dfe0c665c64ec1eba91fb4246cb7ea5d70752cdfbb8c8967a331
8f39e9339cb57b4fd233864ac7e50481dd9befb890a9a9770fb71681aadf0048 03a538d719f3ef5b494f6a18cde1347764afa008b2aefd9861fdc2a3303557a923
8f39e9339cb57b4fd233864ac7e50481ddafbccaefcb0f6f60c4d0c7ab5f14e9 036a1f5dd3bcc7c81fe2b16a2b91786a4d056b8d892c0b1af2d9681fbcd58efa8c
8f39e9339cb57b4fd233864ac7e50481ddc389dd4eec7567b1d28b0dabdf298a 02f5269c5779fac10d4b0b0cba9f3b77cbf3d5b9f96a9c6cdf0476bf2d5879eda3
8f39e9339cb57b4fd233864ac7e50481ddd756efae0ddb6002e04553ac5f3e2a 03f913785579d454ab4ffd63d4fb26cc49b14db1fd57758e2921214ff77dd4c62d
8f39e9339cb57b4fd233864ac7e50481ddeb24020d2f415853edff99acdf52cb 02d865dfbb3b5928f7495f8d3267f30885994db9dfcdb6aa82452ff2ff27349e53
8f39e9339cb57b4fd233864ac7e50481ddfef1146c50a750a4fbb9dfad5f676b 03cba703947a45728f6c241a8ad782cd762a2a18603df38cdb0a8e0e26e78ebfe5
8f39e9339cb57b4fd233864ac7e50481de12be26cb720d48f6097425addf7c0c 03bda4005a84a25a025ccd022bb0cd0836673d3b95865bf06cc8b4cef12eda7fd9
8f39e9339cb57b4fd233864ac7e50481de268b392a93734147172e6bae5f90ac 036c520c6d7a6552dc590a27fc73221c09b78cb92c7ac7409bbe024c9d77a6373c

Ok now I understand, thank you very much sir, I'm using your Keyhunt in BSGS random at the moment only 64Gb RAM but I ordered another 64GB with a 7950x Great program btw

You still need to use range 135...

This is what the program actually do, if you have targe key it create N amount of keys arount that key like a target.

Example for -n 10

All those subtracted keys are near the target key and limited by the range that you select -r  or -b

Sorry for asking but I don't understand, let's say for puzzle 135... if I add/substract with the command ./keysubtracter -p 02145d2611c823a396ef6712ce0f712f09b9b4f3135e3e0aa3230fb9b6d08d1e16 -n 100 -b 90 ...   then on Kangaroo what range should I use ? The range for 135 bits key or the range for 90 bits ?

Ahhh, I see what you mean, for some reason I wasn't considering that as an option... could end up a fair depth deep in order to get a reasonable working range to scan.

Thanks for your insight.

Lol, I know you say you are new to this tool, but I do not understand what you are saying/wanting to do.

Let me break it down. Let's say you want to space all keys out at every 100; can be as close or as far apart as you want them.

So you run your first 2^32 keys as such; public key = 1, n = 2^32, range = 1:2^32*100 = n 4294967296 range = 1:429496729600, now keys will be spread out every 100 keys (429496729600 / 2^32 = 100). You follow so far?

Now let's say you want more than 2^32 keys, you want 2^33 keys. So on your next run, you would do the same, just change the public key: public key = 429496729600, n = 2^32, range = 1:2^32*100 = n 4294967296 range = 1:429496729600

SO yeah, I do not follow what you mean by "Optimally, you'd want them closer together for a shorter search time." it really makes no sense, because you can change your 2nd and 3rd runs to whatever you want, in relation to the first run, same distance, shorter distance, longer distance, etc. however, that's not the point, the point is/was, you can generate more than 2^32 keys, you just have to make multiple runs.


It helps if one wants more than 2^32 generated keys, not sure how else to explain it.

Not sure how running a second or third time will help.... That will only create more at roughly the same distance apart as the previous run(s). Optimally, you'd want them closer together for a shorter search time.

EDIT:

I am search for puzzle #130 in the range 200000000000000000000000000000000:3ffffffffffffffffffffffffffffffff

Created 2,000,000,000 subtracted pk's. Each should be 340,282,366,920,938,484,656,701,964,288 apart. That's quite a distance  - 7573948.693931144 years of searching for EACH at 10 Pkeys/s  (that is, if my math is correct). 15147897387862288 years of searching that range without the added pk's.

That is an impressive reduction of time, but alas, I don't think I have 7 and a half million years to spare haha

Absolutely great idea, still not in the feasibility category yet though for the higher ranges.

Oh, so that means n is limited to 2^32 keys for each run...you could do as many runs as needed to reach desired number of generated keys.

The number of pubs that can be generated?

The distance is based on how many keys you want to generate.

The program takes the range you provide (always rounds up to an even number), subtracts the start range from the end range, and then divides that by how many keys you want generated.

Sticking with numbers, if your range is 1:2,000,000; and the number of keys you want generated is 1,000,000; then the distance between generated keys will be 2; 2,000,000 divided by 1,000,000.

I do not know where the 32 bit limit is implied or came from. Can you explain more?

Ok, so I think I understand how this works... certainly has some interesting potential.

If I am searching a higher range, the most this will script will give me is a distance of 2^32 from the unknown pk - Am I understanding this correctly? or is it the number of additions/subtractions that is 2^32 limited?

What range values should I enter in the script? Should I start from 0 to upper range limit, or only the actual range I'm searching?

It's been decades since I've thought about any advanced math topics, so it may take a bit to wrap my head around this type of stuff. Definitely interesting though!

Is there any way to know if a subtracted public key reaches out of bounds? For example if the subtracted public key goes below 0? From my understanding it would simply just loop around... so, would it be an idea to check the generated public keys to see when the subtraction hits that loop around point, then backtrace to see how many steps it took to reach that point....(which should give a closer point to start scanning from)?

Thanks

Just as a note, if people are not familiar with the program:

You only need the above python script if you are running in Random mode, -R.

If not running in Random mode, you can simply run the keysubtracter again without the -x flag.

I've made this simple Python script to process the resulting file from Keysubtractor, removing all the information beyond the pubkeys/hash160/addresses.

The original file will be kept intact as the script creates a new out file, this way you won't lose all the valuable information.


with open('pbks_in.txt', 'r') as file, open('pbks_out.txt', 'w') as outfile:
    for line in file:
        cleaned_line = line.split('#')[0].strip()
        outfile.write(cleaned_line + '\n')


Just have it in the same folder your Keysubtractor file is in, and don't forget to change the names of the in and out files to match yours.

I know this is simple stuff, but I hope this can be of help!

No, the program is actually very ok, i like it, it doesn't need any improvment. It does what it supposed to do. But sadly it's limited to 32 bits.

ps> and goodluck too!

Yw.
By special thing you mean my suggestion to improve this tool? Well to be able to do that we need the code written and developed, and alberto is MIA for some time now!

Good luck with your test, I haven't left the testing grounds yet, so welcome on board, and keep grinding.

Thanks for answer.

I am not doing that special thing, just some testing with pzzle 125