We have some questions

Help
1
  1. The bidding mechanism of the storage market is the lowest price, Will it lead to a malicious bidding and how to balance it?
  2. Does the power to generate new blocks depend on the amount of the storage?）
  3. Do the Storage Miners use filecoin as collateral? How do I get the initial collateral? Because the first tokens had a six-month blockade, they could not be used as collateral.
  4. Storage Miners require large storage capacity and high bandwidth，Do they require a high speed read and write disk?
  5. Retrieval Miners require high computing performance (that is, CPU and memory) and bandwidth, Do they require a high-performance disk?）
  6. as a storage miner, the same capacity disk is configured on multiple computers and one computer. Is the competition equal?
  7. Does the data in the storage miner’s disk need protection?
  8. A node does or not correspond to an IP address？
  9. Does the match of the storage order need to retrieve miner’s participation?）
  10. How are leaders elected? What does it do?
  11. Can the Linux file system be a miner？as opposed to the benefits of the Windows file system?
  12. Is there a mistake in the following algorithm？
    ReceivePiece
    inputs:
    – signing key for Mj.
    – current orderbook OrderBook
    – ask order Oask
    – bid order Obid
    – piece p
    outputs: deal order Odeal signed by Ci and Mj
  1. Check if Obid is valid:
    a) Check if Obid is in OrderBook
    b) Check ifObid is not referenced by other activeOdeal
    c) Check if Obid.size is equal to |p|
    d) Check if O is signed by Mi（Check if Obid is signed by Mj？）
  2. Store p locally
  3. Set Odeal:= <Oask, Odeal, H§ >Mi（Set Odeal:= <Oask, Obid, H§ >Mj？）
  4. Get identity of Cj from Obid （Get identity of Ci from Obid？）
  5. Send Odeal to Cj （Send Odeal to Ci？）
  6. Output Odeal