The Plot algorithm is an inevitable step for miners to create effective capacity to participate in mining. When a miner first joins the MASS network and wants to contribute N bits of space to the mining effort, it samples a public/secret key pair (pk,sk) and runs Plot algorithm with pk. This process mainly involves generating two hashmap tables and the second hashmap table is finally stored in the hard disk as effective capacity. The specific implementation steps are as follows:
Step 1: The miner generates a public-private key pair (pk,sk) through the elliptic curve secp256k1 algorithm.
Step 2: The miner performs double sha256 hashing on the public key to generate a unique ID=doublesha256(pk) of the capacity space.
Step 3: The miner sets the size parameter BL of the initialization capacity space. This parameter indicates that the second hashmap table stores 2^BL pieces of data, and the actual storage space occupation is as follows:
Step 4: The miner calculates , and . Then, the miner creates the hashmap table A with y as the index and x as the value.
Step 5: The miner inverts the value of in the hashmap table A to get , and use as the index to find the corresponding in the hashmap table A, and the corresponding value as .
Step 6: The miner calculates . Then, with as the index and as the value, build the hashmap table B.