|
It's been almost 2 weeks, can we just null out the empty slots(next block if empty?) and run 1st,2nd and 3rd place winners?
|
|
|
|
Dont get me wrong you can still make good money but not coin, mining BTC with asic's. 90% of BTC is mined whereas retail investors are getting penciled out, and the rest are fighting for the last 10% while difficulty is all time high. Thes best bet right now is to simply buy the coin, by time the next price movement happens difficulty will no doubt increase making it all the much more difficult to obtain. The next best thing is alternative mining resources such as jumping on board new minable coins pretty much so as soon as they are announced. Most retail investors are on nicehash or some platform that provides ease. If you're ahead of the curve, you'll have a bag already of one of these coins by time these platforms/institutions adopt. comparable historical coins are things like. CFX(octopus) Firepro Ergo(autolykos) To be clear I'm not harping bitcoin mining I love it, Maybe ill snag one of these intel based rigs if they ever hit a consumer market Main reason I've exited asic farming is what I like to call the bitmain game, design hardware, build hype , say it wont be out for 12 months while running it until you make the next best thing, release the 2 year old gear. This nifty gear wont be out for another 8+ months yet here's a rack of em running (pic from reddit might be fake) https://ibb.co/JjStKTv By time you get one and have mined it a year and made 13-17K halving happens and other new gears out or announced. 3P upgrades or simply buying buildings as close to you can by substations. At the end of the day its great money, but its an endless cat and mouse game in less than 6 years over 98% of bitcoin will be in circulation. I'm planning ahead and just buying coin, or trading shitcoins for it that are much easier to accumulate and acquire. Or simply selling. Whatever suits my situation. |
|
|
|
I understand it is value corresponding to the given RIPEMD160 hash, right?
right, something to do with the bits 16bit or 32bit there's a pivot that determines the bitrate utilizing ripemd160 and some formula. however, all the weight of the characters don't seem to add up no matter how I crunch them with the information I have access to, 0,1,2 seem to be the correlated weights per character (I could be wrong here) ,they didn't seem to have anything to do with 1,2-Q,R-z either considering 1QLbz6 is lighter than 1QLbz7. |
|
|
|
11111111= 72057594037927936 (96 days) ***
111111113= 173346595075428800 240 days *** This can't be right, right? The second one has only 2.4 times higher difficulty than the first. According to vanitygen, it should be 5.7 times more difficult. According to vanitygen, 1113 is 69 times more difficult than 111, but 111113 is only 3.5 times more difficult than 11111. I don't get it. The part where I was asking about pivots  1QLbz6 VS=264,104,224 1QLbz7 VS=264,104,224 VG=837,596,142 (true difficulty) 3.165 ~ difference I've been asking all along for help with the pivots. But no one has answers to the witchcraft involved. So the above formula's excludes it/pivots. Since Vanitysearch doesn't factor them in I dont know how to tell. I tried figuring out how PCRE does it but im not savvy in how it was wrote. Aside from Nonce , no ones even bothered or acknowledged me asking about pivots or admitted JLVS is wrong on calculations involving pivots. |
|
|
|
splitkey looks like a really nice service!
out of curiosity, please can you give a quote and time estimate for these prefixes:
1111111
11111111
11111113
111111113
1111111MM
testing with 12000mk/s (1 rig) 1111111= 281474976710656 Under a day ~$80 11111111= 72057594037927936 (96 days) *** 11111113= 2988734397852220 About 2 weeks ~$650 111111113= 173346595075428800 240 days *** 1111111MM=10054102514374868992 36 years *** with the entire farm's applied we can confidently estimate half the time at about 24000 mk/s We haven't plugged in the entire farm yet to see total key counts to accurately quote times against total keys per second. *** with problems like these we would rent lambda A100 x16 sxm4 systems to knock em out we wouldn't splitkey in this case just set you up to find it yourself on rental and youll find it in less time. we'd charge a percentage for non split key and you revoke ssh key after we set you up considering you know about the trailing numbers being X256 time's more difficult we could assume you can operate a remote server, again this service is geared towards retails investor's not script manipulators or trailing number seekers that can do it on their own. Odds are we are going to deny trailing 1 orders,its to difficult to make the client side calculator work in this instance and c# starts struggling/breaks. We will probally just do email request for these pivots and trailing 1's orders |
|
|
|
Probably already out of space it's hard to find open space for bulk miners right now down here in TX. |
|
|
|
I have LB1 that I can part with,how much would you offer for it?Also where are you located so I can check shipping price?
I'd offer about $250 for that unit, although I'm certain you could get more on ebay , the one I linked to is the cheapest working unit I saw that's sold in the last 32 days. $250 is fine.What’s your ZIP? 76706 PMed you |
|
|
|
I have LB1 that I can part with,how much would you offer for it?Also where are you located so I can check shipping price?
I'd offer about $250 for that unit, although I'm certain you could get more on ebay , the one I linked to is the cheapest working unit I saw that's sold in the last 32 days. |
|
|
|
-snip Vanitygen gives slightly different values for some: Loyce thank you so much for checking those out! I expected about a %4.35 variation max due to rounding differences sometime base numbers are different too. such as 23/24(4.35%) , and 1330/1334/1354 (1.80%) but reading below I think we can reduce the error rate down to 1.8% overall. These rounding differences only really show themselves when dividing the difficulty. for example 264,181,648/58^3= 1354 (My method) or /4 for 23.34 264104224/58^3= 1,353.60318176227 (VS) /4 for 23.33 259627881/58^3= 1,330.660753823445 (VG) /4 for 22.94 260,474,520/58^3= 1335 or /4 23.01 what VG should show given they use 1335 as R-z difficulty From what I see I think I can cancel out 4.35% error rate and reduce it down to about 1.7539591597%(using 13XX) or 1.743679163 (using 22.94-23.34) I typo'd 1111A = 264104224 1354 * 58 * 58 * 58 forgot a * 58 operation Another reason this is important that it reflects onsite near the same as the searcher programs is the handler software can use any prefix finding software. Thank you guys for the help , if we can figure out the whole pivot thing VG talks about that would be cool too but I wont push my luck  |
|
|
|
I found this browsing around this evening TRM has a BS @ 4% TRM Github but only for eth on the following devices Xilinx Varium C1100 SQRL Forest Kitten 33 - performance limited by product design, see guide for details Xilinx/TUL/Osprey U50C/ECU50 Seems moot with 2.0 right around the corner. |
|
|
|
My 9 year old wants to get into mining without it being to disruptive, I figured I could trade for a simple unit or make a micro mining tower out of this 5700xt She would prefer the voskcoin doge miners for aesthetics lets make a deal I personally dont see these things valued right on ebay looking at it from a money standpoint vs the gpu, so if nothing realistic hits I'll just paint and sticker a small atx case with the gpu. but hey, figured it worth a shot. escrow with Philipma1957 if need be. 5700xt Whattomine 5700xt profitsGoldshell ST-BOX Aug 2021 13.92kh/s 61W 35db CryptoNightR $1.46/day Goldshell HS-BOX May 2021 235Gh/s 230W 35db 2 $0.44/day Goldshell LB-BOX Aug 2021 175Gh/s 162W 35db Lbry $0.44/day Goldshell Mini-DOGE Jul 2021 185Mh/s 233W 35db Scrypt $0.40/day Goldshell CK-BOX Jul 2021 1.05Th/s 215W 35db Eaglesong $0.30/day Goldshell LB1 Apr 2021 87Gh/s 80W 55db Lbry $0.22 |
|
|
|
|
On a side note, I think I've solved the site calculator heres a breakdown excluding the pivot witchcraft (to me)
PLEASE tell me if I'm wrong and point me in the right direction, if I'm right the site will go live soon with accurate(affordable) pricing
-snipped edit solved
|
|
|
|
Curious as to the amount of gear has to run to do what you do.
Also Could a remote miner be added?
Ie I have a rig with 11x rtx a4500 cards and 1x rtx a5000 cards. could it pool to your setup?
I also have 2 rigs with 12x rtx a4000 cards
I know your state is nowhere near NJ but if the project could allow remote rigs to tie in you could do 10 or 12 custom vs 7
Its a yes no thing, as mentioned here. We can link miners everywhere/anywhere and grow the MK/S, as for now we cant check key count honesty. We can only determine based on what you input in this software.  We haven't decided if this handler tool will be open source or not. So far the only thing that is OS is the merge tool built off bitaddress.org To clarify we can do certain difficulties for free in some instances that's up to 7 digits usually in under 5 mins 1Philipma1957's (case insensitive) Difficulty is 36446121614608900096 would take about 130 years with 12000 mk/s for one result that may not even be correct if it Wasn't splitkey 130~ years on the first try. If you double the the key count, you can half the time estimate. 1Philipma (case insensitive) Difficulty is 3,220,618,963,203 we could get one result every 5 mins. ~ @12000 mk/p for example just testing it to snag the difficulty PubAddress: 1PhiLiPMAXUoMbCBqZCJbiVYzjAyQYF9zL Priv (WIF): p2pkh:L2piDYLuwW4TrYVKtEVQ5kPsBuVFQDRzqeLgwFnUVqzQTV2CF1zV Priv (HEX): 0xA7314E00BE8FDCCF7C5A7AA2F2BB5AB5672037018A25DEF960503B9D299177F9 got a hit with 1 of 3 machines with the software installed, (wasnt splitkey) 1Philipma19 (case insensitive) Difficulty is 1910834162192214300 putting out 1 result every 10 days or so, (we go for master key not the others we check your pubkey vs our partialpriv in another headless html pruned version of bitaddress.org) So 10 digits is doable , this testing was done on one rig, we have 3 in test with 2 more to add , start tossing in 24 x a4000's and 11x a 4500's we could slim these estimates down a lot , Our plan for 9+ digits was to just rent 16x sxm4 lamda rigs, We've debated releasing an opensource splitkey vanity handler for "Pooling" software does callback with key estimates and we provide discount based on the contributed keyspersecond. Not case sensitive , but 1PHiLiPMA is going to be fastest route to find Kinda like mining rig rentals with some slick workarounds for validations instead of full blown pools. We would autoconfigure your arguments via cli wmic or smi ect and run your results against a database of card speeds that are logged in a database We have to figure out this difficulty/pivot stuff for precise accuracy though. If you wanted to run your speeds for me I could give you more accurate estimates based on what I know, VanitySearch.exe already compiled. with that kind of gear you could surely get 1PhiLiPMA before you go to bed. Our quotes are broken right now until I get help figuring out the the broken formula in the main post adding the extra *58 operation. Our quote for 1PHiLiPMA says difficulty=294,545,08,795,143,700 but 1PHiLiPMA is really 51,529,903,411,245 So we have 1 *58 operation too many in the code above. |
|
|
|
If, however, you would search for "tt", the difficulty drops by 75% because you're now searching for 4 different prefixes: ./vanitygen 1tt
Difficulty: 78508
./vanitygen -i 1tt
Difficulty: 19627
./vanitygen 1tt 1TT 1tT 1Tt
Next match difficulty: 19627 (4 prefixes) Perfectly explained. In other words, if you have case sensitive difficulty X, case insensitive difficulty will be X/(2^(number of [a-z] characters)). 1t 1T - 2^1 = 2 possibilities 1tT 1TT 1tt 1tT = 2^2 = 4 possibilities 1TTT 1TTt 1TtT 1Ttt 1tTT 1tTt 1ttT 1ttt = 2^3 = 8 possibilities etc. so 1-9 and o,i & L are excluded right? so as 1oojoo1 -i really is simply put = 444223305269 Thanks, maybe I was overthinking it. solution= Diff/(2^(number of [a-z] characters) so 1oojoo1= 888446610539 with -i/-c = 444223305269 Moving on from the case insensitive formula questions here's a different issue I'm encountering. PawGo, I know how the script works I came up with it and overgril parsed it up, but somethings wrong with it because it excludes 16/32 pivots and it's doing a wrong operation /58 and *58 somewhere in it. , I need to understand the pivots better why does. 1QLbz6=264,104,224 but due to a pivot I don't understand 1QLbz7=837,596,142 VanitySearch doesn't calculate this correctly. (I've basically learned all I know on B58 off JLVS deconstruction) Vanitygen does , however I don't understand how the conclusions are met, https://github.com/samr7/vanitygen/blob/master/pattern.cwhat in the witchcraft is PCRE? ( https://www.pcre.org/original/doc/html/pcre_exec.html) can you help me simplify this in the same way you did this X/(2^(number of [a-z] characters)) If I'm using JLVS calculation method and come to the conclusion that 1QLbz7 = 264,104,224 thats a miscalculation and will cost me. |
|
|
|
We are building something special, still working on a difficulty calculator like no other so we can offer up to 7 digits free We could use some help solving this here as we have discovered JL's VS difficulty calculator is inaccurate at some points/pivots/bits. problem is our difficulty calculator has to be more accurate than even vanitysearch's, so our quotes will be accurate so we dont operate at loss or email you guys saying we cant do it. We run about 16,000 MK/S with -sp applied (so far) We run a combination eth mining rigs to achieve this with proprietary software assigning workers, logging speeds and an api callback server relaying said data. We've essentially created a real vanity searching mining pool(workaround) , We plan to use smi or wmic to pull card data and catagorize speeds against collected data such as DaveF's list and auto configure arguments. and relay to website for time estimates. even a simple 7digit case insensitive can be done in under a few mins, It's like not hitting a mining share for few mins. Our quotes are still broken, until we solve for a few x's on difficulty calculations via pivots/bits We have a few other bugs to work out. emails being marked as spam, or our personal smtp server not sending email in the first place thinking we are sending spam We do not want to quote on wallet length like all the competition does. Our process if fully automated. This has been a work in progress for about 16 months. Some of you tried our google form based beta. We took all the feedback with grace and went back to the drawing board. We are not targeting guys like you that already know how to do it but if you lack power please feel free to use our service when it's officially announced. We accept BTC and LN ,(implemented and tested working) Again, the service isn't ready but at this point right now feedback is crucial as we near launch. We strive to be the definitive service in splitkey generation. I offer you guys a preview at 1splitkey.com  |
|
|
|
-snip
1QLbz6
VS=264104224
SK=3864628649984
1QLbz7
VS=264104224
SK=3864628649984
(But neither are right true difficulty on this is 837,596,142) His estimates are wrong as they get more complex with pivots. he focused on length. *we are only focusing on legacy for now until its mastered. **went ahead and soft announced the service here so people can see what kind of equity has gone into it and see its already been executed and not a side thought. I figured it wouldn't hurt to ask for help in there either , I've seen some of the brightest minds on BCT in that one topic. |
|
|
|
Hi,
It is very simple script, what do you need exactly? Description how it works?
Let's define 2 groups:
G1 = characters "234567890ABCDEFGHIJKLMNOPQ"
G2 = characters "RSTUVWXYZabcdefghijklmnopqrstuvxyz"
Ignore the first character.
Check second character: if it belongs to G1, set value as 23; it it belongs to G2, set value as 1354, if it is "1" set value as 256
Check each character, from 3rd to the end, and:
if character is "1", and there were only "1"s from the 3rd position, multiply value * 256. It there was already other character than "1", multiply value by *58
if character belongs to group G1, multiply value by * 23 (and remember that there was other value than "1", so multiplier for "1" is changed)
if character belongs to group G2, multiply value by * 58 (and remember that there was other value than "1", so multiplier for "1" is changed)
or you have results and want to find formula to produce them?
Please, explain what is your problem
The above code is an attempt to solve the difficulty calculation for Vanity wallets. The code is pretty close, but not quite there. I'd like to know if someone has any idea, or perhaps working sample (any language allowed) to calculate this difficulty. I've found several posts detailing how to calculate it, but they've all been speaking in tongue soo far (or gave incomplete answers). We designed this script to attempt a lazy calculation of difficulty but are learning what we reverse engineered was also inaccurate. VanitySearch So here is a list of sample difficulties with the above script labeled SK against Vanity Search difficulties labeled VS. we are missing multiple marks such as pivots against 1QLbz6 and 1QLbz7 Please note we expect about a %4.35 error ratio and this is fine. Fact Check Difficulty 1Chicken VS=888446610539 SK=50783635853696 1BiLL VS=4553521 SK=260279408 11111 VS=4294967296 SK=98784247808 111111 VS=1099511627776 SK=25288767438848 1RR VS=78509 SK=77372 1Ric VS=4487576 SK=4553521 1Rick1 VS=15318045009 SK=15096205664 1BtcTo VS=264104224 SK=15096205664 1btcto VS=15318045009 SK=15096205664 1BtcToon VS=888446610539 SK=50783635853696 1btctoon VS=51529903411245 SK=50783635853696 12311 VS=4553521 SK=2602794081 1QLbz6 VS=264104224 SK=3864628649984 1QLbz7 VS=264104224 SK=3864628649984 (But neither are right true difficulty on this is 837,596,142) Also, we could really use a difficulty division formula based on caseable & non-caseable characters. We plan to use the solution for a pricing structure and time estimation on a vanity wallet service designed for retail investors. We've made it so easy to use, that children whom can read and follow directions can use it. We will also be giving away in some cases up to 7 digit wallets absolutely free based on difficulty, that is why this part of our process is so important to us. We cannot have people submitting work for 11111111 and be inaccurate in pricing and estimated time. edit to clarify the service is splitkey for legacy wallets only. |
|
|
|
|
Bump , Still trying to solve
|
|
|
|
The Compaq F's would be a great option as they start at around $300 a pop if you can find em. Just remember you'll need a fan to cool them and a higher powered USB hub to get the most out of them. I can personally attest to their effectiveness in solving / finding a block.  If you want a $300 powerball/lottery ticket by all means go ahead. Odd's of being struck by lighting 1 in 500,000 Odd's of finding a bitcoin block with a compaq 1 in 243,474 Odd's of hitting roi with this purchase? 1 in 243,474 I guess the sun shines on a dogs ass once in a while though. If you guys are going to suggest this hardware to people you should disclose the facts. Here's the facts of profitability on your suggestions. Hardly meaningful but to the 3 people that have ever found a block using them . Novel at best. buying one only benefits gekko.  |
|
|
|
I just realized ztex has recently released a new board based on the Xilinx Artix 7 XC7A200T fpga, available here: https://shop.ztex.de/product_info.php?products_id=102&language=enThey come with an open source SDK: https://www.ztex.de/firmware-kit/ although that's for general use, not a ready to use miner. I haven't seen anything in this forum about the series 2 of ztex, only the older series 1, which had an open source miner: https://bitcointalk.org/?topic=40047 but that stopped around 2013 it seems. Also it looks like bfgminer supports only series 1 of these boards. I wonder if anyone is using these new boards, or any fpga for mining these days, maybe as a home/quiet miner for example. Looking at this open source fpga bitcoin miner repo it looks like there hasn't been much done in about a decade: https://github.com/progranism/Open-Source-FPGA-Bitcoin-MinerIs all the mining now done exclusively with ASICs? even the USB stick miners use an ASIC. I wonder if there's any current FPGA device that can be used for mining today, ideally open source. Probably it won't be as efficient as the latest ASIC, but an fpga has other advantages to it, like being able to be updated over time, and use the board for other purposes as well. There is but the firmware your referring to though is called bitstreams ,nothing I've seen is open source these days, a lot of these newer FPGA's are owned by a few select individuals that own said bitstreams they generally wont share bitstreams until they sell the whole lot of FPGA's at end of life. I personally know people that own 60%+ of total supply of certain fpga's with very elaborate setups such as chip etching liquid cooling. Long story short they dont sell the bitstreams or the FPGA's, they might get the bitstream made for "free" for a hefty %10 dev fee on a major acquisition. There's alternatives though , you can lease your FPGA out on Vast.ai for top dollar(if you can even set it up in the firstplace) , its more rewarding then any mining prospect as these guys use your fpga to develop said bitstream before buying a few shelves full of clusters of limited makes. using a bitstream is "simple" according to this Bitstream Encryption wiki they provide. I must say I don't know how useful 256 MByte DDR3 SDRAM on this particular make is though for memory intensive mining. But I don't know a lot about them and decided to steer clear of the complexities behind them. |
|
|
|
|
Show Posts
