Bitcoin Forum

Bitcoin => Project Development => Topic started by: holy_ship on March 11, 2018, 06:05:02 AM



Title: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: holy_ship on March 11, 2018, 06:05:02 AM
Hey!

OK, deleting initial post. Fork is already done, and freely available.

https://github.com/ndv/vanitygen

But there's plenty of opportunities to make it faster (for extra bucks).

If you want to make it better, contact this programmer.

......


If you like LBC and its Remote Exec Feature do not read any more.

1.
LBC itself has a BIG problem - it is heavily CPU bound.
A classic mining rig with 4-6 GPUs is almost useless with it.
Most of GPUs will be underutilized.
By contrast oclvanitygen even now uses 100% of GPU. After moving ALL processing to GPU it will be super scalable.

2.
LBC users have a BUNCH of problems - your hardware is not utilized, you do not know what addresses are in bloom filter, you do not know what Rico executes on your PC, you cannot be sure that you are actually not making doublecheck after other LBC users, you cannot be 100% sure the whole LBC is not scam. Isn't that enough?



Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Jude Austin on March 12, 2018, 02:12:40 PM
Hey!

In short: looking for a couple of guys willing to fund Faster and Autonomous Large Bitcoin Collider fork.

If you like LBC and its Remote Exec Feature do not read any more.

If you do not mind to spend $1100 alone, actually you do not need me, go to upwork.com and find a freelancer.

OK, if you are still here, I'll explain.

1.
LBC itself has a BIG problem - it is heavily CPU bound.
A classic mining rig with 4-6 GPUs is almost useless with it.
Most of GPUs will be underutilized.
By contrast oclvanitygen even now uses 100% of GPU. After moving ALL processing to GPU it will be super scalable.

2.
LBC users have a BUNCH of problems - your hardware is not utilized, you do not know what addresses are in bloom filter, you do not know what Rico executes on your PC, you cannot be sure that you are actually not making doublecheck after other LBC users, you cannot be 100% sure the whole LBC is not scam. Isn't that enough?

I've created a job on upwork and the freelancer is willing to complete it for $1100.
He's good at OpenCL and already made similar Eth projects.

He's going to rewrite oclvanitygen. Technical design specification is:

1. An option to read bitcoin addresses from a text file; addresses can be compressed and uncompressed;
2. Check the generated addresses against the set and return a match if found;
3. Periodically output the current private key to a file;
4. An option to pass the private key to start with;
5. Optimize the computation of the public address by doing all cryptography-related computations on GPU (do not pass any pre-computed data to the OpenCL kernels);
6. Remove saving hashes to the GPU's memory; check the addresses immediately;
7. Batched inversion is done in local memory (right now it's in global GPU memory)

I want to split this $1100 to 2-3 persons. Everyone will get sources and binary.
I hope we will come to gentlemen agreement and will divide ranges to three parts.

I mean, for example 56 bounty is from 72057594037927936 to 144115188075855872.
One takes the first third, second the middle, third - the last.

And of course I hope the sources and binary version would not go to public.


Why does that seem super cheap?


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on March 12, 2018, 03:19:05 PM
Why does that seem super cheap?

Thanks for commenting :)

Cheap - you mean I offer some scam?
Or cheap for a programmer to work for a week and earn $1k ?

For me $1k is a close to month's salary (programmer too).


The best option would be for LBC community to gather and to spend 5-10 bucks each. But surprisingly nobody give's a fsck.

As time goes by, I'm more convinced that current LBC's goal is to PREVENT effective brute forcing of Bitcoin address space.  ;D


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Jude Austin on March 12, 2018, 03:59:46 PM
Why does that seem super cheap?

Thanks for commenting :)

Cheap - you mean I offer some scam?
Or cheap for a programmer to work for a week and earn $1k ?

For me $1k is a close to month's salary (programmer too).


The best option would be for LBC community to gather and to spend 5-10 bucks each. But surprisingly nobody give's a fsck.

As time goes by, I'm more convinced that current LBC's goal is to PREVENT effective brute forcing of Bitcoin address space.  ;D

No problem.

Cheap as in cost of work.

And I understand where people are coming from:

1. They are invested in the very thing you are trying to "break."
B. They believe it's a waste of time due to the exponential expansion of the search space.

You're pretty much walking into a bank and asking the teller to buy you a gun to rob said bank, lol.

Thanks,
Jude




Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on March 13, 2018, 02:27:26 AM
Wut? Sooo strange conclusions you've made.

For EVERY LBC member speeding up the entire LBC is good, because we could collect bounties a bit faster. That's especially true for glatzer and other maniacs with dedicated rigs.

But if the mass is too hesitatory, then it is even better for smaller group, who will get an advantage for themselves.



Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: GamerSky on March 13, 2018, 04:33:53 AM
No problem.

Cheap as in cost of work.

And I understand where people are coming from:

1. They are invested in the very thing you are trying to "break."
B. They believe it's a waste of time due to the exponential expansion of the search space.

You're pretty much walking into a bank and asking the teller to buy you a gun to rob said bank, lol.

Thanks,
Jude

I wouldn't call that cheap without knowing the developer's origin, that 1k$ could be worth 6 months salary in some countries.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Jude Austin on March 13, 2018, 05:03:01 AM
No problem.

Cheap as in cost of work.

And I understand where people are coming from:

1. They are invested in the very thing you are trying to "break."
B. They believe it's a waste of time due to the exponential expansion of the search space.

You're pretty much walking into a bank and asking the teller to buy you a gun to rob said bank, lol.

Thanks,
Jude

I wouldn't call that cheap without knowing the developer's origin, that 1k$ could be worth 6 months salary in some countries.

True, not trying to be inconsiderate or put anyone down.

I am just basing my assumption off of quotes I have seen for OpenCL work in the past.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on March 16, 2018, 02:07:02 AM
deal is done.  ;D


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Jude Austin on March 16, 2018, 02:17:07 AM
deal is done.  ;D

Nice, once you have working binary and source shoot me a PM.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on March 29, 2018, 10:08:49 AM
Partially done!

I've payed my $500 to the programmer who modified oclvanitygen for searching 32BTC bounty (or any other address actually)
All possible optimizations are NOT done, because he asked for $1100. But even now it is doing all the stuff on GPU.
Both compressed and uncompressed addresses.
Actually it is an disconnected version of LBC. Network access is not required at all. All code is opensource.
It is Nvidia optimized, but should run on ATI with about 10% penalty.
He claims that it runs in windows without crappy virtualization.

https://github.com/ndv/vanitygen (https://github.com/ndv/vanitygen)

On my gf1050ti it is almost twice SLOWER than LBC. But I'm really really interested in seeing benchmarks for large rigs, because CPU  is not bottleneck any more.

p.s. If someone wants further development, contact me or him directly. It can be split to parts, not only $600 or nothing.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on March 30, 2018, 05:30:07 PM
Testing done today. Now it successfully searches all previous bounty PKs.

Also some boost in speed - on 1050ti 17megakeys (LBC was 22mk).

Still very interested in benchmarks on high end cards. C'mon, dudz!


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on March 30, 2018, 05:37:49 PM
p.s. most of $500 went to rewriting launcher, but not OpenCL kernel.
Today he boosted the speed from 11.5megakeys to 17 in a couple of hours.  ;D

Says that ECC part should be rewritten properly, and many other things.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on April 16, 2018, 02:53:56 AM
Upgraded 1050ti to gtx1060 3GB.

On 1050ti: LBC had 22Mkeys, vg from ndv 16Mkeys.
On gtx1060: LBC dropped to 20Mkeys, vg from ndv 25Megakeys.  ;D

Cpu is core i7 3.7, with vg only one core is used.
GPU consumes 65W. GPU is 100% utilized, gpu mem is 7% utilized.

Still very interested in benchmarks on 1070 and 1080.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on April 17, 2018, 11:11:20 AM
Made more experiments.
Two cards do not interfere each other and work at 16+25 Megakeys in one PC.  ;D

Two CPU cores are used.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: geniusprodigy on April 27, 2018, 07:26:03 PM
How many gtx1060 cards will be needed to have the same speed as the entire LBC?


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: charlie137 on April 28, 2018, 06:39:25 AM
hope for sooner deployment, its time to refresh that thing!


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on April 29, 2018, 05:53:21 AM
I extracted a list of dormant addresses with 5++BTC and it is only 71.500 entries in it.
Dunno why LBC search for the dust (15mln wallets) :)

As for vanitygen - size affects search speed greatly. With 160 addresses of 32BTC puzzle it does 26MK per second, with 71k addresses 23MK.
If you switch to compressed addresses only - you will have almost twice more.
So, to beat LBC one needs around 30 pcs of 1060  ;D
OOPS! That was some anomaly with gtx1050ti when disabling uncompressed addresses gave 2X boost.
On my current gtx1070 it almost doesn't matter 47 vs 48 megakeys.

With 71k addresses gtx1070 gets 40 megakeys.

Test 1080ti please!


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on May 01, 2018, 02:22:33 PM
There's a limited proposal to rewrite a ECC part for only $250 because there's another guy who wants the same for Ethereum.
Normally he wanted about $500.
Predicts boost of 25-30%.

I'll take a pass this time.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: nc50lc on May 02, 2018, 07:26:16 AM
I extracted a list of dormant addresses with 5++BTC and it is only 71.500 entries in it.
Dunno why LBC search for the dust (15mln wallets) :)
Are you sure that those are dormant addresses?
Some are just in cold storage or paper wallets locked in a vault since 2010.

This is what the previous replies have told you: nobody would help you knowing that this can potentially hack their own private keys.

Haven't you found a key yet?


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on May 02, 2018, 02:49:13 PM
Are you sure that those are dormant addresses?
Some are just in cold storage or paper wallets locked in a vault since 2010.

This is what the previous replies have told you: nobody would help you knowing that this can potentially hack their own private keys.

I guess you haven't heard of 32BTC bounty.

Also you are mad if you really think that 100% of Bitcoins from 2009-2012 are paper wallets  ;D I guess 90% are LOST. Don't take the rest, I will not. Actually it's very easy to find rightful owner of wallet (if he still possesses the key).

"nobody would help you"

Don't say on behalf of nobody. Actually I myself have some BTC. So what?


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Sokolik4 on June 03, 2018, 03:21:43 PM
Who can popularly explain how to run it all on Windows?
I have installed - https://slproweb.com/products/Win32OpenSSL.html
And how to install this? - https://github.com/tpruvot/pthreads
I have 1080ti, I'll get the results of the test, if anyone will help start the program


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Sokolik4 on June 03, 2018, 04:12:04 PM
Who can popularly explain how to run it all on Windows?
I have installed - https://slproweb.com/products/Win32OpenSSL.html
And how to install this? - https://github.com/tpruvot/pthreads
I have 1080ti, I'll get the results of the test, if anyone will help start the program
http://images.vfl.ru/ii/1528042312/584eebae/21983016.png


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Andzhig on June 03, 2018, 05:34:08 PM
Much more interesting if someone had told how from hex wif get. And what line to put in oclvanitygen -f addresses.txt -o found.txt -k lastkey.txt 5KHon4xmV31t9dFSHzeN3KF3R1EvjnSRCuy5ZcVEL83NZXzsyeE, apparently KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjhHvuTMSDchRp5hktc. Or where it already sorts out LBC KwDiBf89QgGbjEhKnhXJuH7LrciVrZi300000000000000000... or simply KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3.

To run you need to create *.bat or *.cmd I'm starting up oclvanitygen.exe -D 0:0 -f addresses.txt -o found.txt -k lastkey.txt KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjhHvuTMSDchRp5hktc

I think for normal work should be enough Microsoft Visual C++ 2005-2008-2010-2012-2013-2017 Redistributable Package.

It's also interesting how to run 2 video cards or more in one application.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Sokolik4 on June 03, 2018, 05:44:10 PM
C:\Users\sokol\Desktop\32\vanitygen-master\oclvanitygen.exe -D 0: 0 -f C:\Users\sokol\Desktop\32\vanitygen-master\addresses.txt -o C:\Users\sokol\Desktop\32\vanitygen-master\found.txt -k C:\Users\sokol\Desktop\32\vanitygen-master\lastkey.txt KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjhHvuTMSDchRp5hktc
http://images.vfl.ru/ii/1528048032/656d809d/21984102.png



As a result, an error pops up. - This application can not be launched on your PC :-\
 

I have 2 pieces 1080ti, I would like to try)


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Sokolik4 on June 03, 2018, 06:01:18 PM
http://images.vfl.ru/ii/1528048539/0abdc6f6/21984191.png

Given that I used another version of the program a month ago - vanitygen64 and it worked.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Andzhig on June 03, 2018, 06:27:44 PM
Create in the folder with the files of the program where oclvanitygen.exe lies and the others, a text file, for example 123.txt, enter there  oclvanitygen.exe -D 0:0 -f addresses.txt -o found.txt -k lastkey.txt KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjhHvuTMSDchRp5hktc  and save, rename 123.txt to 123.cmd and run the file as administrator.


vanitygen64 this is for the processor. oclvanitygen for video card.

