let's say we have a list of lost addresses/keys in some distributed database and what next? how do you want to find the key: people in the p2p network are supposed to generate keys and match? how do you want to search for keys? generating all combinations and comparing with an old, long unused public key? write something more, nobody will steal your method, I'm just curious what you came up with?
edit:
https://lbc.cryptoguru.org/about ?
The system works in a messy way, but I should explain it in simple terms.
The structure consists of 3 phases
1- Lost Wallet database
2- HEX64 worker database
3- Unifying field
4- Reward center
For example, each user generates 1 billion blocks.
0000000000000000000000000000000000000000000000000000000000000000- 000000000000000000000000000000000000000000000000000000003b9aca00
While the system is generating this field of 1 billion blocks, another user detects that this field has been generated and does not generate this field, which the
“HEX64 worker database” will provide. It randomly generates a different field. If two consecutive blocks run out, they are merged in the
“Unifying field”, which is P2P connected to the users so that they do not take up more space in the database.
because creating a database that can store even 1 billion production blocks one after the other
For example
block_308002 0000000000000000000000000000000000000000000000041d546d02404c4eff 0000000000000000000000000000000000000000000000041d546d027be718ff 2024-10-25 09:05:48
this is 2 Petabytes to write all blocks one after the other.
instead the generated blocks will be concatenated by the
“Unifying field” and a single line will be written.
each producer will instantly register their wallet in the
“Lost wallet database” at the same time. If the lost wallet is found, it will be encrypted in the
“Reward Center”.
The reward center stores and updates the total list of running users and the total number of blocks generated by users.