takes about 4 days to make 5 characters like my npub
each additional character is probably 100x as long, for example you can mine a 3 character string in about 5 minutes maybe, 4 character in a few hours
the thing is that the pubkey is a hella amount of calculation to check for a pattern on top of the secret... i'm not sure if there is some way to fragment them, like, to use the EC group but make it a dual key split out of two keys, and then how do you compute a signature from that? is it going to use the root key raw bytes with the secondary key raw bytes?
i have not looked into how one can do this, the general idea would be that based on a master pubkey, anyone can compute a valid child subkey, and so on, this would make it possible for someone to send you a message to a key you have the secret for without it having ever been used before and without needing an interactive protocol to generate it
if i remember correctly, the secp256k1 group has an interesting property that if i have a secret somewhere in a chain of HD keys, it is much cheaper for me to reverse the derivation of at least the first upstream key, and then once you have that you can eventually get the root
so even if it is theoretically possible, non-interactive derivative key generation could have some serious security pitfalls on the path
mleku / mleku™️
npub1fjq…leku
2024-07-07 10:59:51
in reply to nevent1q…fnqt
Author Public Key
npub1fjqqy4a93z5zsjwsfxqhc2764kvykfdyttvldkkkdera8dr78vhsmmlekuPublished at
2024-07-07 10:59:51Event JSON
{
"id": "ccaf9274bfca1cbb80bf9d8c674357b42eed63e63b76ef0eb799f8c9615604dc",
"pubkey": "4c800257a588a82849d049817c2bdaad984b25a45ad9f6dad66e47d3b47e3b2f",
"created_at": 1720342791,
"kind": 1,
"tags": [
[
"e",
"08fcaf165be0d83023a716b104b86cdbe80be7b9fb55424301606178aa2b40a2",
"wss://relay.primal.net/",
"root"
],
[
"e",
"1d62bc728b981ea65ca45b3e9b8421d5aaea697d96380f37af1e3a55dc87c448",
"",
"reply"
],
[
"p",
"7776c32d4b1d1e8bf2a96babeb43ad9ade157bd363d89b87fb63e6f145558888",
"",
"mention"
],
[
"p",
"50de492cfe5472450df1a0176fdf6d915e97cb5d9f8d3eccef7d25ff0a8871de",
"",
"mention"
]
],
"content": "takes about 4 days to make 5 characters like my npub\n\neach additional character is probably 100x as long, for example you can mine a 3 character string in about 5 minutes maybe, 4 character in a few hours\n\nthe thing is that the pubkey is a hella amount of calculation to check for a pattern on top of the secret... i'm not sure if there is some way to fragment them, like, to use the EC group but make it a dual key split out of two keys, and then how do you compute a signature from that? is it going to use the root key raw bytes with the secondary key raw bytes?\n\ni have not looked into how one can do this, the general idea would be that based on a master pubkey, anyone can compute a valid child subkey, and so on, this would make it possible for someone to send you a message to a key you have the secret for without it having ever been used before and without needing an interactive protocol to generate it\n\nif i remember correctly, the secp256k1 group has an interesting property that if i have a secret somewhere in a chain of HD keys, it is much cheaper for me to reverse the derivation of at least the first upstream key, and then once you have that you can eventually get the root\n\nso even if it is theoretically possible, non-interactive derivative key generation could have some serious security pitfalls on the path",
"sig": "f399a87e392fe0cce87eedbdf316962165b027d6721d18310bb3cc257f2f336df5c5f8f4ba082c92a362a5d157f0bd109e6483aa16f3dabd00ac48c551bca090"
}