Coздaй в пaпкe пpoгpaммы, гдe лeжит oclvanitygen.exe, тeкcтoвoй фaйл, любoй, нaпpимep 123.txt в нeгo cкoпиpyй cтpoкy oclvanitygen.exe -D 0:0 -f addresses.txt -o found.txt -k lastkey.txt KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjhHvuTMSDchRp5hktc coxpaни, пepeимeнyй 123.txt в 123.cmd и зaпycти oт имeни aдминиcтpaтopa.



Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Sokolik4 on June 03, 2018, 06:49:41 PM
 :-[ :-[ :-[
http://images.vfl.ru/ii/1528051641/5d64ae54/21984843.png
http://images.vfl.ru/ii/1528051740/a1b0690f/21984867.png
You are Russian-speaking)?


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Andzhig on June 03, 2018, 07:00:25 PM
-D 0:0 not -D 0: 0

We already start to guess this, antivirus, privacy settings, etc...

Try to run standart vanitygen https://github.com/samr7/vanitygen/downloads

Cпикинг... нe пoнятнo пoчeмy пpocтo нeльзя cгeнepиpoвaть нaпpимep пocлeдниe 20 чиceл и иx импopтиpoвaть в тoт жe electrum (y кoгo кoмп пoтянeт)).

LBC бpyтфopcoм чтoли кoлбacит

AAAA
AAAB
AAAC
AAAD

AABA
AABB
AABC
AABD

"1   KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFU73sVHnoWn 1BgGZ9tcN4rm9KBzDn7KprQz87SZ26SAMH (1)"
"2   KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFU74sHUHy8S 1CUNEBjYrCn2y1SdiUMohaKUi4wpP326Lb (3)"
"3   KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFU76rnZwVdz 19ZewH8Kk1PDbSNdJ97FP4EiCjTRaZMZQA (7)"
"4   KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFU77MfhviY5 1EhqbyUMvvs7BfL8goY6qcPbD6YKfPqb7e (8)"
"5   KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFU7Dq8Au4Pv 1E6NuFjCi27W5zoXg8TRdcSRq84zJeBW3k (21)"
"6   KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFU7Tmu6qHxS 1PitScNLyp2HCygzadCh7FveTnfmpPbfp8 (49)"
"7   KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFU7hDgvu64y 1McVt1vMtCC7yn5b9wgX1833yCcLXzueeC (76)"
"8   KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFU8xvGK1zpm 1M92tSqNmQLYw33fuBvjmeadirh1ysMBxK (224)"
"9   KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFUB3vfDKcxZ 1CQFwcjw1dwhtkVWBttNLDtqL7ivBonGPV (467)"
"10 KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFUBTL67V6dE 1LeBZP5QCwwgXRtmVUvTVrraqPUokyLHqe (514)"
"11 KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFUGxXgtm63M 1PgQVLmst3Z314JrQn5TNiys8Hc38TcXJu (1155)"
"12 KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFUW5RtS2JN1 1DBaumZxUkM4qMQRt2LVWyFJq5kDtSZQot (2683)"
"13 KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFUspniiQZds 1Pie8JkxBT6MGPz9Nvi3fsPkr2D8q3GBc1 (5216)"
"14 KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFVfZyiN5iEG 1ErZWg5cFCe4Vw5BzgfzB74VNLaXEiEkhk (10544)"
"15 KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFY5iMZbuRxj 1QCbW9HWnwQWiQqVo5exhAnmfqKRrCRsvW (26867)"
"16 KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFbjHrFMWzJp 1BDyrQ6WoF8VN3g9SAS1iKZcPzFfnDVieY (51510)"
"17 KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFiHkRsp99uC 1HduPEXZRdG26SUT5Yk83mLkPyjnZuJ7Bm (95823)"
"18 KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFyWkjT5fywW 1GnNTmTVLZiqQfLbAdp9DVdicEnB5GoERE (198669)"
"19 KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rGP2jMrxCfX3 1NWmZRpHH4XSPwsW6dsS3nrNWfL1yrJj4w (357535)"
"20 KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rHfuE2Tg4nJW 1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum (863317)"
"21 KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rL6JJvw6XUry 14oFNXucftsHiUMY8uctg6N487riuyXs4h (1811764)"
"22 KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rP9Ja2dhtxoh 1CfZWK1QTQE3eS9qn61dQjV89KDjZzfNcv (3007503)"
"23 KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rVkthFNsQ6i7 1L2GM8eE7mJWLdo3HZS6su1832NX2txaac (5598802)"
"24 KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rtHyNcFoApRd 1rSnXMr63jdCuegJFuidJqWxUPV7AtUf7 (14428676)"
54  KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjhHvuTMSDchRp5hktc  мecяцa 3 нaзaд
55  ???

     KwDiBf89QgGbjEhKnhXJuH7LrciVrZi31x2x3x4x5x6x7x8x9x10x11x12x13x14x15x16x17x18x19x20= мнoгo гигaбaйт...
     KwDiBf89QgGbjEhKnhXJuH7LrciVrZi1x2x3x4x5x6x7x8x9x10x11x12x13x14x15x16x17x18x19x20x21...


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Sokolik4 on June 03, 2018, 07:19:24 PM
-D 0:0 not -D 0: 0

We already start to guess this, antivirus, privacy settings, etc...

Try to run standart vanitygen https://github.com/samr7/vanitygen/downloads


Error loading kernel file 'calc_addrs.cl': No such file or directory

but this file is in the directory


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Sokolik4 on June 03, 2018, 09:01:48 PM
-D 0:0 not -D 0: 0

We already start to guess this, antivirus, privacy settings, etc...

Try to run standart vanitygen https://github.com/samr7/vanitygen/downloads


Error loading kernel file 'calc_addrs.cl': No such file or directory

but this file is in the directory

This problem has overcome the standard vanitygen runs and works. but the version we need is not (
The problem is that even a simple file does not start. Even the --help command can not be specified


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Sokolik4 on June 04, 2018, 04:38:23 PM
Hey!

OK, deleting initial post. Fork is already done, and freely available.

https://github.com/ndv/vanitygen

But there's plenty of opportunities to make it faster (for extra bucks).

If you want to make it better, contact this programmer.

......


If you like LBC and its Remote Exec Feature do not read any more.

1.
LBC itself has a BIG problem - it is heavily CPU bound.
A classic mining rig with 4-6 GPUs is almost useless with it.
Most of GPUs will be underutilized.
By contrast oclvanitygen even now uses 100% of GPU. After moving ALL processing to GPU it will be super scalable.

2.
LBC users have a BUNCH of problems - your hardware is not utilized, you do not know what addresses are in bloom filter, you do not know what Rico executes on your PC, you cannot be sure that you are actually not making doublecheck after other LBC users, you cannot be 100% sure the whole LBC is not scam. Isn't that enough?


How do I run this program? Standard vanitygen works fine, and https://github.com/ndv/vanitygen does not work.
Windows 10 64 bit (


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: 3dkevin on June 05, 2018, 01:12:49 AM
it looks like this sh.. does not work
I tried on ubuntu and win7

strange stupid things in Makefile.Win64 like:
PTHREADS_DIR = d:\soft\pthreads\projects\vs14\build

how to run this sh..?


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Andzhig on June 05, 2018, 01:55:09 AM
At me it is launched (win 10 64) and like works. gtx460 1gb, r370 strix 4gb (both undervolting). But 55 key we do not know which already found. http://meson.ad-l.ink/7hgM68Lgt/image.png

As the program itself works with a new start, there is a constant generation of random values, or by some algorithm, the search starts at each new start from the same. or we can not turn it off for half a year))

If to him here this 24 to write the address KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rtHyNcFoApRd Here is a parsley gives

Address: 1L2GM8eE7mJWLdo3HZS6su1832NX2txaac
Privkey (hex): 556E52
Address: 1rSnXMr63jdCuegJFuidJqWxUPV7AtUf7
Privkey (hex): DC2A04
Address: 1McVt1vMtCC7yn5b9wgX1833yCcLXzueeC
Privkey (hex): 4C
Address: 1PitScNLyp2HCygzadCh7FveTnfmpPbfp8
Privkey (hex): 31
Address: 19ZewH8Kk1PDbSNdJ97FP4EiCjTRaZMZQA
Privkey (hex): 07
Address: 1EhqbyUMvvs7BfL8goY6qcPbD6YKfPqb7e
Privkey (hex): 08
Address: 1M92tSqNmQLYw33fuBvjmeadirh1ysMBxK
Privkey (hex): E0
Address: 1E6NuFjCi27W5zoXg8TRdcSRq84zJeBW3k
Privkey (hex): 15
Address: 1CQFwcjw1dwhtkVWBttNLDtqL7ivBonGPV
Privkey (hex): 01D3
Address: 1PgQVLmst3Z314JrQn5TNiys8Hc38TcXJu
Privkey (hex): 0483
Address: 1BgGZ9tcN4rm9KBzDn7KprQz87SZ26SAMH
Privkey (hex): 01
Address: 1CUNEBjYrCn2y1SdiUMohaKUi4wpP326Lb
Privkey (hex): 03
Address: 1LeBZP5QCwwgXRtmVUvTVrraqPUokyLHqe
Privkey (hex): 0202
Address: 1HduPEXZRdG26SUT5Yk83mLkPyjnZuJ7Bm
Privkey (hex): 01764F
Address: 1BDyrQ6WoF8VN3g9SAS1iKZcPzFfnDVieY
Privkey (hex): C936
Address: 1DBaumZxUkM4qMQRt2LVWyFJq5kDtSZQot
Privkey (hex): 0A7B
Address: 1HsMJxNiV7TLxmoF6uJNkydxPFDog4NQum
Privkey (hex): 0D2C55
Address: 1ErZWg5cFCe4Vw5BzgfzB74VNLaXEiEkhk
Privkey (hex): 2930
Address: 1NWmZRpHH4XSPwsW6dsS3nrNWfL1yrJj4w
Privkey (hex): 05749F
Address: 1GnNTmTVLZiqQfLbAdp9DVdicEnB5GoERE
Privkey (hex): 03080D
Address: 1QCbW9HWnwQWiQqVo5exhAnmfqKRrCRsvW
Privkey (hex): 68F3
Address: 1Pie8JkxBT6MGPz9Nvi3fsPkr2D8q3GBc1
Privkey (hex): 1460
Address: 1CfZWK1QTQE3eS9qn61dQjV89KDjZzfNcv
Privkey (hex): 2DE40F
Address: 14oFNXucftsHiUMY8uctg6N487riuyXs4h
Privkey (hex): 1BA534


already found to delete that it is necessary from addresses.txt? or it is possible in the list, 2 addresses of any leave.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: userghost on June 07, 2018, 02:23:28 AM
So is this actually working? I can do the vanity gen, but cant seem to get this to work on windows


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: andreyyv on June 07, 2018, 11:53:07 AM
yes, it`s working


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on June 07, 2018, 01:49:04 PM
Coкoлик, a пoвтopяющaяcя фpaзa "oткaзaнo в дocтyпe" нe cмyщaeт? :)

To the question of windows10 - Windows users are born to suffer :D
Try admin privileges, if all required apps are installed, path variable. And it makes sense to compile proggie by yourself.


You can specify starting key in HEX, not WIF key.
In linux there's a nice util bc.

As puzzle55 is already found, going for p56.

echo 'ibase=10; obase=16; 2^56 ' | bc
100000000000000
[go@russian /]# echo 'ibase=10; obase=16; 2^55 ' | bc
80000000000000

puzzle 56 is between
80000000000000 and 100000000000000 (that's HEX!)

vanitygen searches DOWN. So you can start from 100000000000000, but actually I've checked several days from the very end.
It is better to pick some random number, like 65. We'll go to 65% of p56 range. That is

echo 'ibase=10; (2^55) + (2^55*65/100) ' | bc
59447515081290547 (in decimal)

and

echo 'ibase=10; obase=16; (2^55) + (2^55*65/100) ' | bc
D3333333333333 (in HEX)




Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on June 07, 2018, 04:37:01 PM
> I'll get the results of the test, if anyone will help start the program

I personally do not need tests any more.

I've bought 1050, 1060 and 1070. The speed is strictly proportional to price. With 1070 I have around 45MegaKeys. So 1080ti will be 55-70MK.

Oh, and finally some math:

2^55/45000000/86400/365=25.4

with one gtx1070 it will take 25.4 years to find puzzle56.

puzzle57 - 50 years

p.s. If you search for say 70k beefiest wallets, that is
815437248150114052278668908511886675023028061025637774925757633858543166/45000000/86400/365=574607678103412010456246764552600678605775453115760312676 years to find first

good luck ;D




Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Sokolik4 on June 07, 2018, 04:45:26 PM
In general, how to start it, and did not understand (

standard vanitygen + 2*1080ti
http://images.vfl.ru/ii/1528132859/54427f33/21998079.png
(2*56-2*55)/200000000/60/60/24=2084 days?


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: userghost on June 07, 2018, 08:29:36 PM
Here is a list of address's. But I cant get it to work inside the program. How do either A) change the limit inside of the program to a higher range than only 33 or 34 characters, or is there any fast way to edit this list to only 33-34 characters?

https://raw.githubusercontent.com/userghost123/BTC-Address-6-7-18/master/README.md


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on June 08, 2018, 03:00:50 AM
Quote from: Sokolik4
standard vanitygen

This thread is not about standard vanitygen

Quote from: Sokolik4
(2*56-2*55)/200000000/60/60/24=2084 days?

Yes, around 6 years at 200MegaKeys. But vanitygen from ndv is slower. And another parties are also doing the same work, so
a. puzzle56 will be found earlier
b. you'll need luck


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Andzhig on June 08, 2018, 03:49:43 AM
Here is a list of address's. But I cant get it to work inside the program. How do either A) change the limit inside of the program to a higher range than only 33 or 34 characters, or is there any fast way to edit this list to only 33-34 characters?

https://raw.githubusercontent.com/userghost123/BTC-Address-6-7-18/master/README.md
Sometimes this is buggy (?), You can try to replace it with copy by one address by replacing the already written. Was going to hunt millions of Satoshi? why would not he still be a deceased person (?).

***

Is it the last hex that automatically picks up from lastkey.txt or does it have to be added manually from there? Does the entire address list check the specified or the first one from the list?


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Sokolik4 on June 08, 2018, 12:35:10 PM
Upload somebody to the topic of the compiled file :-\


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Andzhig on June 09, 2018, 04:27:37 PM
The program exactly works correctly?

Let's start with the address 0000000000000000000000000000000000000000000000000000000000000001 (hex 01) he finds it for us KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFU73sVHnoWn.

but what kind of bulkhead does it do after from the updated lastkey.txt

KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFU73sVHnoWn 1
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7xi8un3t62wBb
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M85dZv9TJssePg
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M8AUa2CqP9oedm
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M8EdRppsqMADSs
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M8JYuXdodLgKyv
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M8LriXkwQ9iWRv
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M8PPudhBmA42fj

FU7 has already flown or has not reached yet?

KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFU74sHUHy8S 3
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFU76rnZwVdz 7
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFU77MfhviY5 8
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFU7Dq8Au4Pv 21



Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on June 10, 2018, 05:36:15 PM
I do not understand what exactly you complain about.
VG from NDV goes DOWN - in opposite direction to LBC.

If you want to check it, pick for example 17E6C640 hex and it should
find first 29 bounties in several seconds (on GPU like 1070).


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Andzhig on June 10, 2018, 06:40:33 PM
That is he is walking the other way. And when we give him 54 he to 53 begins to stamp (and not to 55, 56), ok. I was looking for a few days in another direction.

Quote
If you want to check it
Yeah i already checked wrote about this.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Sokolik4 on June 10, 2018, 06:55:38 PM
That is he is walking the other way. And when we give him 54 he to 53 begins to stamp (and not to 55, 56), ok. I was looking for a few days in another direction.

Quote
If you want to check it
Yeah i already checked wrote about this.
Good day. I understand it is necessary to compile the files from here - https://github.com/ndv/vanitygen
Can you leave a link to an already compiled and ready to run program?


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Andzhig on June 10, 2018, 09:05:04 PM
That is he is walking the other way. And when we give him 54 he to 53 begins to stamp (and not to 55, 56), ok. I was looking for a few days in another direction.

Quote
If you want to check it
Yeah i already checked wrote about this.
Good day. I understand it is necessary to compile the files from here - https://github.com/ndv/vanitygen
Can you leave a link to an already compiled and ready to run program?
So you already downloaded it from there, there already exe is oclvanitygen.exe https://github.com/ndv/vanitygen  green button "clone or download".



Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Sokolik4 on June 11, 2018, 03:51:34 PM
That is he is walking the other way. And when we give him 54 he to 53 begins to stamp (and not to 55, 56), ok. I was looking for a few days in another direction.

Quote
If you want to check it
Yeah i already checked wrote about this.
Good day. I understand it is necessary to compile the files from here - https://github.com/ndv/vanitygen
Can you leave a link to an already compiled and ready to run program?
So you already downloaded it from there, there already exe is oclvanitygen.exe https://github.com/ndv/vanitygen  green button "clone or download".


Well, yes, I downloaded it, only it does not start on Windows 10 64 bit)


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Andzhig on June 11, 2018, 07:22:34 PM
and the 55 winner iiis https://bitcointalk.org/index.php?topic=1306983.msg39808009#msg39808009 some Spaniard Portuguese Gespani

55
KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjidyYKE5NcJQZYvknA
000000000000000000000000000000000000000000000000006ABE1F9B67E114
https://lbc.cryptoguru.org/dio/234729613217731



Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Sokolik4 on June 15, 2018, 08:33:31 AM
In general, the script downloaded again and it started. Magic pancake. But I can not run 2 video cards in 1 window. Only 2 copies of the program are allowed to run, one for each video card.
The command does not work.
-D 1:1 -D 1:0


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: darito21 on June 19, 2018, 08:40:25 PM
Hi
Im trying to make it run in a fresh ubuntu 14 vps without luck!
I get lot of errors after compile

Any input here?
I was able tu successfully run the standard vanitygen version, but no way with this one.
I have installed all necessary dependences too.

Is anyone running it in an ubuntu 14 machine?
Thanks


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on June 20, 2018, 08:31:54 AM
VPS ?  ;D


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: darito21 on June 20, 2018, 01:34:53 PM
VPS ?  ;D

 ;D
Just for testing, I create an ubuntu virtualbox server from scratch with 16gb of ram and 8threads just to install and test, because if something goes wrong with dependencies then I just clone the original "fresh" setup and start again.
I was able to successfully run some modified versions of Vanitygen but not luck with this.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on June 22, 2018, 08:13:07 AM
>run some modified versions of Vanitygen but not luck with this

Maybe it's a bit confusing, but NDV didn't do any mods to vanitygen. Only oclvanitygen.

Only weakminded do LBC on CPU, as even with good GPU with 50-100MKeys one needs several years to check puzzle56 range. And gazillion years to find any real wallet.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: sensimilia on July 11, 2018, 02:12:18 PM
Getting something better without any benefit is a hard thing. People want to have real money if you need something from them. And one more thing about contacting, it can be better to give some link.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Yahkinator on July 25, 2018, 04:35:32 PM
Hello,
I have it up and running, but want to test that it is working correctly.

I run

oclvanitygen -f addresses.txt -o found.txt -k lastkey.txt 000000000000000000000000000000000000000000000000000006bd3b27c500

and would expect it to find the private key to 1PiFuqGpG8yGM5v6rNHWS3TjsG6awgEGA1 almost immediately since the private key is 6bd3b27c591.

It doesn't.  It blows past that private key without logging anything.

It is likely I'm doing something wrong, but I can't see the trees from the forest right now.  Can you advise?

Thanks!


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Andzhig on July 25, 2018, 07:41:18 PM
he goes the other way from bigger to smaller. take that 000000000000000000000000000000000000000000000000000006bd3b27c800.

to start multiple cards you can create cmd file bablabla.cmd
Quote
@echo off

cd "C:\Users\***\Desktop\your program folder"
start oclvanitygen.exe -D 0:0 -f addresses.txt -o found.txt -k lastkey.txt 000000000000000000000000bcab2d0d6efd742d4526094aca3b2bafa0315dc9

cd "C:\Users\***\Desktop\your program folder"
start oclvanitygen.exe -D 1:0 -f addresses.txt -o found.txt -k lastkey.txt 000000000000000000000000e66dd7d60bea90d43de86c199cd2d2a7ab82cd82

exit

so that the window turns off after start /min can add.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Yahkinator on July 25, 2018, 08:37:40 PM
he goes the other way from bigger to smaller. take that 000000000000000000000000000000000000000000000000000006bd3b27c800.


Still doesn't find it.  This mean anything to you?

oclvanitygen -v -f addresses.txt -o found.txt -k lastkey.txt 000000000000000000000000000000000000000000000000000006bd3b27c800
Start with 000000000000000000000000000000000000000000000000000006bd3b27c800
Searching for 160 addresses
Device: Intel(R) HD Graphics 4600
Vendor: Intel(R) Corporation (8086)
Driver: 20.19.15.4531
Profile: FULL_PROFILE
Version: OpenCL 1.2
Max compute units: 20
Max workgroup size: 512
Global memory: 1708759450
Max allocation: 427189862
OpenCL compiler flags: -DDEEP_PREPROC_UNROLL -DLOCAL_MEM_SIZE=65520
Loading kernel binary a278d6da1e690bf2f16f62f7f94db316.oclbin
allocsize=427189862, memsize=1708759450
Grid size: 1280x2048
Modular inverse: 10240 threads, 256 ops each
Bitmap size (bytes): 427189862

Start a thread81920/131072

Copy 1280 sequential points to the device
Copy the row stride array to the device
Move the row increments forward
Copy 1280 sequential points to the device
[1.52 Mkey/s][total 2621440]
Move the row increments forward
Copy 1280 sequential points to the device
Wait for the GPU to complete its job
Found -4593 candidadtes, check on CPU
CPU check failed :(
[1.62 Mkey/s][total 5242880]
Move the row increments forward
Copy 1280 sequential points to the device
Wait for the GPU to complete its job
Found -4593 candidadtes, check on CPU
CPU check failed :(
[1.65 Mkey/s][total 7864320]
Move the row increments forward
Copy 1280 sequential points to the device
Wait for the GPU to complete its job
Found -4593 candidadtes, check on CPU
CPU check failed :(
[1.66 Mkey/s][total 10485760]
Move the row increments forward
Copy 1280 sequential points to the device
Wait for the GPU to complete its job
Found -4592 candidadtes, check on CPU
CPU check failed :(
[1.68 Mkey/s][total 13107200]
save the priv. key to a file
Copy 1280 sequential points to the device
Copy the row stride array to the device
Move the row increments forward
Copy 1280 sequential points to the device
Wait for the GPU to complete its job
Found -4597 candidadtes, check on CPU
CPU check failed :(


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Andzhig on July 25, 2018, 08:53:11 PM
why should you -v replace with -D 0:0 or -D 1:0
Quote
Intel(R) HD Graphics 4600
it seems like you're running on a CPU card I do not know if it works fine.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Yahkinator on July 26, 2018, 12:35:26 PM
why should you -v replace with -D 0:0 or -D 1:0
Quote
Intel(R) HD Graphics 4600
it seems like you're running on a CPU card I do not know if it works fine.

It's an integrated video card.  It won't be the final machine I'll be using...just testing.

@holy_ship do you have an opinion?


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Yahkinator on July 26, 2018, 01:15:42 PM
To reiterate, using
Code:
oclvanitygen -D 0:0 -f addresses.txt -o found.txt -k lastkey.txt 0000000000000000000000000000000000000000000000000000000000003000
should reveal the addresses for the first 14 puzzle transactions within seconds.  It doesn't.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Andzhig on July 26, 2018, 01:38:42 PM
try on cpu -D 1:1


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on July 27, 2018, 03:59:02 PM
It's an integrated video card.  It won't be the final machine I'll be using...just testing.
@holy_ship do you have an opinion?

I guess these zillions of leading zeros transform your HEX to some crapy WIF.
Also HEX should be uppercase, at least in Linux.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Yahkinator on July 27, 2018, 07:24:28 PM
I guess these zillions of leading zeros transform your HEX to some crapy WIF.
Also HEX should be uppercase, at least in Linux.

oclvanitygen -D 0:0 -f addresses.txt -o found.txt -k lastkey.txt 3000
Start with 3000
Searching for 160 addresses
81920/131072
[1.70 Mkey/s][total 44564480]

Removed the leading zeros.  Capitalized the numbers.  :D
Still doesn't find anything.
Can you share a command line that returns a find?


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: keychainX on July 27, 2018, 08:29:47 PM
Do you still need funding to improve the speed?


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on July 28, 2018, 04:36:16 AM
Do you still need funding to improve the speed?

You can request updates from NDV directly, if you wish. He promised 30-50% boost after rewriting ECC code for around $300-400.
You can make the change public or personal.

If you are going to use big farm it makes sense. For 1-2 cards (like I have) it's just easier to buy more hardware.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on July 28, 2018, 04:43:58 AM
oclvanitygen -D 0:0 -f addresses.txt -o found.txt -k lastkey.txt 3000
Still doesn't find anything.
Can you share a command line that returns a find?

I haven't tried intel gpu, also I didn't even try windows.
The command looks fine, although -D 0:0 is not necessary.

On nvidia card I've tested first 30 and 52,53,54,55 puzzles - works like a charm.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Yahkinator on July 28, 2018, 04:47:11 AM
Fired up my Ubuntu and dowloaded the code.  Running an Nvidia card in that box.  Compiled it and ran the same command:

oclvanitygen -D 0:0 -f addresses.txt -o found.txt -k lastkey.txt 3000

Still doesn't find anything. 

What's the command you ran to have those return positive?


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: keychainX on July 28, 2018, 11:17:32 AM
Yes, we are going to make a farm.

What is his mail, do you have it, can you PM?


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on July 28, 2018, 02:26:52 PM
I found him on upwork.

https://www.upwork.com/mobile/freelancers/~01cb02eecfe0e0725e


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on July 28, 2018, 02:33:18 PM
oclvanitygen -D 0:0 -f addresses.txt -o found.txt -k lastkey.txt 3000
What's the command you ran to have those return positive?

The command is OK.
Are you really talking about NDV fork of oclvanitygen ?
Do addresses.txt file contain 160 bounty addresses? Case of chars matters.

There is a verbose switch. Post the log.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Yahkinator on July 28, 2018, 03:11:37 PM
oclvanitygen -D 0:0 -f addresses.txt -o found.txt -k lastkey.txt 3000
What's the command you ran to have those return positive?

The command is OK.
Are you really talking about NDV fork of oclvanitygen ?
Do addresses.txt file contain 160 bounty addresses? Case of chars matters.

There is a verbose switch. Post the log.

I got it working on Ubuntu.  I was running LBC at the same time, and they were fighting for memory.  Still no go on the Windows version, but it's popping a CPU check error.  Might be because I'm using an integrated card for testing.  Some time this week I'll throw a couple ATI cards in the box and see if those will work through windows.

Thanks for the help and thanks for setting this up!


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on July 28, 2018, 05:16:34 PM
In verbose mode it always complains on CPU, even when working OK and finding everything.
I didn't ask him what this complain means.

If something is not working it is possible that he will fix it for free if you report a bug on github. Because he was doing this work partially for portfolio  ;D


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: keychainX on July 28, 2018, 05:55:24 PM
Thanks Holy_Ship, managed to contact him  ;)


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Yahkinator on July 30, 2018, 06:15:21 AM
I have it running on several machines now.  Pulled the latest bitcoin address with balance file and am looking for anything that has 10btc or more.  Pulling in 142k addresses does knock about 10% off my hashing speed, but it's still much faster than LBC was on a P5000.  It actually uses all of the video card instead of being CPU bound.  If it could use a bloom filter like LBC does, it would be even faster and look for more.

Thanks for doing this.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on July 30, 2018, 03:54:29 PM
If it could use a bloom filter like LBC does, it would be even faster and look for more

There is of course a bloom filter in VG, but it's implementation is tuned for around 10k addresses. :(
Mostly it's my fault - I thought that there are 10-20 thousand of fat addresses. Was wrong.

So, this part of VG can also be upgraded. Actually, this guy spent only couple of weeks on it. :) He looks like a pro, but a freelancer, not charity fund :) There were many things to do, but I wasn't ready to spend more, than $500


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: keychainX on July 31, 2018, 06:48:52 AM
If it could use a bloom filter like LBC does, it would be even faster and look for more

There is of course a bloom filter in VG, but it's implementation is tuned for around 10k addresses. :(
Mostly it's my fault - I thought that there are 10-20 thousand of fat addresses. Was wrong.

So, this part of VG can also be upgraded. Actually, this guy spent only couple of weeks on it. :) He looks like a pro, but a freelancer, not charity fund :) There were many things to do, but I wasn't ready to spend more, than $500


I've come across 40.000+ Brainwallets, what is your target list size?


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Coinblaze on August 01, 2018, 03:03:01 PM
The chance to actually generate the private keys for a particular bitcoin address is infinitesimal.

There are exactly 2^160 possible addresses. 2^160 is 1,461,501,637,330,902,918,203,684,832,716,283,019,655,932,542,976.

To put that in perspective, there are only 2^63 grains of sand on all of the beaches of the Earth.

You'd have a better chance to mine solo on a cpu  ;D



Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: pinkflower on August 02, 2018, 02:49:31 AM
Is rico666's original Large Bitcoin Collider dead? There was so much activity on it before, but after the FUD that there was a backdoor in it, I think the users got scared.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: giftseller8x on August 02, 2018, 08:59:40 AM
Is rico666's original Large Bitcoin Collider dead? There was so much activity on it before, but after the FUD that there was a backdoor in it, I think the users got scared.
It still running bro. https://lbc.cryptoguru.org/stats


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: giftseller8x on August 02, 2018, 09:02:46 AM
If it could use a bloom filter like LBC does, it would be even faster and look for more

There is of course a bloom filter in VG, but it's implementation is tuned for around 10k addresses. :(
Mostly it's my fault - I thought that there are 10-20 thousand of fat addresses. Was wrong.

So, this part of VG can also be upgraded. Actually, this guy spent only couple of weeks on it. :) He looks like a pro, but a freelancer, not charity fund :) There were many things to do, but I wasn't ready to spend more, than $500

Your share is great.
I have one MSI GTX 1060 3G Gaming X. Try this oclvanitygen it run at speed 27M key. Is it normal or slow.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: keychainX on August 02, 2018, 03:14:23 PM
Is rico666's original Large Bitcoin Collider dead? There was so much activity on it before, but after the FUD that there was a backdoor in it, I think the users got scared.
It still running bro. https://lbc.cryptoguru.org/stats


Most people abandoned the project when they figured out the created could change the code without their consent.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Yahkinator on August 02, 2018, 06:36:45 PM
Is rico666's original Large Bitcoin Collider dead? There was so much activity on it before, but after the FUD that there was a backdoor in it, I think the users got scared.
It still running bro. https://lbc.cryptoguru.org/stats


Most people abandoned the project when they figured out the created could change the code without their consent.

I disagree.  It's still running, but seems to have less and less people running the clients. There was a core group for quite a while, but the biggest member left several months ago.

Probably the biggest thing that is contributing to the demise is Rico focusing his programming efforts elsewhere.  He's not updating the client any more, not fixing any bugs, and pretty much doesn't visit the Discord channel any more.  He's essentially abandoned the project himself. 


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: pinkflower on August 03, 2018, 02:32:25 AM
Is rico666's original Large Bitcoin Collider dead? There was so much activity on it before, but after the FUD that there was a backdoor in it, I think the users got scared.
It still running bro. https://lbc.cryptoguru.org/stats


Most people abandoned the project when they figured out the created could change the code without their consent.

I disagree.  It's still running, but seems to have less and less people running the clients. There was a core group for quite a while, but the biggest member left several months ago.

Probably the biggest thing that is contributing to the demise is Rico focusing his programming efforts elsewhere.  He's not updating the client any more, not fixing any bugs, and pretty much doesn't visit the Discord channel any more.  He's essentially abandoned the project himself. 

Yeah he has been very busy developing on Burst and also trying to revive the project and take it to the top 50 in market value. Its a very ambitious goal but him and his team will be rewarded well if they can do it.

rico666 is doing an excellent job on Burst thats not reflected in its market value. If you are a fan of rico, support us in the Burst community.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: ounce on August 08, 2018, 09:28:12 PM
Fired up my Ubuntu and dowloaded the code.  Running an Nvidia card in that box.  Compiled it and ran the same command:

oclvanitygen -D 0:0 -f addresses.txt -o found.txt -k lastkey.txt 3000

Still doesn't find anything. 

What's the command you ran to have those return positive?

I do not find the address program, I know that it is in the reverse order, but everything is similar to the one described above.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on September 03, 2018, 02:36:24 AM
Quote from: pinkflower
rico666 is doing an excellent job on Burst thats not reflected in its market value. If you are a fan of rico, support us in the Burst community.

This topic is not about splendid rico and his beautiful shitcoins :)

Quote from: giftseller8x
I have one MSI GTX 1060 3G Gaming X. Try this oclvanitygen it run at speed 27M key. Is it normal or slow.

1050 gets 15MK
1060 gets 25MK
1070 gets 38MK

address list can be up to 150-200 thousand keys without big speed penalty

I personally run with this 97k list.
It contains 4BTC++ addresses without any spends
or 15BTC++ with spends. Obviously "15BTC++ with spends" sometime
become empty and should be deleted.

http://80.211.89.91/92k (http://80.211.89.91/92k)


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: andreyyv on September 03, 2018, 06:14:06 PM


I personally run with this 92k list.
Hi! Are you scan different space range or you calculate some range for step by step scaning ?


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on September 04, 2018, 04:35:46 AM
This VG version can search only decrementally - from starting number, in infinite loop it does minus 1

So for puzzle56 the range is 2^55 - 2^56

1. get your crystal ball, see there the right percentage, let's say it is 42%
2. count a bit. 42% of range is around 51160891766928834 decimal or B5C28F5C28F5C2 hex

echo 'obase=16; 2^55/100*42+2^55' | bc -l
B5C28F5C28F5C2

p.s. I already searched around 42 and 17 percent for a couple of months at speed 40MK. It's not there... ;D


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on September 04, 2018, 05:23:27 AM
Hey, fixed a list. 38MK is the speed of 1070.
So, 1080 should get 60-70MK, nobody has reported yet.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Andzhig on September 04, 2018, 08:52:07 AM
It seems to speed it affects PCI-E x16, x8, x4, x1. x16 more mkeys than x4. And with these collisions still the question whether they exist at all, if generate addresses in the first "bitcoin core 0.1" we will see
 
1FnVuHYKV7pW4TWR286GNi4KNT6UeaYTTf  5JrJw8iqnx7JHQ8NSSxM4XUGhgLU3mMqunMNLbawxWe1u9P4xZ4 884A50B3C55D5A085861904B98B930DEB8A519FB5F1998D914BDA6115A550A44
17AshpjqPgWsjLKYEbyBQ8XESYBrAsXy1v     5KXCn9sbHSdwdxWvfBnDAagWBV9eTxyZ6rmRBCESfxvmTyihNyU E09A864939B15C21309D297D63A88F51B3D0A95B2B11AA33D5189E50F1054B53
1Js1mFr9sEne154baEDsnvHb9j4TFFaj2v       5JFJ6QKpwPAWBhiUeQf4bTtus1GcBf6ymJrsoZ6UQrJBxEcAp8d     38C91E6407A8C639D2ACEC7C0DDFBC71CAE31D31686B41F5929552E48FDB7332
1J6zwmN987G2CthDEwc4rm2TPrskSYktU1    5K49E5MB8WRv8hy78Wz8JUV6PraazUiD8uG3CauzqxMVKpfw5KL  A3285FB9B1BE935FB2B6480F89C720FCCD8D30C1E8E11FCE6C10818C09A23A73

and their dec

61645851076440950040700147302009857952423202268196304805711354366578612570692
101591099338789881068330322780764063693808694983735576401369783241827565259603
25684865529875059200910699259210504468103551193592807433616257170740122186546
73798328873875309116869894990344634409190150273260165561706242786928783145587

what are the "first bitcoin" 2^160 it is unclear from whomever he came up with. these are the addresses 2^253 - 2^256. If there are collisions what is the use of doing such a safety run 2^256 if there is a collision somewhere 2^96 (as witnesses of a collision say). Then there would be no security...


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on September 08, 2018, 03:11:30 PM
Bounty56 found by someone...  :-[ moving to 57  :'(  :'(  :'(


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: Elliptic23 on September 08, 2018, 04:08:43 PM
There is another project BitCrack that does the same thing and some people are getting 440 million  keys per second on a GTX 1080. Why is it so much faster than VanityGen??


Title: This is neither a LBC fork, nor faster, nor a collider
Post by: rico666 on September 08, 2018, 05:41:03 PM
holy_shit likes to pour shit over the LBC, but let's stick to the facts:

  • this is merely a vanitygen mod/fork, not a fork of any LBC code
  • because there is no pool-coordination between the clients, everyone searches the same space. ergo, work is done twice,triple, quadruple,... times
  • it's not a collider, because you just search for the 32BTC bounty, not for all BTC addresses with funds (~ 18 million)

Don't get me wrong, I'm all for this project, because it keeps the "bounty-only" guys away from LBC, I just think that holy_shit makes promises (and claims) that show no correlation with the real world.

That being said, do not consider this any marketing for LBC. I have way too few time for maintaining LBC, so everyone participating there is basically "on his own".


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on September 10, 2018, 02:55:07 AM
Quote
There is another project BitCrack that does the same thing and some people are getting 440 million  keys per second on a GTX 1080. Why is it so much faster than VanityGen??

Theoretically CUDA doesn't have noticeable advantage over OPENCL. So being 4-7 times faster means either this guy is a genius  ;D either this proggie is a scam.

I see that latest commit was in August, so it is easy to check for scam, try to search near 44218742292676575 (puzzle 56, which was found in September), if it finds - maybe it is not scam.

Also it is good idea to order some 3rd part review.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: giftseller8x on September 10, 2018, 03:48:13 AM
Vanitygen Plus has been reported not fully using all Vga when run multiple card (6 cards). Do you test vg from ndv with 6 cards, is the hash rate is sum of 6 cards.


Title: Re: This is neither a LBC fork, nor faster, nor a collider
Post by: holy_ship on September 13, 2018, 05:17:27 AM
Quote from: rico666
...

you're not only shitcoin crupto guru, but also a negotiations guru. ;D OK, let it be - replaced "fork" for "upgrade" in title.  ;D

At your age you should start taking nootropics, because you've read the performance comparisons, but still cannot commit in memory. maybe no free space in brain, heh?


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on September 13, 2018, 05:19:07 AM
Vanitygen Plus has been reported not fully using all Vga when run multiple card (6 cards).
Do you test vg from ndv with 6 cards, is the hash rate is sum of 6 cards.

Tried 2 cards.

If you have 6 CPU cores, it will probably SUM performance fine.


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: holy_ship on September 13, 2018, 05:19:49 AM
There is another project BitCrack that does the same thing and some people are getting 440 million  keys per second on a GTX 1080. Why is it so much faster than VanityGen??

So? Did you test puzzle56? Is it really working?  ;D


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: Amnuazka on September 16, 2018, 09:48:03 PM
Congratulations!

Can someone show me the pk no 161 - 256 ?

Thx

@holy_ship
@Andzhig
@Arulbero
@BurtW


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: holy_ship on September 17, 2018, 04:43:42 AM
Tested BitCrack a bit. Seems to work and around 2 times faster then NDV fork.

For my list of 97k wallets with gtx1070 I get 80MK, not 40.
And CPU is not used at all, not even 1 core.

This probably makes NDV fork useless as well.

RIP LBC, RIP vanitygen  ;D


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: nc50lc on September 17, 2018, 05:40:54 AM
RIP LBC, RIP vanitygen  ;D
Vanitygen's main purpose if for creating personalized address, not to bruteforce private keys.

But I second this: RIP LBC 'after 104 more addresses'.
It's been dead for a long time though, there are only few users left who's actually "adding" a share (for the Puzzle).
Most are just brought there by curiosity and false hope.


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: arulbero on September 17, 2018, 11:10:53 AM
Can someone show me the pk no 161 - 256 ?

Private keys?  It's not possible. Only the transaction's author know them.


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: holy_ship on September 18, 2018, 02:23:53 AM
Arulbero's magic proggie can calculate PK of spent puzzle56 because 2^55 - 2^56 is relatively small range.

puzzle161 is spent, but the range 2^161 - 2^162 is 40564819207303340847894502572032 times larger

>Vanitygen's main purpose if for creating personalized address, not to bruteforce private keys.

nc50lc, you should read at least first page before commenting in topic.


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: arulbero on September 18, 2018, 11:31:44 AM
Arulbero's magic proggie can calculate PK of spent puzzle56 because 2^55 - 2^56 is relatively small range.

puzzle161 is spent, but the range 2^161 - 2^162 is 40564819207303340847894502572032 times larger

I can search a private key in a 2^70 range, not much more. It takes a lot of memory and cpu power.


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: domozhirov on September 22, 2018, 07:11:27 PM
arulbero, can you send your script or the source code of the program with baby-giant step? I'm not a programmer, I'm just a system administrator, but I have a test server with xeon and 1tb ram. I think that 1tb is enough to compose a hash for about 2 ^ 110. And if my assumptions are correct, then I can search the keys from 2 ^ 160-2 ^ 220


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: arulbero on September 22, 2018, 08:27:10 PM
arulbero, can you send your script or the source code of the program with baby-giant step? I'm not a programmer, I'm just a system administrator, but I have a test server with xeon and 1tb ram. I think that 1tb is enough to compose a hash for about 2 ^ 110. And if my assumptions are correct, then I can search the keys from 2 ^ 160-2 ^ 220

1 TB is only 2^5 times 32 GB (the Ram of my laptop). You could search maybe until 2^80, probably less, I have a Xeon too.

I wrote that program for myself, it is "unusable" at the moment (too hard to configure, no comments) for anybody but the author (me).


Title: Re: Faster and Autonomous Large Bitcoin Collider fork
Post by: DevilOper on October 03, 2018, 10:48:22 AM
Theoretically CUDA doesn't have noticeable advantage over OPENCL.
It has inline assembler though.


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: fucilator_3000 on October 20, 2018, 04:15:00 PM
arulbero, can you send your script or the source code of the program with baby-giant step? I'm not a programmer, I'm just a system administrator, but I have a test server with xeon and 1tb ram. I think that 1tb is enough to compose a hash for about 2 ^ 110. And if my assumptions are correct, then I can search the keys from 2 ^ 160-2 ^ 220

1 TB is only 2^5 times 32 GB (the Ram of my laptop). You could search maybe until 2^80, probably less, I have a Xeon too.

I wrote that program for myself, it is "unusable" at the moment (too hard to configure, no comments) for anybody but the author (me).

Keep us posted dude! :D


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: anunnaki1202 on November 14, 2018, 09:56:28 PM
Can oclvanitygen run on CPU I have a server with 48 threads and getting this error

Code:
anunnaki@anunnaki-PowerEdge-R810:~/vanitygen$ chmod 777 oclvanitygen
anunnaki@anunnaki-PowerEdge-R810:~/vanitygen$ ./oclvanitygen -D 0:0 -f addresses.txt -o found.txt -k lastkey.txt 5HpHagT65TZzG1PH3CSu63k8DbpvD8s5ip4nEB3kEsreAnchuDf
Start with 5HpHagT65TZzG1PH3CSu63k8DbpvD8s5ip4nEB3kEsreAnchuDf
Searching for 200000 addresses
clGetPlatformIDs(0): Unknown code -1001
cant get_platform(0)
Can't get_opencl_device
Could not open device '0:0', ignoring
clGetPlatformIDs(0): Unknown code -1001
Available OpenCL platforms:
anunnaki@anunnaki-PowerEdge-R810:~/vanitygen$ make oclvanitygen
make: 'oclvanitygen' is up to date.
anunnaki@anunnaki-PowerEdge-R810:~/vanitygen$


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: anunnaki1202 on November 14, 2018, 11:36:49 PM
I got it run as far as below

Code:
anunnaki@anunnaki-PowerEdge-R810:~/vanitygen$ sudo ./oclvanitygen -D 0:2 -f addresses.txt -o found.txt -k lastkey.txt 5HpHagT65TZzG1PH3DyuZSxCy1DYd7f5wZAZseJkjZqLb1rDeBo
Start with 5HpHagT65TZzG1PH3DyuZSxCy1DYd7f5wZAZseJkjZqLb1rDeBo
Searching for 200000 addresses
DRM_IOCTL_I915_GEM_APERTURE failed: Invalid argument
Assuming 131072kB available aperture size.
May lead to reduced performance or incorrect rendering.
get chip id failed: -1 [22]
param: 4, val: 0
DRM_IOCTL_I915_GEM_APERTURE failed: Invalid argument
Assuming 131072kB available aperture size.
May lead to reduced performance or incorrect rendering.
get chip id failed: -1 [22]
param: 4, val: 0
beignet-opencl-icd: no supported GPU found, this is probably the wrong opencl-icd package for this hardware
(If you have multiple ICDs installed and OpenCL works, you can ignore this message)
clGetDeviceIDs(0): CL_DEVICE_NOT_FOUND
can't get_device_list
cant get_device(2)
cant get_platform(0)
Can't get_opencl_device
Could not open device '0:2', ignoring
Available OpenCL platforms:
0: [Intel] Intel Gen OCL Driver
DRM_IOCTL_I915_GEM_APERTURE failed: Invalid argument
Assuming 131072kB available aperture size.
May lead to reduced performance or incorrect rendering.
get chip id failed: -1 [22]
param: 4, val: 0
beignet-opencl-icd: no supported GPU found, this is probably the wrong opencl-icd package for this hardware
(If you have multiple ICDs installed and OpenCL works, you can ignore this message)
clGetDeviceIDs(0): CL_DEVICE_NOT_FOUND
anunnaki@anunnaki-PowerEdge-R810:~/vanitygen$

This error is on Ubuntu 18.04.1 LTS
Intel® Xeon(R) CPU E7540 @ 2.00GHz × 48

What am trying to achieve is to make it run on CPU


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: GoldTiger69 on November 15, 2018, 12:07:14 AM
I got it run as far as below

Code:
anunnaki@anunnaki-PowerEdge-R810:~/vanitygen$ sudo ./oclvanitygen -D 0:2 -f addresses.txt -o found.txt -k lastkey.txt 5HpHagT65TZzG1PH3DyuZSxCy1DYd7f5wZAZseJkjZqLb1rDeBo
Start with 5HpHagT65TZzG1PH3DyuZSxCy1DYd7f5wZAZseJkjZqLb1rDeBo
Searching for 200000 addresses
DRM_IOCTL_I915_GEM_APERTURE failed: Invalid argument
Assuming 131072kB available aperture size.
May lead to reduced performance or incorrect rendering.
get chip id failed: -1 [22]
param: 4, val: 0
DRM_IOCTL_I915_GEM_APERTURE failed: Invalid argument
Assuming 131072kB available aperture size.
May lead to reduced performance or incorrect rendering.
get chip id failed: -1 [22]
param: 4, val: 0
beignet-opencl-icd: no supported GPU found, this is probably the wrong opencl-icd package for this hardware
(If you have multiple ICDs installed and OpenCL works, you can ignore this message)
clGetDeviceIDs(0): CL_DEVICE_NOT_FOUND
can't get_device_list
cant get_device(2)
cant get_platform(0)
Can't get_opencl_device
Could not open device '0:2', ignoring
Available OpenCL platforms:
0: [Intel] Intel Gen OCL Driver
DRM_IOCTL_I915_GEM_APERTURE failed: Invalid argument
Assuming 131072kB available aperture size.
May lead to reduced performance or incorrect rendering.
get chip id failed: -1 [22]
param: 4, val: 0
beignet-opencl-icd: no supported GPU found, this is probably the wrong opencl-icd package for this hardware
(If you have multiple ICDs installed and OpenCL works, you can ignore this message)
clGetDeviceIDs(0): CL_DEVICE_NOT_FOUND
anunnaki@anunnaki-PowerEdge-R810:~/vanitygen$

This error is on Ubuntu 18.04.1 LTS
Intel® Xeon(R) CPU E7540 @ 2.00GHz × 48

What am trying to achieve is to make it run on CPU

oclvanitygen is for GPUs. For CPU you need to use Vanitygen.


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: anunnaki1202 on November 15, 2018, 12:19:41 AM
How to do that ?
To just removing ocl?


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: GoldTiger69 on November 15, 2018, 12:34:52 AM
How to do that ?
To just removing ocl?

Nope, oclvanitygen and vanitygen are 2 different programs.  Read the following thread, you will understand what I'm saying: https://bitcointalk.org/index.php?topic=25804.0


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: Andzhig on November 15, 2018, 01:23:14 PM
Can oclvanitygen run on CPU I have a server with 48 threads and getting this error
Try -D 1:1


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: anunnaki1202 on November 15, 2018, 11:19:30 PM
same error


Code:
anunnaki@anunnaki-PowerEdge-R810:~/vanitygen$ ./oclvanitygen -D 1:1 -f addresses.txt -o found.txt -k lastkey.txt 5KHon4xmV31t9dFSHzeN3KF3R1EvjnSRCuy5ZcVEL83NZXzsyeE
Start with 5KHon4xmV31t9dFSHzeN3KF3R1EvjnSRCuy5ZcVEL83NZXzsyeE
Searching for 200000 addresses
/dev/dri/card0 not authenticated
cant get_platform(1)
Can't get_opencl_device
Could not open device '1:1', ignoring
Available OpenCL platforms:
0: [Intel] Intel Gen OCL Driver
/dev/dri/card0 not authenticated
beignet-opencl-icd: no supported GPU found, this is probably the wrong opencl-icd package for this hardware
(If you have multiple ICDs installed and OpenCL works, you can ignore this message)
clGetDeviceIDs(0): CL_DEVICE_NOT_FOUND
anunnaki@anunnaki-PowerEdge-R810:~/vanitygen$


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: Andzhig on November 16, 2018, 11:34:50 AM
same error
then wait "bitcrack" cpu version https://github.com/brichard19/BitCrack/issues/71 or try on python 3 to create your own programs there for a couple of weeks to study. https://bitcointalk.org/index.php?topic=1306983.msg45861254#msg45861254



Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: holy_ship on November 19, 2018, 02:59:17 AM
Quote from: anunnaki1202

Don't listen to ignorant andzhig.
Theoretically it should work on CPU or Intel GPU, NDV said that he made some fixes to original vg code.
You should use NDV OCL version, but you have to setup OCL drivers for CPU first.
I haven't tried.

I don't think it makes sense now, when puzzles 55-57 are found.
phrase "Xeon CPUs, not the best, but alright. I was getting at least 33.6 million keys/sec on a 96-CPU machine." from
https://github.com/brichard19/BitCrack/issues/40 (https://github.com/brichard19/BitCrack/issues/40)
dunno who is this. Maybe UnknownHostname dude and crappy LBC software.
But still,  it only makes sense to search with several GPUs now, not 48CPU cores. Even if they are free/stolen.


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: Andzhig on November 19, 2018, 10:46:56 AM
I'm not "ignorant")), if his mind didn’t have enough drivers to install, then the sense before him to grovel, for me, it works on cpu with -D 1:1. But bitcrack has an advantage at the moment besides speed, it can run multiple copies of the program on the same device, the total speed is divided between the programs equally, on 1080ti, can run 100 programs on one card with speed 1-2mk\s, this allows a larger scatter range to scan simultaneously ().



Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: PietCoin97 on November 20, 2018, 02:15:03 PM
Quote from: anunnaki1202

Don't listen to ignorant andzhig.
Theoretically it should work on CPU or Intel GPU, NDV said that he made some fixes to original vg code.
You should use NDV OCL version, but you have to setup OCL drivers for CPU first.
I haven't tried.

I don't think it makes sense now, when puzzles 55-57 are found.
phrase "Xeon CPUs, not the best, but alright. I was getting at least 33.6 million keys/sec on a 96-CPU machine." from
https://github.com/brichard19/BitCrack/issues/40 (https://github.com/brichard19/BitCrack/issues/40)
dunno who is this. Maybe UnknownHostname dude and crappy LBC software.
But still,  it only makes sense to search with several GPUs now, not 48CPU cores. Even if they are free/stolen.

holy_ship does it make sense what i wrote you in pm for the search space ?

and how can i install the Bitcrack or should i only download the exe file from github ?



Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: holy_ship on November 23, 2018, 03:02:29 AM
on 1080ti, can run 100 programs on one card with speed 1-2mk\s, this allows a larger scatter range to scan simultaneously ().

Are you sure that overall speed is not lower with 100 copies?
You can easily do the same with simplest scripts and switches
-s, --start             Staring key, in hex
-r, --range             Number of keys to search
to scan each range at full speed, then skip to next.


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: holy_ship on November 23, 2018, 03:04:46 AM
should i only download the exe file from github ?

Why not? In windows you have 99% or even 100% of software in form of EXE. Why bother compiling bitcrack?  ;D


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: Andzhig on November 23, 2018, 07:00:36 AM
on 1080ti, can run 100 programs on one card with speed 1-2mk\s, this allows a larger scatter range to scan simultaneously ().

Are you sure that overall speed is not lower with 100 copies?
You can easily do the same with simplest scripts and switches
-s, --start             Staring key, in hex
-r, --range             Number of keys to search
to scan each range at full speed, then skip to next.

Not sure, but there are several components,  file size address (someone on 100-600mb hammer in, scary to imagine that there, multi-signature, transaction, modern 2^512...), -c -u -b -t -p. Here in the subject, on the initial pages, someone posted a 32mb file. There are about 1,300,000 addresses, if remove multi-signature (3*) get about 700000 addresses the first 100000-150000 of which will all Satoshi (~20000, ~1000000btc) and the rest of the lost (3-4mil btc). If 1 address can be searched, it can quickly start and there will be no winnings with several. It is already a question of search tactics or to jump in one stream or immediately to everything 2^58-2^134.

If developer binomial random realizes (i of course would be a little bit wrong) can be directly 256bit brute force.

for example more addresses begin with such bytes 11010010, 11011010, 11011011, 11011111, 10001001, 10010101. The number of zeros is more toward 127 (well, to reduce the percentage of lunge down, up. 126,128 .from 100 to 150. 99 very rare.)

1111111111111111111111111111111111111111111111111111111111111111111111111111111 1111111111111111111111111111111111111111111111111111111111111111111111111111100 0000000000000000000000000000000000000000000000000000000000000000000000000000000 0000000000000000000
1111111111111111111111111111111111111111111111111111111111111111111111111111111 1111111111111111111111111110000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000000000000000000 0000000000000000000


let's start 10010101

here they are with us for example went (from bitcoin core v0.1)

1001010101100101011110000000011100001110100111010011111101101101110110100011100 1111111001001100001101011010010111101101110110001010011001111100111010101101001 0011000001100100100010001011001000001110001110010110111001100111011100101011111 101000110111111110
1001010111101001001110111001100010111001110110001001001101010101100000000011100 0101011100110111100111011110000110111111101101001011110010001010101110011101111 1000110110011000001011001110110001011010000010101011100010011110111011001111100 000100111110011110
1001010101100010111011011010111001111101011000100000001111111010010100110010110 0000011111000111011010100111110100101111111110000110101011101110110011101001000 0001101111111101000110101110101011001111010011011001110001001000011111110011011 110010010110000000
1001010101010000110101010100000000001111001101110011000001111010110001011110110 0001000011000011100100110001110000101110010011000111111000010001100110110111100 0101001110111110111010100001110011000001101011011101011100101000110001001110110 1011000010100010101
1001010111011100010001010000000110000101000010101111111110011010010111001100011 0111011001011000001010110100010010010001011110010111000111111111101110110100001 0001001111111111100010010100100100111011101110000110110010010101010100100110100 111101100001010111
1001010100011110100111001001011100000001101110110110010111000011000111001101100 1111100000011010000100011100000010011000101101001010001010011011010101111010001 1100101100110011011011110011100000101011011100101101001011000101011011101011000 01011101111001    
1001010110101011101101111100011100001010101000100111011101011010001001000110010 1000111111010101000110110101100101011010110010111011111001000110111111100001111 0011101001010011100010100000100010111111111000101111011100011011001111011010110 00011000111111011  
1001010100001101000111100011010111111010111110000001111110100000001000011000010 1000111000110111000001110101000101111101100000100011000100001101100010110001101 0101011100110100111111000010000010110101010000111110111011011001101101110100011 000101111000      
1001010101110000001011011011001111111100110000011110001100011011001011100101101 0000111001101111011110010000100111011100010011001111110011000111010001001100001 1111011010010110111001010110110001000010001101011100011110101110111101010111101 1001100100101101000
1001010101001101111101010110110011010001001100111101100000110110101110010010001 1011010011001101000101110010100011101110000000011000100010010000010001010111100 1100010001111101001011100110111010101100000101010110010111100111100101000110111 0100001001011010001
1001010101000000010000001000111111010110001110011010011101001000011111110001001 1110001100010001110001010010100110101101100011010101000110000101100111100101000 0011111011000100010101111000101100100101011101000000111000000011100010111100110 1110011011011111010


in dec

33786947196134805143254308771402739979261266550701315052397583440852419513854
33903350562759138713973736868302950354769449848599192986693376551416497196958
33784702934687120346053184051723466753118492158443130567330386012137407325568
67537434003099803668096737460665433679086281535422818832750897025714627118357
33891898527313435463823423436797234229979288397414557116534412126674377496663
2107771893575452894388072252547671770554782823158565473448152358296076294009
16924503418178650666712592578309811919302072518435441725388742926177059746299
526701499675363538747954556149913302553667071138081038433863352605669470584
67592816741196387948795087690846622934166339151863216781626670660486072945000
67532355524455427785355162810259975674520878752083731039250569079550302098129
67508138240651624134076223618847484928275255615194552508590590015445369566970


further applies the filter with zeros 127, then you can apply the filter for example with 3 bits 111,101 and so are looking for. If 3-4 million btc as 100% then with this filter should be 10-20% of them there))) there you can still drop 250,251,252,253,254,255 bit addresses.





Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: anunnaki1202 on November 23, 2018, 07:17:00 PM


oclvanitygen is for GPUs. For CPU you need to use Vanitygen.

Thanks I manage to make vanitygen-master work but is creating address! I want a personalized search like BitCrack do

Am trying to get BitCrack run in Ubuntu but without luck.


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: PietCoin97 on November 24, 2018, 01:49:55 PM
should i only download the exe file from github ?

Why not? In windows you have 99% or even 100% of software in form of EXE. Why bother compiling bitcrack?  ;D


I want to start Bitcrack on Ubuntu i know that exe works on win.


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: PietCoin97 on November 24, 2018, 06:23:50 PM
and how can i use the --continue command only at start or when i stop and then ?


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: holy_ship on November 26, 2018, 03:15:40 AM

Hичeгo нe пoнимaю, кoгдa ты шлёшь cвoи пpocтыни и кoммeнтapии пo aнглийcки.
Ecли твoи pacчёты paбoтaют, пoчeмy ты eщё вce бayнти нe coбpaл?  ;D


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: holy_ship on November 26, 2018, 03:20:31 AM
I want to start Bitcrack on Ubuntu i know that exe works on win.

In any linux it's a matter of minutes to compile bitcrack.
Install git and cuda with packet manager
git clone https://github.com/brichard19/BitCrack/
then edit Makefile in 2 places:
COMPUTE_CAP=30
CUDA_HOME=/usr/local/cuda-9.2

for gtx1070 thats
COMPUTE_CAP=61
and right path depends on distro, probably somewhere to /opt

then make


Title: how find public key to 58-160
Post by: tatishka83 on November 30, 2018, 11:29:28 PM
holy_ship
do you know how find public key X and Y. to keys 58-160?
я yжeвecь тыpнeт пepepылa) ??? ??? ???


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: PietCoin97 on December 01, 2018, 12:48:13 PM
what do you do sfter you know the pub key ?

you cant do nothing with it.

when you think from pub key to priv key with math no man that wont work


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: Andzhig on December 03, 2018, 08:29:18 PM

Hичeгo нe пoнимaю, кoгдa ты шлёшь cвoи пpocтыни и кoммeнтapии пo aнглийcки.
Ecли твoи pacчёты paбoтaют, пoчeмy ты eщё вce бayнти нe coбpaл?  ;D
Bычиcлитeльныx мoщнocтeй нe xвaтaeт, ecли б нa гпy c фикcиpoвaнным кoличecтвoм нyлeй чиcлa пepeбиpaть oднoвpeмeннo нecкoлькo вapиaнтoв (или этo yжe квaнтoвый кoмп бyдeт, гпy,тoжe пo oчepeди выпoлняeт?).

Moжнo былo нaпpимep вoт тaк paздeлить нoмepa, 3 бaйтa + paндoм.

Oбщee кoл.вo нyлeй, нyли в cтoлбax cлeвa, cпpaвa, кoличecтвo тpёxбитoвoгo пaттepнa "111"

101100011001110101101110 0001010010000110001001101000100001 33-25 10 23 2 0
111101011001001011100100 100000111100101011101011000011100 28-29 11 17  2 3
100111010001100010110110 00111010110001001111111111011111 22-34  12 10  1 5
110101010111110000111111 0011011011001111110000100010100 24-31   8  16  3 2
100011011011111011011011 010101101011010001111101000100 23-31    14 15  1 1
110000000011110001000111 00100011111100011001001101100 29-24     14 15  2 2
111011111010111000010110 0100110010111001111000111100 22-30      9  13  3 3
111010100000111000010100 001101000000000100111010000 33-18       14 19  2 1
100010101111010100001111 00001011101001001101010100 26-24        11 15  2
101110100000101110110101 1000000010101111101001101 24-25         11 13  2
101011011110011011010111 110011100011101110011011  17-31         8  9   2
110110011010110000100001 01101010011110010111010  23-24          13 10  0    
101110110000011000001110 0010001101010101000100 27-19            13 14  2
100100010111111001010000 101000011110000000101 26 -19            13 13  2
111000000010101100110101 10100011010110001111 22-22              13 9   1
110101111010011101100100 1111100010110010001 19-24               10 9   2
101010001000100001110001 011000110110001111 23-19                15 8   1

B пepвoм cтoлбцe 0 пляшeт oт 8 дo 15 вo втopoм пoфигy и пoexaли вce кoмбинaции из пepвoгo cтoлбa бepём и oднoвpeмeннo к ним paндoмим нa вcex втopoй кycoк пpoвepяeм.

Либo бepём

"11111111111111100000000"
"11111111111111000000000"
"11111111111110000000000"
"11111111111100000000000"
"11111111111000000000000"
"11111111110000000000000"
"11111111100000000000000"
"11111111000000000000000"

8-15 нyлeй иx paндoмим и втopoй кycoк paндoмa кo вceм пpиcoeдиняeм, пpoвepяeм... нy и плюc фильтp 111 или 101 100 110...

Bcё жe лyчшe, чeм вcё пoдpяд пepeбиpaть.


Boт тeбe пpимep питoши тoгo жe caмoгo для 256bit

Quote
import random
from bitcoin import *
#from PyRandLib import *
#rand = FastRand63()
#random.seed(rand())

l = []
with open(u"C:/addressesall.txt") as k: #addressesall.txt фaйл aдpecoв.
    l = k.read().splitlines()


while True:
    c1 = str ("11011010")
    b9 = ''.join(random.choice('10') for _ in range(random.choice([120])))
    spisok = [b9]
    for element in (spisok):
        zeros = random.randrange(126,129,1)
        zeros2 = random.randrange(7,17,1)
        zeros3 = random.randrange(0,16,1)
        aa = 1
        while aa <= 100000:
            s = element
            d = ''.join(random.sample(s,len(s)))
            s24 = (c1+d)
            ed = d.count("111")
            if ed == zeros2:
                v1 = ''.join(random.choice('10') for _ in range(random.choice([128,127,126,125,124,123,122]))) #128,127,126,125,124,123,122
                s34 = v1.count("111")
                if s34 == zeros3:
                    bina = (s24+v1)
                    nuli = bina.count("0")
                    if nuli == zeros:
                        b = int(bina,2)
                        priv = b
                        pub = privtopub(priv)
                        pubkey1 = encode_pubkey(privtopub(priv), "bin_compressed")
                        addr = pubtoaddr(pubkey1)
                        addr2 = pubtoaddr(pub)
                        if addr in l:
                            print ("found!!!",b,addr)
                            s1 = str(b)
                            s2 = addr
                            f=open(u"C:/a.txt","a")
                            f.write(s1)
                            f.write(s2)      
                            f.close()
                            pass
                        if addr2 in l:
                            print ("found!!!",b,addr,addr2)
                            s3 = str(b)
                            s4 = addr2
                            f=open(u"C:/a.txt","a")
                            f.write(s3)
                            f.write(s4)      
                            f.close()
                            pass
                        else:
                            print (nuli,ed,s34,b,addr,addr2) #print (nuli,ed,s34,element,s24,v1,b,bina,addr)
            aa = aa +1


Ha выxoдe
oбщee кoл.вo нyлeй, кoл.вo 111 в лeвoй пpaвoй чacти (128бит cлeвa, 128~ cпpaвa). Лeвaя чacть нaчинaeтcя c бaйтa 11011010 мoжнo пoлный paндoм, нo тyт, тaк cкaзaть, кaк чacть фильтpa выcтyпaeт, ибo нa 50000 aдpecoв cгeнepиpoвaнныx в core v 0.1, 11100010 c 127 нyлями 2004 11100010, 126 нyлями 2038 11100010, 128 нyлями 2028 11100010. Bтopoй пo мaccoвocти бaйт 127-128 2120 11001010, 2013 11001010. A 11111000 yжe бoльшe вceгo из oтфильтpoвaнныx пo 127 нyлeй идёт. 454 11111000, 431 11111011, 444 11111100, 431 11111101, 435 11111110. Taк жe 11111000 мнoгo и c 130 нyлями.

Moжнo тoжe caмoe yжe в dec фopмaтe пpoбoвaть пo кoличecтвy пoвтopeний в нoмepe 0,1,2,3,4,5,6,7,8,9. Чтo-тo типa:
1< 7  2< 3   3< 6   4< 9   5< 12 6< 5   7< 8   8< 11  9< 6  0< 10    14075774765088389247998355607401559610559706424115835638883170440013458058298
1< 7  2< 8   3< 8   4< 9   5< 5   6< 10 7< 8   8< 8    9< 4  0< 10   14065682812332820189072417617680654427891717843952356300890704735406462640336
1< 7  2< 12 3< 11  4< 6   5< 6   6< 10 7< 3   8< 13  9< 6  0< 3     14068845238988238879741541296328458621862261460393738166622109853229853335362
1< 7  2< 12 3< 8   4< 7   5< 10  6< 8   7< 8   8< 8   9< 4  0< 5     14074412765774829872522279313468180366563032870854943595382616125755623208125
1< 7  2< 6   3< 7   4< 7   5< 9   6< 9   7< 9   8< 10  9< 4  0< 9     14076871375278505813842001851830874386569712223650645346768549850207610996437

  
Quote
127 8 6 12356654289945144962616151110405411875258888273837247498587687555782797258417 1B1HZAGq6AeZpYsE5ZhefbDrRiDXJ19Vf2 1EMXRWBE5EPFEfK3aqZdSd6qa4qaauc3FS
127 8 6 3089962122245852723124950775902884152068787685928514959616987105063183347492 1N6NVqdcjYUjDZnQbTjutqUpPmn9UsJoDe 1FqP9mjoi4NUAQf7A5dQFkQsDmodkTVqL5
126 8 11 24676995573890697065029876037443795773266778649183975889346973676389078148411 18waw8ik5zoRJJ9b2h9YnZRXndsYRGErRi 122rD8mpqhem4ESjDpGpK5ML1FoeEprU1x
128 11 7 24742330109363045906185277196636194293269382503824249980583749382572122179170 12vGNKoP3Re7Utxo9EfU7zXiKAE2qBE6pp 14qqSMFPzMvx7U4GMHNr3MWb41TEeeV5yr
126 11 7 6188818647412603469481850900657817030855227007806510189017514264975555284874 1N1cwzWMH7g2UAFbAHCTi8ogChmkJAuvdb 14PMsLg6Sstf7ptkVbFnXAHR53DfSLfPa4
126 11 7 49416488539983499171700861351522232865532267463276802955523722356614986819503 1PbzsQyuzKgbLSTQzvVG5euVizKNMCqeeP 15PdWdkvTMT2tsDnNBUxUdnhGBrE1F1tMu
126 11 7 3095014542730357063945007511354874762323576376711631935602677627619348869536 1Hud7rJ4vuieKKNpfZgXFzxpss94HmAVtt 1N3bkzxFJdDbNUha3VEX5agFYWFnRPXgTs
126 11 7 49469964431533863667933295877938450146073567504152549982372787531455323640967 1MeeWQ7DTvSocCrwrVFSeHhLDyMeptc3bk 1gAvUYmHyZ3CxyMj2gMpnDiwY6u95u1F1
128 8 7 3089197903583319229998042750375898650713717800136793632074840908179663592022 1JAKTSXrd9k4dM8whraM3EGbanvCneMWe2 1D72CNmCpSGDgjgg7f2dbr8ib3Anq6euSb
128 8 7 49467000379906154644542263958039846375884833822023863502708670250695382347080 18WujrWCVXwzwfKpfiWP4BMVaq4dujNgiV 1BUdFxrrC7RL5a3qkMnrfVRdmVKCMWvHHq
128 10 8 98653967193919494956559574406635089732893320349123851201199965855189907351890 16FS9HW1hViHsB7giFP8YZMshx9kcBykGY 1JMjfnA6RuRYt8G3SKRFnL9z3fCgCPac89
128 10 8 3083557111472856161321594374562743321233792736562785455525062249483845502394 1NCHYwhpojvchuj3bRaNGDSucQYVYEzKtN 12Kqy2vsvyAo9tk79NbGWbCNkUS7UbLtaJ
128 10 8 98695649053738316574681608830532229197078067424463323568063963065861074891618 1M6Hg6NWWrDUPAQ9TSVGHmLUPpaGed7xb 1GtdhfKsV8L36qaaP92xPg8NT7a8Sf5LxS
128 12 7 6189654939855536715939640859287300858053192538529270320509386027820409808900 1BX8s38h3Mo1KYHZdXEXQfyGH2of1mQvp3 15KzRK6zQNebVThwe6NcEe3TS9BukhQYxw
128 10 7 99019113579890846333396194940279777796481236940399899438937746018702300157123 1BsSXjHd2Lhw7bXRYLgvZFcUxQts4GA4Tk 1Cb84ZcgfYUm2NrFU9C8Bc6yiwNsPTPd5j
128 10 7 12328849712108253811021285390700142319324738439107347113831198116999962759813 1G89eMGDCbBpqM2W9rbcqSkWKvDJFukvPi 1CYUnFFhBJP9jDxkpbWX6X8voLmRGw5gBN
127 10 8 3093318699148621355336666614007063903459419956934655104060542754927742369851 1JikTRyRzFaG3zhNiUgfkJw1HQax4NqfUf 1JRQDJDBJF5FxBamFWKQdU67RzBEnfsm4V
127 10 8 3090398627069007322722464603723224077119506196041244432205836670227590029123 1B6st5r5kRcfvrtvGjMLRhRQUW33Q3qR4p 18UsgV19auxkJtPjTzRBCoPojvmJ5cP7rQ
127 10 8 49330938243988889715395000903073272256440991958185209910573590547769943996646 1FtyeKeAx4cZmMpZ8jyvNs2KarEv1Hsr7J 13KF8C9FEHiCSfQyBhf74qYosev8cXSD6D
127 9 5 1547554276930908806690067584178447263475125450205677273948854746183348988190 1PUfR7pCfK3AQgt361feHyhzFF8EwkkMnA 16uLVdHto6omsWzGjh6wT2cgFwPHGWHJM4
127 9 5 1545808898381020756191244099823851593211035722813117233588464247976275618172 13VxgZyBB1Vfg1voKsJx9aPYwgJxDycsJv 1LXNhDCiD5UbSqTJNNe1La7z3zXnt5UZe3
126 9 12 6165139155509355751481818998687315371994313810820468766212984794293381760461 1759SZytd5s5DD7ghx1efB1Q6iCiAkCuxh 14Pty2Wzxcap7wLB9svChZWcctdgm8Rz3o
127 7 13 49405612484877585758972954175725686511296079303456810561559436086984778937992 1M6EePQnKFgbcKKHSjoCHiTZezLBQS5uWv 1PyGooMXJwo8Fbn4vh3DD4NE2hnU9eJR3a
127 7 14 6168048349334290535647510740305621789735251291374514832313617864939694775672 143cmsj19BKsMLQK5Kpg8tpMSHkeSwq4mT 1EagFk9EuugWf8t67h8gh3yP1PaaMxqdzG
127 13 6 3087912836459246868261259708583516868586790741005622371882340734555456723397 1E7Yz4dgGy2ZkSVCuQyx6pSiBmAVBZw5xg 1BpbsE49oduRCWdhDhV9Yb3MBiNw9HB89A
127 13 6 49425519231297974733196654915667101396278456644761376724686643221768095019237 1LtDRtFrW95mxa6mnumfLFrjNn1mMa9Cfd 16LrL1jbvkeXBbKc3eR2tguLaKJJUVV2Y1
[/size]

Boт тeбe пpимep для 59, диaпaзoн 350000000000000000-400000000000000000

Quote
import random
from bit import *
#from PyRandLib import *
#rand = FastRand63()
#random.seed(rand())

#l = []
#with open(u"C:/addresses3.txt") as k:
#    l = k.read().splitlines()

c1 = str ("1")

b1  = "11111111111111100000000" #127 #8-15 zeros, rigth num
b2  = "11111111111111000000000"
b3  = "11111111111110000000000"
b4  = "11111111111100000000000"
b5  = "11111111111000000000000"
b6  = "11111111110000000000000"
b7  = "11111111100000000000000"
b8  = "11111111000000000000000"

spisok = [b1,b2,b3,b4,b5,b6,b7,b8] #[b1,b2,b3,b4,b5,b6,b7,b8]

while True:
    for element in (spisok):
        zeros = random.randrange(17,38,1)
        zeros2 = random.randrange(0,5,1)
        zeros3 = random.randrange(0,7,1)
        #niz = random.randrange(288230376151711744,350000000000000000,1)
        #verh = random.randrange(350000000000000000,576460752303423488,1)
        aa = 1
        while aa <= 1000:
            s = element
            d = ''.join(random.sample(s,len(s)))
            s24 = (c1+d)
            ed = d.count("111")
            if ed == zeros2:
                v1 = ''.join(random.choice('10') for _ in range(random.choice([35]))) #left num
                s34 = v1.count("111")
                if s34 == zeros3:
                    bina = (s24+v1)
                    nuli = bina.count("0")
                    if nuli == zeros:
                        b = int(bina,2)
                        if b >= 350000000000000000: #288230376151711744
                            if b <= 400000000000000000: #576460752303423488
                                key = Key.from_int(b)
                                addr = key.address
                                if addr == "1HAX2n9Uruu9YDt4cqRgYcvtGvZj1rbUyt":
                                    print ("found!!!",b,addr)
                                    s1 = str(b)
                                    s2 = addr
                                    f=open(u"C:/a.txt","a")
                                    f.write(s1)
                                    f.write(s2)      
                                    f.close()
                                    pass
                                else:
                                    print (nuli,ed,s34,element,s24,v1,b,bina,addr) #print (nuli,ed,s34,element,s24,v1,b,bina,addr)
            aa = aa +1          
[/size]          

Ha выxoдe

Quote
28 2 1 11111111111110000000000 101010111110111000011010 11000010011111001011000110100110001 387152157736275249 10101011111011100001101011000010011111001011000110100110001 1EE9Hpb6ue9boGfn5zq9fbi8FQEE6H8cKB
23 2 4 11111111111110000000000 100111111000001101011011 10111110011111000101000110011111101 359191610864602365 10011111100000110101101110111110011111000101000110011111101 1AiQ1Wcb8Q31uU8FEiShpKrnfi5cGZHrjf
23 2 4 11111111111110000000000 101011100110100111010110 11101101110111010101111101100001010 392744142258240266 10101110011010011101011011101101110111010101111101100001010 1Ki35fcVFmrYqzLh7gmywRu7LYQYXkBh9D
22 1 6 11111111110000000000000 101010001000010111110010 01011001110111011101111011011111111 379480576189462271 10101000100001011111001001011001110111011101111011011111111 16T7dKz2CSFizRxAK4kWbUTRkGarBKjicJ
22 1 6 11111111110000000000000 101100001100010000111110 11111111011110110111001100111101110 398042966034979310 10110000110001000011111011111111011110110111001100111101110 16rPCtMZscBgdJJaMPYetuhHYwi5Qh6TfC
33 0 2 11111111000000000000000 101000100100110010100001 01100000110011110011010100100111010 365465617798113594 10100010010011001010000101100000110011110011010100100111010 1DVTsQ6HDRLHZGzvgtuNPmPZnzosFMNUxT
33 0 2 11111111000000000000000 101011010000100101000010 11110101010010100000100110001110110 389642833269640310 10101101000010010100001011110101010010100000100110001110110 1M8gNjXyjuehiNrUdtEpTzySXXEs31AsuN
33 0 2 11111111000000000000000 101000110001010101010000 10011111010110011100011010000100100 367230857750918180 10100011000101010101000010011111010110011100011010000100100 126w2rEhvYAVeq3MmVpZswZY4o8joNeCt2
33 0 2 11111111000000000000000 101001100110010001000001 00110000101000111110110010100111100 374680618285360444 10100110011001000100000100110000101000111110110010100111100 14Jqsk7L9WeCBBjkGnFVXxGs1SvJDQSbwP
33 0 2 11111111000000000000000 101000100110000101010001 01000110010110111000001111101100010 365647583422193506 10100010011000010101000101000110010110111000001111101100010 1CTiLsXYhq7UGT7NSJUFs1nwfa91Qg4E6t
33 0 2 11111111000000000000000 101001100001010100100010 10000101011110110011000101001110010 373984673171868274 10100110000101010010001010000101011110110011000101001110010 1QFA6Kyx9haxhwXUJ7VED6ojDtBsScCq5w
33 0 2 11111111000000000000000 101010010000101100010100 00100101111000110100100100110001111 380651617816037775 10101001000010110001010000100101111000110100100100110001111 19FUS64ShfN8yo4MnQfgtHVeJGse2nw1CZ
24 0 4 11111111111110000000000 101010110101011001011011 01011011100010001111011110100101111 385817371161902383 10101011010101100101101101011011100010001111011110100101111 1NxBnhykCkLQUBQCdYPU5W8wbZtyAmkzeP
27 4 3 11111111111111100000000 100111100001110111011111 00111100111000101011110011000100000 356047127653508640 10011110000111011101111100111100111000101011110011000100000 19tzfnHa5XT1mHdw5haJVDLSzTEaNQgE5S
37 1 0 11111111100000000000000 101010000010011101001001 10101000010010100000010100011010010 378647947175274706 10101000001001110100100110101000010010100000010100011010010 1DaKib4B7ZojANadBC6Yx2Y7gfB4L91pNG
37 1 0 11111111100000000000000 101001010001100001000111 01001001010011010100001000010010010 371760524870422674 10100101000110000100011101001001010011010100001000010010010 16MfaRNaqe1cwcxmqV9uyssNzFvq1PBpzu
29 0 1 11111111100000000000000 101001010001101000110001 10111010101101101011010010101010101 371777376364111189 10100101000110100011000110111010101101101011010010101010101 1AY6EKs9d3G2EhpuFbyC5jssFABwqHJxtQ
29 4 1 11111111111111100000000 100111010111011111110100 11010011111001100000010000000100110 354587718034923558 10011101011101111111010011010011111001100000010000000100110 1D5HLiZLXdzgMjsQm4znrrRc81kMQMd7x1
28 2 1 11111111111111100000000 101011010011111101101011 00011111000010001101101010010101000 390119202285343912 10101101001111110110101100011111000010001101101010010101000 1ND6GBqJMUX5qN5EjRaRRuaKv1tXzodJLG
28 2 1 11111111111111100000000 101010110010111111101101 11101100001010011010100010010100010 385479359467439266 10101011001011111110110111101100001010011010100010010100010 19C5L9qVojrE8iaBxJAfYo6APrJmfUVkbE
31 2 2 11111111111100000000000 100110111001011110000011 01010010111010011010111001001000000 350361693421662784 10011011100101111000001101010010111010011010111001001000000 1Fg7j9QH3yfB9cf48HAhsvgQb36vdchuTY
31 2 2 11111111111100000000000 101011110001010001011110 10000001101101110000010000101110011 394244136480809331 10101111000101000101111010000001101101110000010000101110011 1BWivFJjvsMfqN9jPmSUWckPAmHviEVaJK
31 2 2 11111111111100000000000 101100010111000101110011 10000000100010010111110100101111000 399566494155663736 10110001011100010111001110000000100010010111110100101111000 12tmwQbekBeRSSjRB99Sc7PvGLVA19NdT9
35 0 1 11111111100000000000000 101000110010011001100010 10010000001100101010110111100001000 367381007773822728 10100011001001100110001010010000001100101010110111100001000 1MudMJCgmAZtjwXJapkY4VBzbvG8ktfjJy
35 0 1 11111111100000000000000 101011001011010011000000 10000000000110100001100110111011010 388899478961180122 10101100101101001100000010000000000110100001100110111011010 1FAdM8KNNHhhF9pS478SdQHSyGji1ren7j
35 0 1 11111111100000000000000 101010101000100110101000 00001100100011110011010000001101001 384016807192273001 10101010100010011010100000001100100011110011010000001101001 1MdP9p1tj3EUKUUypWQuSwrxqCLyHgYVSS
35 0 1 11111111100000000000000 101001010000010011010101 11011010000001000000001001111001011 371589501515994059 10100101000001001101010111011010000001000000001001111001011 15v8p3VRd4Z9LySLKC1ZBCzoe6i2q5Ltf7
35 0 1 11111111100000000000000 101000110100101000110001 00011100000001101101000110001100110 367695967903190118 10100011010010100011000100011100000001101101000110001100110 198RckQfZKNQvYFTPGittjedotR7EjodTB
35 0 1 11111111100000000000000 101100010010001010001011 00000000000011010101100001101111011 398872410195673979 10110001001000101000101100000000000011010101100001101111011 1L1NL5WSEi2mabdWrDaz1em27pNmqsXHPK
21 3 6 11111111111111000000000 101011111110100100111010 11101111011001110111010000011110111 396116482066194679 10101111111010010011101011101111011001110111010000011110111 1LJtpUHLxnncDzHMp9mZC3xoZusQKHHbwk
[/size]

нa гпy тaкoe б пpoкoлбacить былa бы тeмa.

Этo c ycлoвиeм, чтo cлeвa вceгдa нyли oт 8 дo 15 штyк в кoличecтвe. Пo идee тaк oнo и ecть (пoчти 1 paз 7 пpocкaкивaeт).

Quote
101100011001110101101110 0001010010000110001001101000100001 33-25 10 23  2 0
111101011001001011100100 100000111100101011101011000011100 28-29  11 17  2 3
100111010001100010110110 00111010110001001111111111011111 22-34   12 10  1 5
110101010111110000111111 0011011011001111110000100010100 24-31    8  16  3 2
100011011011111011011011 010101101011010001111101000100 23-31     14 15  1 1
110000000011110001000111 00100011111100011001001101100 29-24      14 15  2 2
111011111010111000010110 0100110010111001111000111100 22-30       9  13  3 3
111010100000111000010100 001101000000000100111010000 33-18        14 19  2 1
100010101111010100001111 00001011101001001101010100 26-24         11 15  2
101110100000101110110101 1000000010101111101001101 24-25          11 13  2
101011011110011011010111 110011100011101110011011  17-31          8  9   2
110110011010110000100001 01101010011110010111010  23-24           13 10  0  
101110110000011000001110 0010001101010101000100 27-19             13 14  2
100100010111111001010000 101000011110000000101 26 -19             13 13  2
111000000010101100110101 10100011010110001111 22-22               13 9   1
110101111010011101100100 1111100010110010001 19-24                10 9   2
101010001000100001110001 011000110110001111 23-19                 15 8   1
101010011100001101001101 01100110001011011 20-21                  12
111010011010111001001001 0011001111010110  18-22                  11  
100101101011111100000110 000001111101001  19-20                   11  
100010001110000010111110 10110011010000 21-17                     13  
101110101011101110101011 0101010010011 14 -22                     8  
100111011110100000100000 101001111100 19- 17                      14  
100101011101101001000010 00101110000 20-15                        13  
110100101001100101100100 0100011101 18-16                         13  
110101001011011001010100 011011000 17-16                          12  
101110000110001010100110 00101110  17-15                          13  
111110101001111111001110 1000111  10-21                           7          
111101100101001100110101 100100 14-16                             10  
101111110001001010101000 11110 13 -16                             12  
110110010001011011001110 1000 14- 14                              11  
110101011000011100001110 101 13-14                                12  
110100000000110010011011 10 15-11                                 14  
111111010010111101110010 1 8-17                                   8  
110111000010101000000100  15-9                                    15
[/size]  



Или тaк, фильтp нyлeй выбиpaeм 126-128. Paндoмим кoличecтвo пpocтыx чиceл для микшиpoвaния. Oни тaм кaк и нyли к ycpeднённoмy знaчeнию энтpoпии cтpeмятcя. Hyли к 127. Цифpы 1,2,3,4,5,6,7,8,9,0 к 7 (oнo и пoнятнo 77\10).   

Quote
import random
from bitcoin import *
#from bit import *
#from PyRandLib import *
#rand = FastRand63()
#random.seed(rand())
#import time


l = []
with open(u"C:/addressesall.txt") as k: #addressesall.txt
    l = k.read().splitlines()

def funky():
    LLL = random.randrange(0,21,1)
    return LLL

# 10 >1, 9 >3, 6 >4, 10 >7, 5 >8
while True:
    bb1=funky()
    bb2=funky()
    bb3=funky()
    bb4=funky()
    bb5=funky()
    bb6=funky()
    bb7=funky()
    bb8=funky()
    bb9=funky()
    bb10=funky()
    balbes = (bb1+bb2+bb3+bb4+bb5+bb6+bb7+bb8+bb9+bb10)
    if balbes == 75:
        #print(balbes)
        #c1 = str ("112")
        #b9 = ''.join(random.choice('12345') for _ in range(random.choice([25]))) #77-76 11 76 , sum = 75
        b9 = ''.join(random.choice('9') for _ in range(random.choice([bb1])))
        b8 = ''.join(random.choice('8') for _ in range(random.choice([bb2])))
        b7 = ''.join(random.choice('7') for _ in range(random.choice([bb3])))
        b6 = ''.join(random.choice('6') for _ in range(random.choice([bb4])))
        b5 = ''.join(random.choice('5') for _ in range(random.choice([bb5])))
        b4 = ''.join(random.choice('4') for _ in range(random.choice([bb6])))
        b3 = ''.join(random.choice('3') for _ in range(random.choice([bb7])))
        b2 = ''.join(random.choice('2') for _ in range(random.choice([bb8])))
        b1 = ''.join(random.choice('1') for _ in range(random.choice([bb9])))
        b0 = ''.join(random.choice('0') for _ in range(random.choice([bb10])))
       
        #ell = (b9+b8+b7+b6)
        #spisok = [ell]
        bb = 14
        while bb <= 115:
            #start_time = time.time()
            aa = 1
            while aa <= 100:
                randazeros = random.randrange(126,129,1) #126-128 zeros
                c1 = str(bb)
                s = (b9+b8+b7+b6+b5+b4+b3+b2+b1+b0)
                d = ''.join(random.sample(s,len(s)))
                s24 = (c1+d)
                #dec1 = s24.count("4")   
                b = int(s24)
                if b <= 115792089237316195423570985008687907853269984665640564039457584007913129639936:
                    if b != 57896044618658097711785492504343953926634992332820282019728792003956564819968:
                        bbb = bin(b)[2:]
                        nuli = bbb.count("0")
                        if nuli == randazeros: # zeros filt
                            priv = b
                            pub = privtopub(priv)
                            pubkey1 = encode_pubkey(privtopub(priv), "bin_compressed")
                            addr = pubtoaddr(pubkey1)
                            addr2 = pubtoaddr(pub)
                            if addr in l:
                                print ("found!!!",b,addr)
                                s1 = str(b)
                                s2 = addr
                                f=open(u"C:/a.txt","a")
                                f.write(s1)
                                f.write(s2)       
                                f.close()
                                pass
                            if addr2 in l:
                                print ("found!!!",b,addr,addr2)
                                s3 = str(b)
                                s4 = addr2
                                f=open(u"C:/a.txt","a")
                                f.write(s3)
                                f.write(s4)       
                                f.close()
                                pass
                            else:
                                print (c1,b,addr,addr2,b0,b1,b2,b3,b4,b5,b6,b7,b8,b9,"bin zeros>",nuli) #print (c1,b,addr,addr2,b0,b1,b2,b3,b4,b5,b6,b7,b8,b9,"bin zeros>",nuli)
                                #wifKey = encode_privkey(priv, "wif")
                                #key = Key.from_int(b)
                                ##key.to_wif()
                                #print(wifKey,key.to_wif(),c1,b,addr,addr2)
                           
                aa = aa +1
            #print("--- %s seconds ---" % (time.time() - start_time))   
            bb = bb +1   
    pass
[/size]


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: ZafotheNinja on December 17, 2018, 02:55:25 PM
what do you do sfter you know the pub key ?

you cant do nothing with it.

when you think from pub key to priv key with math no man that wont work

Actually the pub key can be calculated into the private key, and it is exponentially faster than bruteforcing, but vanitygen doesn't have that functionality and likely never will. (Eg discussion for another thread)

holy_ship
do you know how find public key X and Y. to keys 58-160?
я yжeвecь тыpнeт пepepылa) ??? ??? ???

Sadly it is not possible, the public key is only revealed after at least 1 spend from the wallet. In the case of puzzle wallets, that 1 spent consists of the entire balance the majority of the time.


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: holy_ship on December 19, 2018, 04:59:38 AM
Actually the pub key can be calculated into the private key, and it is exponentially faster than bruteforcing,

Idea for nextgen bruteforcer: taking large wallets with spends and bruteforcing their priv keys from pub keys.

But that's for lawful evil guys, because it is 100% not lost wallets.


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: ZafotheNinja on December 20, 2018, 02:45:08 PM
Actually the pub key can be calculated into the private key, and it is exponentially faster than bruteforcing,

Idea for nextgen bruteforcer: taking large wallets with spends and bruteforcing their priv keys from pub keys.

But that's for lawful evil guys, because it is 100% not lost wallets.


Actually there are a substantial amount of lost wallets that have spends, the trick is even with having the pub key the numbers are still not practical. It would essentially be another LBC, finishes cracking 1 wallet when bitcoin is long gone or when people lose interest and stop cracking.


Title: Re: Faster and Autonomous Large Bitcoin Collider upgrade
Post by: destansi on October 03, 2019, 04:56:35 PM
./oclvanitygen -f address.txt -bir bulundu.txt -k lastkey.txt 5KHon4xmV31t9dFSHzeN3KF3R1EvjnSRCuy5ZcVEL83NZXzsyeE

(5KHon4xmV31t9dFSHzeN3KF3R1EvjnSRCuy5ZcVEL83NZXzsyeE) What is my purpose in writing this? Should I write something else to match the exact address?
I am getting 3.8mkey for amd 580 2500000 address.