On the Subject of Decomposed RGB Arithmetic
These [still] are not numbers, yet, this is part of a cipher now.
The module has two filled 4×4 grids of RGB colours with LEDs in each corner. The 6 tiles furthest from the top-left are NOT considered to be part of the grid.
Each colour in the grid gives three digits, corresponding to each colour channel:
- If the channel is not present at all, the digit is “-".
- If the channel is maximised, the digit is “+".
- Otherwise the digit is “0".
Each LED on the corners of each screen corresponds to a transformation to be applied to the respective colour channel on the grid:
- Top left- Flip individual rows horizontally.
- Top right- Flip individual columns vertically.
- Bottom left- Swap the rows and columns i.e. A2 ↔ B1.
- Bottom right- Invert the channel i.e. + ↔ -.
If the same transformation is applied to multiple channels, its respective LED additively mixes the corresponding colours.
This module has one stage:
- Each channel for the corresponding grid consists of any number of transformations that are applied in a specific order, with the first transformation flashing after that channel’s color being absent on the LEDs. The bottom-right LED will NEVER flash in a sequence and must be used last for that channel on each grid.