Hello! I wanted to tell you about a program that I recently downloaded and started using. The program was created to jointly search for private keys of forgotten/lost Bitcoin addresses with balance. The program itself is free to download and run in demo mode, so you can verify its functionality. Downloaded on this telegram channel: t.me/Trian_G_bit_R.

This is what the creators of the program write:

About the system: 
1. It has been mathematically proven that it is impossible to crack the Bitcoin cryptosystem.
2. The operation of the triangulator is based on the mechanics of the behavior and calculation of points in finite fields of p&n.
3. The cryptosystems of Bitcoin and other cryptocurrencies, which are based on the addition/multiplication of elliptic curve points in finite fields of large magnitude, are very well protected.
4. Prior to the availability of output transactions in the bitcoin blockchain, there is no data about each wallet other than the hash of the public key.
5. It is mathematically impossible to use a formula to determine the ratio of the signature coordinate of the nonce output transaction to the private key of the Bitcoin address.
6. Tests have shown that in the presence of three or more output transactions with RSZ signatures, it is possible to determine\catch the Privat Key by tracking the behavior of the general relation to three coordinates using the general initial formula X * (R1/Z1-R2/Z2+R3/Z3) = nonce1 * S1/Z1-nonce2 * S2/Z2+nonce3 * S3/Z3-1 and its intermediate variant X * (R1/Z1-R2/Z2) = Y1 * S1/Z1-Y2 * S2/Z2.
7. With some combinations of the bit symmetry of RSZ groups, this exceeds the probability of detecting/calculating a private key relative to a random one by tens of orders of magnitude.
8. At the same time, the random method itself is not used, because searching for a private key through a random generator is absolutely futile and even impossible.
9. For example, if all computers and chip devices in the world were busy only generating a never-repeated private key at a very high speed, about 318 billion per second for each device, and there would be 10 billion such devices, then it would take 10 billion years and 10 billion parallel universes to one day in one of the One private key from one of the 100 million bitcoin addresses in the blockchain was discovered on the device. At the same time, with a probability of >80%, this bitcoin wallet would be empty. 318 000 000 * 60 * 60 * 24 * 365 * 10 000 000 000 * 10 000 000 000 * 10 000 000 000 * 100 000 000 = 10^48
At the same time, random generation requires converting the generated random variant of expensive computational operations into functions privatKey->publicKey->hash(publicKey)=Address.
10. Therefore, Trian.G.bit.R does not use random functions, but works only by the method of parallel-sequential asynchronous calculations at three points connected by a common privatKey->publicKey from the group of three output RSZ.
11. The Trian.G.bit.R algorithm requires significant processor computing power, but in order to avoid hacking, it is divided into two levels:
     a) calculating intermediate shift points via GPU;
     b) triangulation by narrowing the field in the local ratio of the bit symmetry of RSZ groups using the main 64-bit processor + RAM.
12. The Trian.G.bit.R program has a built-in joint search function for triangulating groups of RSZ wallets with a balance of 2010-2017 and later versions having >2 output RSZ and showing signs of being inactive or lost.
13. The server distributes ready-made groups of three dedicated RSZ to the subscriber. After successful calculation of the private key, the program generates a group transaction for the entire balance of the found address, minus the commission in proportion to the tariff for working with the subscriber, and after generating the signature, this group transaction is transferred to the bitcoin blockchain. Thus, the joint receipt of the found amount of BTC is fully guaranteed.
14. For a general local health check of the Trian.G.bit.R program, a demo mode with a limited triangulation depth without shift points is built in, which can find a private key for RSZ groups with relatively close bit symmetry. You can get such RSZ groups, for example, in the program GenRSZ.exe , which is located in the folder with the program archive.
15. Demo test mode allows you to test the performance of Trian.G.bit.R and set the optimal number of parallel processes that can be successfully performed on the subscriber's computing device.
16. In order to work with the server by triangulating three RSZ from the Bitcoin blockchain, the subscriber must guarantee long-term collaboration by making a conditional refundable deposit in USDT(ETH).


How it works:
1. The program triangulates 3 RSZ groups that have a common private->public key and looks for relationships between three points to determine the private key.
2. The program requires large resources of central processors and RAM. Each triangulation process requires at least one 64-bit core with a frequency of approximately 2.7 GHz and 4 GB of RAM.
3. One process can only triannulate one combined RSZ group. To reduce calculations, the selection of RSZ groups is used with a narrowing of the field of bit symmetry within the associated RSZ group.
4. During triangulation, calculated shift points for triangulation cycles are used to prevent the program from reaching a dead end.
5. To prevent hacking and speed up the work, the algorithm is divided into 2 levels:
     a. Triangulation of three RSZ groups:
     b. Calculating shift points to continue the triangulation operation.
6. When executing the general triangulation algorithm, 98% of the work is performed using the CPU and RAM. RAM is used to create and modify the R-matrix of three primary values R1 R2 R3 as public coordinates of three points with private multipliers nonce1, nonce2, nonce3.
7. Thousands of parallel processes are needed for the successful operation of the program, therefore, a joint search program has been launched with subscribers who have sufficiently powerful computing devices with the division of the found amount of btc.
8. By joint search, if the subscriber has a computing device, the probability of close detection of the private key in the general RSZ group is 277*24*60*60 sec. with a core frequency of 4.2 GHz. and the use of 63 parallel processes, which is tens of orders of magnitude higher than random search.
9. Thousands of parallel processes using a large amount of RAM are needed for effective search, therefore, a program for joint search and obtaining the found btc volumes in a joint search mode with the server is proposed.
10. Each activation code is associated with the Bitcoin address of the abonent to which the transaction is generated after calculating the private key for 3 RSZ groups.
11. After finding the private key on the abonent device, the current balance is checked and a combined transaction is formed with two outputs - to the abonent Bitcoin address and the Bitcoin server address in proportion corresponding to the activation code minus the network commission Fee.
12. Next comes the formation of a group transaction and verification of the valid signature R,S in accordance with Z = hash of the generated group transaction, the found private key is erased and only the signature R,S remains for the Z group combined transaction abonent \ server. This guarantees mutual respect for the interests of the parties.


There is also a lot of interesting information in the FAQ section, but I will not write them here, so as not to overload the article.

What do you think, in fact, this program will be able to access old and forgotten bitcoin wallets that are dead weight, because people have long lost access to them? After all, you can periodically observe the withdrawal of funds from wallets that have been inactive for about 10 years and by all signs look like forgotten or lost wallets. And is this method an alternative to mining, because mining is becoming more difficult every year?