Introduction

PSSP stands for Proof-of-Space Synchronized Plotting, which aims to reinforce the current existing Proof-of-Space algorithm by distributing the workload to different computational units and therefore allowing tasks to be completed concurrently at the highest level. Traditionally, the worker nodes (plotter) of Proof-of-Space algorithm must be configured with resources supporting the highest CPU requirements and highest RAM requirements throughout the plotting process while CPU and RAM resources are never to be requested at the same time. In this project, we would like to demonstrate the possibility of splitting the resource loads into different nodes and therefore achieve the most efficient resource assignment among the cluster.