### Parallel Prefix Sum
This is a work-efficient Parallel Schedule that for example produces Trangular
-or Fibonacci number sequences. Half of the Prefix Sum Schedule is near-identical
-to Parallel Reduction. Whilst the Arithmetic mapreduce Mode may achieve the same
+or Factorial number sequences. Half of the Prefix Sum Schedule is near-identical
+to Parallel Reduction. Whilst the Arithmetic mapreduce Mode (`/mr`) may achieve the same
end-result, implementations may only implement Mapreduce in serial form (or give
the appearance to Programmers of the same). The Parallel Prefix Schedule is
*required* to be implemented in such a way that its Deterministic Schedule may be