Editing Permissioned resource coins (section)

=== Allocating storage space ===

Consider a simple example with four parties, each with 10 GB of storage space. To buy storage space in this system, a person must purchase resource coins and make a request to the coin for storage space. The coin would then use available storage space in the order defined in the farmer set, and reserve payments between them.

<pre>price_per_gb = 0.01
swarms = {}
pending = {}
balances = {
    &quot;client&quot;: 100
}

# Unbound for loops don't work well on blockchains.
# This will need to be optimised.
def allocate_storage(gb_amount, client, id):
    id = random()
    swarm = []
    for farmer in farmers:
        # How much space can we get from this farmer?
        if farmer[&quot;gb&quot;] &gt; gb_amount:
            change = gb_amount
        else:
            change = farmer[&quot;gb&quot;]
            
        # Check the client has enough to buy this.
        total_cost = change * price_per_gb
        if balances[client] &lt; total_cost:
            break
            
        # Don't continue if there was no change.
        # We're done here.
        if not change:
            break        
        
        # Apply changes.
        farmer[&quot;gb&quot;] -= change
        gb_amount -= change
        balances[client] -= total_cost
        pending[id][farmer] += total_cost
        
        # Record farmer in this resource set.
        swarm.append(farmer)
            
    swarms[id] = swarm</pre>
What I have described above is a simple proof-of-stake system. It is a system that awards storage based on the order in which people join. In a real system, there are other variations that could be used. For example, you could program the allocate_storage function to distribute 75% of the storage space based on join order and the remaining 25% randomly.

<span id="paying-for-storage-space"></span>