Cubelet robot simulating a binary adder

We show how a lot of modular robots Cubelets can be connected to implement a full binary adder. We use three NOT majority (NMAJ) gates which are implemented to control the sum and carryout with T-functions. Computation is performed by propagation of signals in wires of light, this energy represents a binary value (on=1, off=0). They compete for the space and interact in a boolean operation. This way, one lightness cube handles the majority gate operating on a T-function. If a NMAJ operation is true hence the light is catch by a brightness cube and display the final result.
The source code to implement a MAJ gate with Cubelets is available from: gist.github.com/RQF7/87b89a3c...
References.
1. Martínez G.J., Adamatzky A., Figueroa, R.Q., Schweikardt, E., Zaitsev, D.A., Zelinka, I., Oliva-Moreno, L.N. (2020) Computing with modular robots, by publish.
2. Schweikardt, E., Gross, M.D. (2008) Learning about complexity with modular robots. In: 2008 Second IEEE International Conference on Digital Game and Intelligent Toy Enhanced Learning, (pp. 116--123), IEEE.
3. Martínez G.J., Adamatzky A., Morita K., Margenstern M. (2010) Computation with Competing Patterns in Life-Like Automaton. In: Adamatzky A. (eds) Game of Life Cellular Automata. Springer, London.
4. Figueroa, R.Q., Zamorano, D.A., Martínez, G.J., Adamatzky, A. (2019) A Turing Machine Constructed with Cubelets Robots. Journal of Robotics, Networking and Artificial Life, 5(4) 265-268.
5. Logic gates with Cubelets: NAND and XOR. CZcams video: • Logic gates with Cubel...
6. Robotic Turing machine. CZcams video: • CULET: Cubelets Lego U...