**The 3D Face Algorithm (Part II)**

In part I, the aim of the 3DF algorithm was stated. It was the spread of data unto the congruent convex regular polygon faces ...

The aim of the 3DF algorithm is:

the spread of data unto the congruent convex regular polygon faces of the platonic solid

In this part, I have proposed a reversal to the 8 step process in part I. This (as part I also was) is affected by 2 factors:

1. A public key which determines face rotation.

2. A private key determining face layering.

The process is as follows:

1. A start at **face x+1** (described in part I). Determination of which
could be by some form of flag set on a face at the last step of part I.

2. The sha1 hash of the data stream is read from face x+1. This hash is used for error checking at the end of the process.

3. The next face is chosen. The next face is determined by *previous face* data written during the process in part I.

4. Data is read from the face and the appropriate layer. A reversal of step 4 of part I.

5. Mathematical operations are performed on the read data and the result used to build up the datastream. Note that this step is a reversal of step 2 of part I and each subsequent block is put at the head of the previous block.

6. Step 3 is repeated until the last layer of the base face is reached.

7. The *datastream* of this process being *run out*, the sha1 hash of the
derived data is calculated and compared to that generated at step 2 above.

8. Deompression then quits.

The part III of this paper goes here