 Show Posts
|
|
Pages: « 1 2 3 4 5 [6]
|
For the #57 key instead: #define GSTEP (1<<28)
typedef struct hashtable_entry {
uint64_t x;
uint32_t exponent;
} hashtable_entry;
#define HASH_SIZE (2*GSTEP)
hashtable_entry table[HASH_SIZE];
I use 32 bit for the exponent (32 > 28) and I store only the first 64 bit of the x coordinate (there is a low chance to have a partial collision in a list of 2^28 element, i.e. two different x with the same first 64 bit) --> (64 + 32 bit) To avoid any collisions you should use always 256 bit for the x coordinate. And the size of the hash table should be at least two times the size of the list you want to store. Thanks again arulbero. Now I see why you're legendary.  |
|
|
|
With brute force I would need to use 2^56 different private keys to generate 2^56 public keys. Too much time. But If I knew only the address and not the public key, that would be the only way.
Could you briefly describe what this process would be like, if you can? In terms of possible time to generate, and space to save the results. What I think you're saying, if I understand it, is that you would generate all 56-bit private keys, for unsigned integers that would be 2^56 - 1 private keys, or 72,057,594,037,927,935. Wow, 72 quadrillion, 57 trillion and so on. Then generate a public key for each of those 72 quadrillion+ private keys. But, if you don't know what the private key is, to solve a puzzle, this would be a fairly insane process of using a lookup table perhaps. Suppose only compressed public keys are computed for each private key, then compute sha256(pubkey) -> ripemd160( sha256(pubkey) ) for the Hash160 of the address, or just go a step further and use the Base58Check address list from the public keys. So in other words, the only method here is to have a huge lookup table, and if you have a massive RDBMS for it, then select privkey from lookup_table where (hash160 || base58check) = target_address, and hope you get a hit. I suppose there would be a better way to implement a lookup table, like cutting some bits off the hash160 or base58check address, then do a lookup on priv_key where first 64 bits of hash160 = first 64 bits of target hash160, and maybe one will pop out. Still, a massive operation. Assuming billions of keys per second, that will still take a heck of a long time, not to mention the computation of the public key and other operations from each of the private keys, and the space needed to store the lookup table or database. |
|
|
|
(Python) > p=0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F
>
> x=0x78D430274F8C5EC1321338151E9F27F4C676A008BDF8638D07C0B6BE9AB35C71
>
> x3=pow(x,3,p) --> x^3 = x^3 mod p
>
> y2=(x3+7) % p --> y^2 = x^3 + 7 mod p
>
> y=pow(y2,(p+1)/4,p) --> this line computes sqrt(y^2) = y
>
> hex(y)
'0x5eae7f9cdbc532b201694991c0d137fec371f8d32f64c7cb5e607e08a633c7da'
>
because this y is even, we compute -y = p-y (if y is even, p-y is always odd and viceversa)
>
> hex(p-y)
>'0xa1518063243acd4dfe96b66e3f2ec8013c8e072cd09b3834a19f81f659cc3455'
then: A1518063243ACD4DFE96B66E3F2EC8013C8E072CD09B3834A19F81F659CC3455 : y (odd) uncompressed key = '04' + 'x' + 'y' 0478D430274F8C5EC1321338151E9F27F4C676A008BDF8638D07C0B6BE9AB35C71A1518063243ACD4DFE96B66E3F2EC8013C8E072CD09B3834A19F81F659CC3455
Wow, thank you for posting this. I was driving myself insane trying to understand more of the math and how it's actually implemented, trying very small values from links like this one: https://www.coindesk.com/math-behind-bitcointo get a feel for it. I think I'm getting there. I hope that ordering and reading Mastering Bitcoin: Programming the Open Blockchain will help with the math, and trying to write my own blockchain parser. I'm not a math heavyweight, so I have a couple of questions if you have time: From what I understand so far, there are constants that are always the same in Bitcoin. This includes the Q (curve generator), the p (for mod p), taken from your code and which I noted in the link to coindesk. I couldn't see how the order was calculated, given other values. Can you briefly describe what a base point is? I think I'm getting a decent idea of what a finite field is. When trying to find: y=pow(y2,(p+1)/4,p) --> this line computes sqrt(y^2) = y
Is this always how it's done, for any y2, p is always the same, and the (p+1)/4 part is constant as well for getting y from y2? Thanks again! |
|
|
|
here are the other pvk decimal values I was able to find:
Address 15: 26867
Address 16: 51510
Address 17: 95823
Address 18: 198669
Address 19: 357535
Address 20: ?
I think these are correct, but I haven't had time to verify yet. Address 15: (I missed that one for some reason), I'm not entirely sure what the keys for these are just yet. I'll check them out this evening. List of priv keys in hex, then decimal: 3 7 8 15 31 4c e0 1d3 202 483 a7b 1460 2930 c936 1764f 3080d 5749f d2c55 1ba534 2de40f 556e52 dc2a04 1fa5ee5 340326e 6ac3875 d916ce8 17e2551e 3d94cd64 7d4fe747 b862a62e 1a96ca8d8 34a65911d 4aed21170 9de820a7c 1757756a93 22382facd0 4b5f8303e9 <= Address 39 122AJhKLEfkFBaGAd84pLp1kfE7xK3GdT8 3 7 8 21 49 76 224 467 514 1155 2683 5216 10544 51510 95823 198669 357535 863317 1811764 3007503 5598802 14428676 33185509 54538862 111949941 227634408 400708894 1033162084 2102388551 3093472814 7137437912 14133072157 20112871792 42387769980 100251560595 146971536592 323724968937 <= Address 39 122AJhKLEfkFBaGAd84pLp1kfE7xK3GdT8 Very interesting. Took me less than a day to get all these, but cracking up much higher for unclaimed is going to be really hard, unless I can do something more intelligent than just a brute force. Which is what I'm working on of course, there may be something there to find. |
|
|
|
Hi. I probably misunderstood something.
In your example #57 (first 200 bit + last 56 bit) =
0000000000000000000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000011101011001001011100100100000111100101 011101011000011100
HEX: 00000000000000000000000000000000000000000000000000eb25c90795d61c => 1J9zB6p4dRgyinst2eCVsyXvgYXtNhw2Y2
This is not a private key for #57
What did I miss?
I forgot '1' at the beginning of the number: last 56 bit of the private key#57: 1101011001001011100100100000111100101011101011000011100
but there are only 55 bits Correct--> last 56 bit of the private key#57: 11101011001001011100100100000111100101011101011000011100
0000000000000000000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000011110101100100101110010010000011110010 1011101011000011100 HEX 0000000000000000000000000000000000000000000000000 1eb25c90795d61c Thank you Yes, that was the correct hex key for #57. I hope you got to spend it! |
|
|
|
Has anyone tried to build this on Linux? I have CUDA devices, and looked at the Makefile. CUDA 9.2. Installed that, but I'm not getting anything. No errors, just no binaries. The libraries seem to get built. By default they go in CUR_DIR/bin CUR_DIR/lib. Does anyone know what I can do to try and build the project on Linux? As far as I know, there shouldn't be any real issues with differing CUDA versions 8 to 9.2. Thanks, looks interesting. Nice rewards for trying the puzzles. I wonder if there's a better method than just brute-forcing more and more? Unless there is no point; they're just there to be claimed later as a measurement of compute power over the years and how quickly the BTC gets moved. In that sense, not a real puzzle. Just, how long until this gets cracked? Interestingly, larger amounts have been claimed. Ones in the middle not claimed yet. Perhaps not worth the effort to figure out if there is a real method to the madness, or not enough reward for compute effort. Thanks, if you've managed to compile on Ubuntu, and what did you have to tweak to get it working... |
|
|
|
Hi, I was wondering if anyone's had any success mining DEFCOINs with FutureBit Moonlander 2 USB sticks. I have tried CPU mining which worked at defcoin.secdsm.org, on port 55555, not with GPU mining though. The mining software said it was hiding the blocks from me, whatever that means. If you've mined some DEFC with a FutureBit Moonlander 2 stick, please post your experience? I'd love to order a batch of 10x FutureBit Moonlander 2s and one or two decent USB hubs and go for it Thanks! |
|
|
|
What I hope for is that FutureBit Moonlander 2 devices will mine DEFCOINs. The PoW is scrypt-jane, whatever that is (a combination of algorithms not just e.g. SHA256?) and it seems that regular scrypt mining works for DEFCOIN. I've tried with cpu mining and just giving the miners --scrypt is fine, so these devices should work. So, I'm definitely giving this a try. I'm starting with 3 devices and I need a hub, but I'd like a hub that can eventually power 10 FutureBit Moonlander 2 USB sticks. Are there any special considerations for these hubs in Australia? Or will any just work by plugging into a laptop? How many USB (2? 3? other?) ports do I need to plug in a hub? I have an extension device, an Alogic that plugs into a smaller port on the side of my laptop to give me an extra external monitor port, ethernet port, dvi port, and 2 USB ports, along with SD card reader. Will this do the trick, if anyone knows? Could I plug a hub into this, or will I need a spare USB port on my laptop to plug in the hub? Thanks for any info. |
|
|
|
Yeah there are sometimes that I have been encountering a problem like this but I consider this problem as minimal since I can managed how to continue post even if will going to have an error. You should get a good browser like google chrome or mozilla firefox for everytime you will go back to your history all of your post could be retrieve. Copy all your post and reopen the thread you want to give a reply and then click post. Problem will solve easy as eating a pie.
Probably there were still some other way to do this but this is how I do it.
Thanks! I'll check out that solution if I have any more issues. For me it seems to be resolved now. I use the latest Chrome and Firefox browsers. I don't think that makes much of a difference (I even tried Edge on a Windows system) but it's good now. Cheers for the steps and screenshots. |
|
|
|
|
Hi,
I'm trying to mine defcoins. I have Tesla V100 GPUs and CUDA 10.0. Running Ubuntu 18.04LTS.
./ccminer
*** ccminer 2.3 for nVidia GPUs by tpruvot@github ***
Built with the nVidia CUDA Toolkit 10.0 64-bits
Originally based on Christian Buchner and Christian H. project
Include some kernels from alexis78, djm34, djEzo, tsiv and krnlx.
BTC donation address: 1AJdfCpLWPNoAMDfHF1wD5y8VgKSSTHxPo (tpruvot)
[2018-11-09 11:33:57] Your system does not support CUDA 10.0 API!
I'm stumped. Everything else seems to work, but not ccminer. I must be missing something obvious... any tips? Thank you.
|
|
|
|
Is there a way to fix this permanently?
just be patient... once you reached 15 activity, you will only have to wait ~1 minute or as suggested by BitMaxz, you can buy Copper membership  Got copper, thanks! Just had to search then come back here and find out how to wear it. Thanks everyone, appreciated. |
|
|
|
Here is the information for the address
EDIT: Was told that this information is necessary, so here you go
"mkey": {
"encrypted_key": "3ce2900d6c2df58a1cfa9ea1755a1599e0b60001fcd29d730c298de7538e3a0709e4fdb738d8ac6 1b5b03c582d724214",
"nDerivationIterations": 80062,
"nDerivationMethod": 0,
"nID": 1,
"otherParams": "",
"salt": "d07e66c2606ae4fc"
},
Is there someone who can help me try and recover with this information above? I can see it in bitcoin2john.py, but I think I don't need the wallet.dat, is that correct? He can run the python script and post the hash, which is safer. Then all that anyone can do is recover the password for wallet.dat, but not the private key(s), so the funds cannot be stolen. (Is that correct?) Otherwise he could share wallet.dat with someone if he wants to, with some detailed information about the person recovering for some assurance that he could hit back if the funds are stolen. There is also another address within the wallet that has 3 btc that i am hoping to recover. I will give the person who produces the successful password 0.5 in addition to the address above, but I guess youll have to trust me on following through.
Crack this wallet and feel free to take the money, but please message me the password! Or post it here
Just a bounty you feel is worth the recovery, if successful, otherwise cost of recovery is sufficient. I forgot the password i used back in 2013 and im dying to figure it out so i can take funds from the other addresses in the wallet. I really don't remember anything about the password but it wasnt very long
Also, does anyone have any time approximations for bruteforcing according to password length? Such as
5 char = xx min
About 3.5 hours for me, assuming charset a-z, A-Z, 0-9 (62 possible characters in pwd) 6 char = xx min
About 9 days, with above charset. Or just a-z or A-Z (either) and digits: 8 hours. 7 char = xx min
With just lowers or uppers, and digits: 9 days. With charset a-z A-Z 0-9 for me, about 226 days. That assumes 75,500 h/sec. With charset a-z A-Z 0-9 length 8 chars, again with 75,500 cracks at wallet.dat per second in a rather blind fashion, the entire kespace: 95 years or so. This assumes cracking the latest Bitcoin Core wallet.dat. I could give it a good go with the info I need and estimate cost/time, or I might just get lucky with the possible passwords you posted and some good rule sets with my own scripts derived from others that generate candidates from known (or guessed, and not quite correct) information. Let me know if you'd like me to have a crack at it... I can double my compute power at least, so I might have a reasonable chance. There are some other possibilities for address 12KGAcU47BhCSQJCN9r2dHAvhDALMVsJkk. I might give those the old college try. It's a bit of a stab in the dark, but worth a shot for a little while to see what happens. I'll post back if I get any interesting results. Some of them I will have to ask for help with, so I could be a few days. Good luck! |
|
|
|
Thanks! That was a very reasonable donation to participate a bit more. I think one problem I had was removing my proxyban "units of evil." |
|
|
|
|
I keep getting a message that my last post was within 360 seconds ago, which is not correct.
Is there a way to fix this permanently?
Thanks,
|
|
|
|
|
Username digitalcitizen @ bitcoin wiki.
Would like to participate in discussion and if the bits of information I have are correct, update some parts of pages with additional useful information.
Thanks,
|
|
|
|
|
