alex0jsan

Uncle Alex.

Pardon me if I don't respond.

GPG: EC1C 2018 3EB2 47DC CE46 8D99 A1D9 A066 5F95 4E3E

Last Notes

2024-09-15 16:42:38 UTC

- reply

Yeah. alex0jsan stands for alex-ojisan, which means uncle alex. It's all deliberate.
On an older intel laptop with igpu, a 5 character prefix takes < 30 seconds using noclvag. I did several runs. Using rana, it took around 5 minutes for one run and around 30 minutes for another.

2024-09-15 14:13:12 UTC

- reply

It was a bit difficult to upload the code to a git forge over tor, but I managed to do it a few days ago. You can find it at https://codeberg.org/alex0jsan/noclvag
Let me know what you think.

2024-09-15 14:10:43 UTC

- reply

Thank you. Will do! 😃

2024-09-15 14:09:45 UTC

- reply

Thank you. 😄

2024-09-15 06:47:03 UTC

Hello. I'm Alex. I should have introduced myself earlier, I guess.
I wish for a better world. I try to write code. I came across nostr and thought I can help. So here I am.
You can find my code here: https://codeberg.org/alex0jsan
Right now there's only one project in there, but I hope to have more in the future.
#introductions #devstr

2024-09-08 05:50:36 UTC

- reply

What about new joiners?

2024-09-07 07:19:41 UTC

- reply

I managed to upload noclvag to a git forge. You can find it at https://codeberg.org/alex0jsan/noclvag
Please take a look and let me know what you think.

2024-09-07 07:15:31 UTC

- reply

Hello again, Nostr.
I managed to upload noclvag to a git forge. You can find it at https://codeberg.org/alex0jsan/noclvag
Please give it a try and let me know what you think.
#nevent1q…0rn4

2024-09-06 18:03:01 UTC

- reply

Thanks! I'll take a look.

2024-09-03 16:52:38 UTC

- reply

Totally. Would love some feedback on this. Not my area of expertise.
The file mentioned in the announcement note is actually the source code. No binaries there.
I couldn't find a way to upload the source code to a git forge over Tor without KYC, email, etc. If you know a way, let me know.

2024-09-03 16:30:07 UTC

- reply

Any thought on the split-key method? Would it make it more or less secure?
It's described here: https://github.com/JeanLucPons/VanitySearch

2024-09-03 16:26:20 UTC

- reply

There's something that might help. It's called the split-key method. No idea if it's safe. It's used in VanitySearch: https://github.com/JeanLucPons/VanitySearch
I used that in a vanity npub generator I put together. I call it noclvag. You can find it here: https://njump.me/nevent1qyt8wumn8ghj7ct4w35zumn0wd68yvfwvdhk6tcpr4mhxue69uhhyetvv9ujumt4w35ku7thv9kxcet59e3k7mf0qy88wumn8ghj7mn0wvhxcmmv9uq3zamnwvaz7tmwdaehgu3wwa5kuef0qyg8wumn8ghj7mn0wd68ytnddakj7qg4waehxw309aex2mrp0yhxgctdw4eju6t09uq35amnwvaz7tmzdaehgu3wd3jkxar4wf5kv7fwdejhgtcpr9mhxue69uhhyetvv9ujuumwdae8gtnnda3kjctv9uqzqd6mt9jq60s34za2zkmrshtv6srjsswjd2hk4f5q9act54qunge77nxq9p

2024-09-03 16:10:18 UTC

- reply

I think I can help speed that up significantly.
I put together something that uses OpenCL on GPU, instead of CPU. I call it noclvag. I used it to find my npub, which took a few days. My npub's prefix is alex0jsan, which is 45 bits. It was searching at a few hundred million iterations per second.
You can find more details in this note: https://njump.me/nevent1qyt8wumn8ghj7ct4w35zumn0wd68yvfwvdhk6tcpr4mhxue69uhhyetvv9ujumt4w35ku7thv9kxcet59e3k7mf0qy88wumn8ghj7mn0wvhxcmmv9uq3zamnwvaz7tmwdaehgu3wwa5kuef0qyg8wumn8ghj7mn0wd68ytnddakj7qg4waehxw309aex2mrp0yhxgctdw4eju6t09uq35amnwvaz7tmzdaehgu3wd3jkxar4wf5kv7fwdejhgtcpr9mhxue69uhhyetvv9ujuumwdae8gtnnda3kjctv9uqzqd6mt9jq60s34za2zkmrshtv6srjsswjd2hk4f5q9act54qunge77nxq9p

2024-08-20 04:50:37 UTC

Greetings, Nostr!
Announcing noclvag, Nostr OpenCL Vanity Address Generator.
It's something I put together that uses OpenCL on GPU, instead of CPU, to search for npubs with a specific prefix. I used it to find my npub (npub1alex0jsan...). Much faster than CPU, in my case.
It's rough and probably has a bunch of bugs, but it seems to work. It's based on vanitygen-plusplus.
It's AGPL3+ licensed. I didn't upload it anywhere else. Feel free to upload it somewhere easy to access. The link below should last for around 90 days. I would have uploaded it myself, but I'm not aware of git forges that work over Tor and without email, etc.
noclvag uses the the split-key method described in VanitySearch to allow the user to ask a 3rd party to search for an npub for them without compromising their final nsec. I think it would be great if support for this is built into nsec bunkers (like Amber), and maybe some mining services can be spun up to make vanity npubs accessible to users.
A word of caution. This is generally not my field of expertise. Consider the software experimental.
The source code is here: https://oshi.at/BrkV/noclvag-v0.1.tar.gz
SHA256SUM: 989a0ca86297b4137a95c28a40fdabc2d736d8e91ffc26f27cf6c12039407f32 noclvag-v0.1.tar.gz
Tagging a few people since I have no follows.
@nprofile…5c2r @nprofile…2fgv @nprofile…las7 @nprofile…d6yu

2024-08-19 14:11:26 UTC

- reply

I think I can help.
I put together something that uses OpenCL on GPU, instead of CPU. I used it to find my npub. Much faster, in my case.
It's rough and probably has a bunch of bugs, but it seems to work. I call it noclvag, Nostr OpenCL Vanity Address Generator. It's based on vanitygen-plusplus.
It's AGPL3+ licensed. I didn't upload it anywhere else. Feel free to upload it somewhere easy to access. The link below should last for 90 days. I would have uploaded it myself, but I'm not aware of git forges that work over Tor and without email, etc.
The source code is here: https://oshi.at/BrkV/noclvag-v0.1.tar.gz
SHA256SUM: 989a0ca86297b4137a95c28a40fdabc2d736d8e91ffc26f27cf6c12039407f32 noclvag-v0.1.tar.gz