def get_job(die, core): job = job_registry.getwork() job['previous block hash'] = hf.reverse_every_four_bytes( job['previous block hash']) job['merkle tree root'] = hf.reverse_every_four_bytes( job['merkle tree root']) job['bits'] = hf.bebytes_to_int(job['bits']) return job
def is_valid_nonce(job, nonce): # check nonce zerobits, regen_hash_expanded = hf.check_nonce_work(job, nonce) if (zerobits >= 39): #if (zerobits >= job_registry.difficulty): job['previous block hash'] = hf.reverse_every_four_bytes(job['previous block hash']) job['merkle tree root'] = hf.reverse_every_four_bytes(job['merkle tree root']) #job['bits'] = hf.int_to_bebytes(job['bits'], 4) #job_registry.submit(job, nonce, worker_name) valid_nonce_queue.append( (job, nonce, worker_name) ) return (zerobits >= test.search_difficulty)
def is_valid_nonce(job, nonce): # check nonce zerobits, regen_hash_expanded = hf.check_nonce_work(job, nonce) if (zerobits >= 39): #if (zerobits >= job_registry.difficulty): job['previous block hash'] = hf.reverse_every_four_bytes( job['previous block hash']) job['merkle tree root'] = hf.reverse_every_four_bytes( job['merkle tree root']) #job['bits'] = hf.int_to_bebytes(job['bits'], 4) #job_registry.submit(job, nonce, worker_name) valid_nonce_queue.append((job, nonce, worker_name)) return (zerobits >= test.search_difficulty)
def get_job(die, core): job = job_registry.getwork() job['previous block hash'] = hf.reverse_every_four_bytes(job['previous block hash']) job['merkle tree root'] = hf.reverse_every_four_bytes(job['merkle tree root']) job['bits'] = hf.bebytes_to_int(job['bits']) return job