Search content
Sort by
Showing 13 of 13 results by escope
04 Июня я сделал депозит BTC.
Положил в lending 05 Июня.
Ну далее вы в курсе.
Выиграл в лотерею, только наоборот.
В тикетах стандартно посылают.
Заполнил форму в SEC. Полагаю, бесполезно, но хотя бы попытался..
В общем отжали битки по-черному. К Гопстопу больше солидарности.
Положил в lending 05 Июня.
Ну далее вы в курсе.
Выиграл в лотерею, только наоборот.
В тикетах стандартно посылают.
Заполнил форму в SEC. Полагаю, бесполезно, но хотя бы попытался..
В общем отжали битки по-черному. К Гопстопу больше солидарности.
Nice work 
As you seem to be familiar with the code, if you want to implement the regexp, fell free to send pull request
Thank you. I would be very happy to do this. But I'm not able do more than few edits =DAs you seem to be familiar with the code, if you want to implement the regexp, fell free to send pull request
with only capital letters apart from a single digit
I did an exception for char "1" in a codeaddresses vanities looking for numbers .... after more than 24h still nothing :-(
I think it's impossible on regular GPU for next yearswow, can you share what is the correct command to get all the uppercase letters address?
Well I just added more symbols to wildcard match function in Wildcard.cpp/GPUWildcard.h for finding exact patterns I want.
It's very easy to do. I shared my one https://github.com/skipper70/VanitySearch
I guess it's not a good way to go for production because we should write own regex on next steps =D
Finally I've found the perfect vanity for me!
https://www.blockchain.com/btc/address/1EKKKKLVMLHUUTSXMWGSBQGPATSBDCEEVH
It took ~one full day with 15MK/s
Huge thank you senior Jean_Luc
Also now I have a lot of pleasant addresses with only one number inside
https://www.blockchain.com/btc/address/1EKKKKLVMLHUUTSXMWGSBQGPATSBDCEEVH
It took ~one full day with 15MK/s
Huge thank you senior Jean_Luc
Also now I have a lot of pleasant addresses with only one number inside
Thanks
Could you try: VanitySearch.exe -t 0 -g 16 -gpu 1*1111
I think I've found something.Could you try: VanitySearch.exe -t 0 -g 16 -gpu 1*1111
Suddenly yesterday wildcard started to work well.
Speed 15MK/s is 5-6x slower than normal search which is perfect anyway.
During the time later the program behavior was going by random way. And I've closed firefox. Started to work well again.
In general I guess you could try debug the program in difficult memory conditions.
Thank you.
Hope to find solution for issue with my GPU. Feel free to contact. I will do everything what I can.
Hope to find solution for issue with my GPU. Feel free to contact. I will do everything what I can.
Could you give me the output of command that generate the performance/hanging problem ?
Just any command for wildcard search (* or ? symbols) with -gpu flag. I'm not even sure if the GPU works comparing to 100MK/s in normal mode. The OS is very lagging/hanging at the same time. GTX 750, Win10 and CUDA 10.1.
Quote
>VanitySearch.exe -gpu 1*1111
VanitySearch v1.14
Search: 1*1111 [Compressed]
Start Wed May 15 00:36:03 2019
Base Key: E5E821A5AD352A32F1C86A035864BABAEE2885031ED23CF77F267B63CEF0A5A0
Number of CPU thread: 7
GPU: GPU #0 GeForce GTX 750 (4x128 cores) Grid(32x128)
2.043 MK/s (GPU 0.000 MK/s) (2^24.30) [1]
VanitySearch v1.14
Search: 1*1111 [Compressed]
Start Wed May 15 00:36:03 2019
Base Key: E5E821A5AD352A32F1C86A035864BABAEE2885031ED23CF77F267B63CEF0A5A0
Number of CPU thread: 7
GPU: GPU #0 GeForce GTX 750 (4x128 cores) Grid(32x128)
2.043 MK/s (GPU 0.000 MK/s) (2^24.30) [1]
Hi there,
Yes new release is coming but still in dev, I added:
- Case unsensitive search (should run at almost nominal speed)
- Wildcard search (on my hardware ~5 times slower on CPU and GPU compare to single prefix search, mainly due to slow base58 and double sha checksum that have to be computed each time) Still need tests and improvements...
- Crypto Secure RNG for default seed
Yes new release is coming but still in dev, I added:
- Case unsensitive search (should run at almost nominal speed)
- Wildcard search (on my hardware ~5 times slower on CPU and GPU compare to single prefix search, mainly due to slow base58 and double sha checksum that have to be computed each time) Still need tests and improvements...
- Crypto Secure RNG for default seed
Thank you.
Hope to find solution for issue with my GPU. Feel free to contact. I will do everything what I can.
However I'm happy already. I can generate quickly a lot of suchlike addresses by VanitySearch (on CPU).
Pub Addr: 1333Q4HANHJM6G6XRGB4HV15LCGSUU93YM
Pub Addr: 1C27MV3VUKHR4FB9V3TXZ3PRRAJR3PCACM
Pub Addr: 1KWF2ZH7D3X7MMWWR56XV347TA9CKRD4CW
There are new commits on github.
It is huge work has done there.
Thank you a lot.
I am testing wildcard search now.
It is 10x slower on my CPU.
And 100x slower on GPU with hanging system.
Guess something wrong there.
It is huge work has done there.
Thank you a lot.
I am testing wildcard search now.
It is 10x slower on my CPU.
And 100x slower on GPU with hanging system.
Guess something wrong there.
Wildcard search is between 4 and 5 times slower than classic search for known prefixes. I reach ~40MK/s with my 1050 Ti and ~4MK/s with my i7-4770.
It is due to the fact that I have to compute full address each time and it requires 2 SHA for the checksum and a base58 encoding. For the CPU release, I implemented SSE checksum and I will try to implement SSE Base58 encoding using Barret's reduction (for computing div and mod 58).
Thank you very very much! I am really looking forward to a new commit.It is due to the fact that I have to compute full address each time and it requires 2 SHA for the checksum and a base58 encoding. For the CPU release, I implemented SSE checksum and I will try to implement SSE Base58 encoding using Barret's reduction (for computing div and mod 58).
Has anyone put together (or started to put together) a list of CPUs / Video Cards & the speed you can get out of them.
Anything else?
GPU: GPU #0 GeForce GTX 750 (4x128 cores) Grid(32x128)Anything else?
104.960 MK/s (GPU 94.405 MK/s) (2^32.12)
GPU: GPU #0 GeForce RTX 2070 (36x64 cores) Grid(288x128)
1535.880 MK/s (GPU 1470.257 MK/s)
Oh my take my money I want buy that now1535.880 MK/s (GPU 1470.257 MK/s)
I dont believe anything is stopping you from doing this now.
I can. But I guess it is possible by slow CPU regexp in slow Vanitygen only.Please if you know something lmk about that
⭐ Merited by DarkStar_ (4)
Hi there
Some news:
- The case insensitive search is ready and working well at almost nominal speed.
- For the search with wildcard, the speed is still very low, in that case I have to calculate the full base58 address for each generated point and the base58 is very slow, so I'm trying to implement this at the GPU level.
- I will also add an encryption mechanism for the output file and think to a manner to have a safe command line.
Some news:
- The case insensitive search is ready and working well at almost nominal speed.
- For the search with wildcard, the speed is still very low, in that case I have to calculate the full base58 address for each generated point and the base58 is very slow, so I'm trying to implement this at the GPU level.
- I will also add an encryption mechanism for the output file and think to a manner to have a safe command line.
Awesome!
Hope to see all upper-case or all lower-case search. Also hope to see regexp search for finding whatever want.
I am not an expert but I guess there are some algos for base64 encoding/decoding on GPU:
https://www.codeproject.com/Articles/276993/Base64-Encoding-on-a-GPU
https://lemire.me/blog/2018/01/17/ridiculously-fast-base64-encoding-and-decoding/
Also there are several fast GPU regexp:
https://madhumithasridhara.github.io/QuickMatch/
Hello, @Jean_Luc!
First of all I want to say a big thank you for the amazing project you are developing. Just a huge pleasure to use it.
Had you been thinking about expanding pattern abilities? Search for a word at the end of an address or inside an address? What do you think about the implementation of regular expressions?
I know regex in vanitygen working with CPU only. I don't know if this is possible but I think it would be just awesome to see something like a hybrid algo for finding regex patterns faster.
Thank you!
First of all I want to say a big thank you for the amazing project you are developing. Just a huge pleasure to use it.
Had you been thinking about expanding pattern abilities? Search for a word at the end of an address or inside an address? What do you think about the implementation of regular expressions?
I know regex in vanitygen working with CPU only. I don't know if this is possible but I think it would be just awesome to see something like a hybrid algo for finding regex patterns faster.
Thank you!
Re: [ANN][MIN] Minerals - POS. Fair Distribution. E-SPORTS BETTING TEST WENT LIVE!
Hey guys!
Thank you for every advice here.
At start I invested less then 0.1btc to MIN
I was just selling on lows and buying on tops.
Before falling I sold everything. It was predictible here.
Now I bought 12k+ MIN
Thank you.
Thank you for every advice here.
At start I invested less then 0.1btc to MIN
I was just selling on lows and buying on tops.
Before falling I sold everything. It was predictible here.
Now I bought 12k+ MIN
Thank you.