The document describes the rules for permuting nodes in a 3D cube. Each of the 8 nodes (000, 001, 010, etc.) is connected to 3 other nodes by changing one digit (bit) in its 3-digit binary representation. For example, node 000 connects to 001, 010, and 100. The full permutation connects all 8 nodes in a pattern representing the connections between values in a 3D cube structure.

1. Cube Permutation
Static

2. Rules
• Each node must have nbit representation identified by C where n≥3
• C = 𝑎 𝑛−1 𝑎 𝑛−2…𝑎0
• 𝐴𝑑𝑑 𝑛𝑜𝑑𝑒 𝐶𝑖 = 𝑎 𝑛−1 𝑎 𝑛−2 … 𝑎𝑖 … 𝑎0
• New value 𝐶𝑖 = 𝑎 𝑛−1 𝑎 𝑛−2 … 𝑎𝑖 … 𝑎0 till 0 to n-1

3. 3d cube permutation
• Nodes are
• 000
• 001
• 010
• 011
• 100
• 101
• 110
• 111

4. • Node 000
• Connections are
• 𝐶0 = 000 = 001
• 𝐶1 = 000 = 010
• 𝐶2 = 000 = 100
001000 010 100

5. 3d cube permutation
• Node 001
• Connections are
• 𝐶0 = 001 = 000
• 𝐶1 = 001 = 011
• 𝐶2 = 001 = 101
001000 010 100011 101

6. 3d cube permutation
• Node 010
• Connections are
• 𝐶0 = 010 = 011
• 𝐶1 = 010 = 000
• 𝐶2 = 010 = 110
001000 010 100011 101 110

7. 3d cube permutation
• Node 011
• Connections are
• 𝐶0 = 011 = 010
• 𝐶1 = 011 = 001
• 𝐶2 = 011 = 111
001000 010 100011 101 110 111

8. 3d cube permutation
• Node 100
• Connections are
• 𝐶0 = 100 = 101
• 𝐶1 = 100 = 110
• 𝐶2 = 100 = 000
001000 010 100011 101 110 111

9. 3d cube permutation
• Node 101
• Connections are
• 𝐶0 = 101 = 100
• 𝐶1 = 101 = 111
• 𝐶2 = 101 = 001
001000 010 100011 101 110 111

10. 3d cube permutation
• Node 110
• Connections are
• 𝐶0 = 110 = 111
• 𝐶1 = 110 = 100
• 𝐶2 = 110 = 010
001000 010 100011 101 110 111

11. 3d cube permutation
• Node 111
• Connections are
• 𝐶0 = 111 = 110
• 𝐶1 = 111 = 101
• 𝐶2 = 111 = 011
001000 010 100011 101 110 111