51�Թ�

The idea is to express the matrix as a product of simpler matrices—similar to the prime factorization of a number.

The implications were immediately obvious: prime factorization was the backbone of modern encryption.

I appreciated it even more when I saw how the poem was based on the fundamental theorem of arithmetic, which states that every whole number greater than 1 has a unique prime factorization.

Data encryption typically relies on the practical difficulty of a process called prime factorization.

Many developments are needed to turn these nanomagnet chips into practical computing engines: the ability to connect thousands of p-bits to each other; a demonstration of combining p-bits and transistors in an integrated circuit; and a calculation of the time and energy needed to achieve prime factorization of huge numbers using these methods.