---
# System prepended metadata

title: Untitled

---


[Coordinated Mining](https://github.com/orgs/ArweaveTeam/projects/6/views/1?pane=issue&itemId=18242459) Questions

1. In the first bullet it puts an example:
    > `mining_peer A.B.C.D:1984,0,addr,10,addr,11,addr`

    This means we are coordinating with peer `A.B.C.D` and expect it to provide partitions `0`, `10` and `11` packed with packing address `addr`? Why would it need the packing address? In which cases it'll have to use it?

2. How does a miner decide wich partition(s) to store?

3. What are `H1`, `H0` and `RecallByte2`? Maybe we are missing some documentation here. Also `H2`, which is mentioned later.

4. > if the second miner finds a solution, they either have to download the first chunk from the first miner ...

    What is this "first chunk of the first miner"? It refers to the first part of the candidate block (the one that includes the first recall block)? Or is it something else?

5. > ... in theory only one miner of the group may have access to the mining key; the third possibility is nobody has the key 

    What is the mining key? Is it related to the mining address?
    
6. All the coordinated miners should share the mining address, right? How are rewards distributed?

7. When setting a mining peer should there be a validation that the peer has the partitions? How?

8. Is the mining pool supposed to work like this: we have a "coordinator node" which gets sends out the list of peers for your node to use and when you find a solution you send it to that one?