Quote from: mrxtraf on September 28, 2019, 08:34:58 AM

Which program can iterate bitwise but not in direct order?
Example.
We have start number in dec
223549943504745960712268251712
And have map position bits
0->10, 1->25, 2->8, 3->51 and etc
In this variants next number not
223549943504745960712268251713
convert to bin
00000010 11010010 01010100 00101101 11100000 01010111 11000110 00101011 10001001 11000000 01100101 10000010 01000000 00000010 11010010 01010100 00101101 11100000 01010111 11000110 00101011 10001001 11000000 01100101 10000110 01000000
in dec 223549943504745960712268252736
next
00000010 11010010 01010100 00101101 11100000 01010111 11000110 00101011 10001001 11000000 01100101 10000110 01000000 00000010 11010010 01010100 00101101 11100000 01010111 11000110 00101011 10001001 11000010 01100101 10000010 01000000
in dec 223549943504745960712301806144
next
00000010 11010010 01010100 00101101 11100000 01010111 11000110 00101011 10001001 11000010 01100101 10000010 01000000
00000010 11010010 01010100 00101101 11100000 01010111 11000110 00101011 10001001 11000010 01100101 10000110 01000000
dec 223549943504745960712301807168
next
00000010 11010010 01010100 00101101 11100000 01010111 11000110 00101011 10001001 11000010 01100101 10000110 01000000 00000010 11010010 01010100 00101101 11100000 01010111 11000110 00101011 10001001 11000000 01100101 10000011 01000000
dec 223549943504745960712268251968
and etc for all position.
Well, its understandable to apply the obtained values as a private key to check for matches.
It is also desirable that the key is cut to the desired value in bits and the first bit is set to the left. According to the specified lengths.
Example.
In programm seeted values 70,71,72,73,74
App calculate next priv sample in bin
00000010 11010010 01010100 00101101 11100000 01010111 11000110 00101011 10001001 11000000 01100101 10000011 01000000
and try get key from next data

Code:

orig :...101 11100000 01010111 11000110 00101011 10001001 11000000 01100101 10000011 01000000
74bits: 11 11100000 01010111 11000110 00101011 10001001 11000000 01100101 10000011 01000000
73bits: 1 11100000 01010111 11000110 00101011 10001001 11000000 01100101 10000011 01000000
72bits: 11100000 01010111 11000110 00101011 10001001 11000000 01100101 10000011 01000000
71bits: 1100000 01010111 11000110 00101011 10001001 11000000 01100101 10000011 01000000
70bits: 100000 01010111 11000110 00101011 10001001 11000000 01100101 10000011 01000000
69bits: 10000 01010111 11000110 00101011 10001001 11000000 01100101 10000011 01000000

Which app can make this? Kango, vanity, hashcat? And nead calcualte on GPU. On CPU i have realisation on php.

I am pretty dumb, so after 20 minutes, i still could not figure out what you are trying to do.

I especially do not understand this part:
"And have map position bits
0->10, 1->25, 2->8, 3->51 and etc"

decimal confuses me, so i converted to hex and got these numbers (and spaces to visually separate the part that changes):
2D2542DE057C62B89 C06582 40
2D2542DE057C62B89 C06586 40
2D2542DE057C62B89 C26582 40
2D2542DE057C62B89 C26586 40
2D2542DE057C62B89 C06583 40

i still don't get it.

Bitcrack is easily modified to create whatever starting points you want. Look at CudaKeySearchDevice.cpp.
You can write functions to play all sorts of bit games, shifting, rotating, random XOR, using digits of pi, etc.

I have made my Bitcrack spin the top 2 bytes from 0000-FFFF for each random 3 bytes (15 of them per run). Then it spins the last 2 bytes 0000-FFFF and restarts. It can also read 3-byte numbers from a text file every time it restarts. The few million leftover starting points are random.

The interesting thing is, i have not run any of my bitcoin hacking programs for a few weeks and still achieve the exact same results!