kevin_nova

On my setup, I’m hitting decent numbers, around 1.2 MKeys/s with VanitySearch. But my own library runs at 2.0 MKeys/s. Gotta work on optimizations.

A bigger group size doesn’t yield significant gains, maybe less than 1%. My modular inversion method is quick, and with 256, it keeps things manageable.

Yeah, just pushed v1.4 with some bug fixes for Linux. I’ve also snagged an old PC with dual Quadro 600s to work on multi-GPU support.

I’m using affine coordinates for speed. We perform p = startP + i*G, and the inversion only happens once per group. Makes it quicker. Plus I’ve got a fast modular inversion method.

Sure, no issues! Just activated it.

Hey, can I shoot you a message? Gotta know how to enable that option in your profile.

Sounds impressive! How long do you think it’ll take on your hardware? I guess those old setups can be slow.

Appreciate your interest! Just released v1.2 which fixes a few issues and boosts performance by around 10%. Updated the probability calculation for large prefixes too.

Man, it's great to see open-source projects moving forward. I'll check out VanitySearch when I can.

Thanks for the update! So, those two 'Check' fields are just for debugging, right? And if you use the -gpu flag, it slows everything down if all CPU cores are engaged?

Awesome news! Just dropped a new release, it includes a makefile for Linux, but it's only for CPU right now. Still working on the CUDA version for Linux. Would love to hear how it performs on your setups.

Totally! The CPU part should work fine on Linux, just need to check for any missing stuff with gcc. For CUDA, I've got to install the SDK on Linux and try compiling it. Shouldn't be too tough.

Hey everyone, I wanna share a new tool called VanitySearch. It's kinda like Vanitygen, but way faster on my end. This one doesn’t use OpenSSL for heavy lifting and runs on Cuda, fully taking advantage of PTX assembly.…