Bitcoin Forum
August 18, 2019, 05:46:23 AM *
News: Latest Bitcoin Core release: 0.18.0 [Torrent] (New!)
 
   Home   Help Search Login Register More  
Pages: [1]
  Print  
Author Topic: [Revolutionary Mining Development] Incrase the result by 1000x more faster.  (Read 86 times)
Hasher.club
Newbie
*
Offline Offline

Activity: 24
Merit: 0


View Profile
January 11, 2018, 07:36:23 PM
Last edit: January 11, 2018, 08:13:39 PM by Hasher.club
 #1

All mining hardware and software don't mine correctly!

We can incrase the result by 1000x more faster.

Saving power.
Boost your Miner reward by 1000x!

More details and update will be added soon.

Join our live chat community http://hasher.club/public/index.php?page=chat

Want help us with this Development ? We accept donation.

We need:
- Computer running ubuntu 16.04 with ssh acces as root. (CPU OR GPU)
- Antminer L3 with ssh acces et web interface.
- Computer running Windows 7 or later with RDP acces as administrator. (CPU OR GPU)
- Any usb miner scrypt connected to windows or linux with RDP acces as administrator ssh acces as root.

Thanks



1566107183
Hero Member
*
Offline Offline

Posts: 1566107183

View Profile Personal Message (Offline)

Ignore
1566107183
Reply with quote  #2

1566107183
Report to moderator
PLAY NOW
Advertised sites are not endorsed by the Bitcoin Forum. They may be unsafe, untrustworthy, or illegal in your jurisdiction. Advertise here.
user0000001
Sr. Member
****
Offline Offline

Activity: 938
Merit: 261


View Profile
January 11, 2018, 07:58:24 PM
 #2


I would like to see examples. is there a test for your miner?
Hasher.club
Newbie
*
Offline Offline

Activity: 24
Merit: 0


View Profile
January 11, 2018, 08:01:43 PM
 #3

Yes! actually I am running my dev version for some evaluation. But I need more hashing power at the moment.

The user test version will be added soon !
AgronA
Newbie
*
Offline Offline

Activity: 8
Merit: 0


View Profile
January 12, 2018, 08:13:32 PM
 #4

I am very interested in what is taking place here as well.

Would be nice to see if you have come up with something.

Will watch this thread.
Blocklock
Member
**
Offline Offline

Activity: 60
Merit: 10

Cryptocurrency Investor, economist, researcher.


View Profile
January 13, 2018, 11:11:49 AM
 #5

Interesting proposal. Will be able to throw details and source code for the proposed solution? What are the limitations?
Hasher.club
Newbie
*
Offline Offline

Activity: 24
Merit: 0


View Profile
January 14, 2018, 01:10:44 AM
 #6

Actually I can get the nonce from difficulty POW. So I can resolve any block in 2sec on core2 cpu!
Blocklock
Member
**
Offline Offline

Activity: 60
Merit: 10

Cryptocurrency Investor, economist, researcher.


View Profile
January 14, 2018, 10:49:46 PM
 #7

Actually I can get the nonce from difficulty POW. So I can resolve any block in 2sec on core2 cpu!

can throw here for more information on your decision? I was interested in Huh
Hasher.club
Newbie
*
Offline Offline

Activity: 24
Merit: 0


View Profile
January 15, 2018, 03:20:16 AM
 #8

I am working on the upgrade for the antminer s9 and l3, l3+

Basically the first problem with miner are :

Based on python

Starting cracking with 0 to 2147483647 00.1% of chance the nounce are low with a high difficulty.

Original version of all miner are example nounce 0 to 2147483647:
Code:
for nounce in xrange(0, 0x7fffffff, 1):
    nounce_bin = struct.pack('<I', nounce)
    header_bin = header_prefix_bin + nounce_bin
    header_hex = hexlify(header_bin)
    scrypt = ltc_scrypt.getPoWHash(header_bin)
    pow = hexlify(scrypt[::-1])
    if pow <= target:
        print "FOUND  ########################################################"
        print "[" + str(nounce) + "]" + pow
        break
    _hash_count += 1


Example nounce 2147483647 to 0
Code:
for nounce in xrange(0, 0x7fffffff, 1):
    nounce = 0x7fffffff-nounce
    nounce_bin = struct.pack('<I', nounce)
    header_bin = header_prefix_bin + nounce_bin
    header_hex = hexlify(header_bin)
    scrypt = ltc_scrypt.getPoWHash(header_bin)
    pow = hexlify(scrypt[::-1])
    if pow <= target:
        print "FOUND  ########################################################"
        print "[" + str(nounce) + "]" + pow
        break
    _hash_count += 1

Example lottery version nounce random
Code:
for nounce in xrange(0, 0x7fffffff, 1):
    nounce = randint( 0,  2147483647)
    nounce_bin = struct.pack('<I', nounce)
    header_bin = header_prefix_bin + nounce_bin
    header_hex = hexlify(header_bin)
    scrypt = ltc_scrypt.getPoWHash(header_bin)
    pow = hexlify(scrypt[::-1])
    if pow <= target:
        print "FOUND  ########################################################"
        print "[" + str(nounce) + "]" + pow
        break
    _hash_count += 1

The best of my version are first nounce 1 to 2147483647 the next 2147483647 to 1 the next random betwen 0 to 2147483647 all in same time..
Code:
     for nounce in xrange(nounce_start, 0x7fffffff, nounce_stride):
        if self._done:
          self._dt += (time.time() - t0)
          raise StopIteration()
for test in xrange(0, 3):
if test == 0:
nounce = nounce
if test == 1:
nounce = randint( 1,  2147483647)
if test == 2:
nounce = 0x7fffffff-nounce
nounce_bin = struct.pack('<I', nounce)
pow = self.proof_of_work(header_prefix_bin + nounce_bin)[::-1].encode('hex')
#print "[ " + self.id + " ] " + str(nounce) + ":" + pow
#print self.target
if pow <= self.target:
print self.target + ":" + pow

Is only the one of 10 upgrade we can edit in our miner Wink
Pages: [1]
  Print  
 
Jump to:  

Sponsored by , a Bitcoin-accepting VPN.
Powered by MySQL Powered by PHP Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!