<p>Map Reduce isn't the best idea, because distributed mining is solved and works well.  The <a href="https://bitcoin.stackexchange.com/a/8034/1878">magic of mining is described here</a>, and when that is complete that Bitcoin protocol allows for 25 new Bitcoins to be send to any address.  This is encapsulated into a block that is either accepted (and used as the "previous" block), or rejected, for example if the protocol rules are broken.</p>

<p>Your time is best spent running your own mining pool.</p>

CC BY-SA 3.0
2013-07-27T13:58:40.917Z
What if the mining midstate pragmatically is not the best shot, and some pre-cal of blockchain could be done in MapReduce? while the diff is increasing could targeting the nonce from reverse space could be possible to implement?
einzeln00
CC BY-SA 3.0
2013-07-27T14:57:39.947Z
`targeting the nonce from reverse space` Huh?
Nick ODell
CC BY-SA 3.0
2013-07-27T15:26:19.630Z
@einzeln00 You need to learn more about how mining works, and how it relates to the blockchain.  No pre-calculations are possible in mining, the merkle tree, the nonce, or the midstate.  Difficulty isn't "real" it's really the "target" and that can't be optimized or distributed.  Read the link I posted, and if not my answer read some other answers on that page
makerofthings7
CC BY-SA 3.0
2013-07-27T13:48:32.903Z
2013-07-27T13:48:32.903Z
2017-04-13T12:47:33.660Z
makerofthings7
<p><strong>The context is here</strong></p>

<p>I don't know how exactly the new blockchain candidate was calculated in Bitcoin Network, so I guess it was based on a Merkle candidate of (a) bitcoin client/s. Also I presume that is by referring the diff of network, a client hashing the/a (golden) nonce, and then propagate it to the network, if lucky enough other nodes think this nonce is ok (the first), somewhere magic happened you get the coin (please enlighten me about this magic).</p>

<p>Please correct my understanding.</p>

<p><strong>So (if you know Hadoop)</strong></p>

<p>Despite how actually <code>SHA(Midstate(nonce++))</code> was implemented in a Reduce procedure (hashing/sec/energy), how could I generate new Merkle tree(s) and midstate candidate(s) in Hadoop way (huge number of them simultaneously)?</p>

<p>Thank you for your reading (hard to understand).</p>

<p><strong>Problem (if prior has no big problem)</strong></p>

<p>What I am proposing here is, if all this works, how could a mining pool like this benefit from Hadoop? (if it could)</p>

<p>(If it really works, I'd implement raspberry pi to hook up hundreds of SHA asis of my own in distributed fashion.)</p>

CC BY-SA 3.0
2013-07-27T14:58:59.913Z
`If it really works, i'd implement raspberry pi` Don't. It's less efficient than an Intel CPU.
Nick ODell
<mining-pools><mining-reward><block-header>
Could Hadoop be used as a mining pool architecture?
einzeln00
# Could Hadoop be used as a mining pool architecture?

(Asked by: username_0 on 2013-07-27)

**The context is here**

I don't know how exactly the new blockchain candidate was calculated in Bitcoin Network, so I guess it was based on a Merkle candidate of (a) bitcoin client/s. Also I presume that is by referring the diff of network, a client hashing the/a (golden) nonce, and then propagate it to the network, if lucky enough other nodes think this nonce is ok (the first), somewhere magic happened you get the coin (please enlighten me about this magic).

Please correct my understanding.

**So (if you know Hadoop)**

Despite how actually `SHA(Midstate(nonce++))` was implemented in a Reduce procedure (hashing/sec/energy), how could I generate new Merkle tree(s) and midstate candidate(s) in Hadoop way (huge number of them simultaneously)?

Thank you for your reading (hard to understand).

**Problem (if prior has no big problem)**

What I am proposing here is, if all this works, how could a mining pool like this benefit from Hadoop? (if it could)

(If it really works, I'd implement raspberry pi to hook up hundreds of SHA asis of my own in distributed fashion.)

**Tags:** mining-pools, mining-reward, block-header

> **Comments:**
> **username_1**: `If it really works, i'd implement raspberry pi` Don't. It's less efficient than an Intel CPU.  

---

## 1 answers

### Answer by username_2 on 2013-07-27. Score: 4 | Accepted answer

Map Reduce isn't the best idea, because distributed mining is solved and works well. The [magic of mining is described here](https://bitcoin.stackexchange.com/a/8034/1878), and when that is complete that Bitcoin protocol allows for 25 new Bitcoins to be send to any address. This is encapsulated into a block that is either accepted (and used as the "previous" block), or rejected, for example if the protocol rules are broken.

Your time is best spent running your own mining pool.

> **Comments:**
> **username_0**: What if the mining midstate pragmatically is not the best shot, and some pre-cal of blockchain could be done in MapReduce? while the diff is increasing could targeting the nonce from reverse space could be possible to implement?  
> **username_1**: `targeting the nonce from reverse space` Huh?  
> **username_2**: @username_0 You need to learn more about how mining works, and how it relates to the blockchain.  No pre-calculations are possible in mining, the merkle tree, the nonce, or the midstate.  Difficulty isn't "real" it's really the "target" and that can't be optimized or distributed.  Read the link I posted, and if not my answer read some other answers on that page  

---

