The program aims at finding many generalized binary number systems. An extensive search is performed in the finite set of matrices of given size fulfilling some necessary conditions. The difficulty is that the size of this finite set is an exponential function of the dimension. It now seems possible to attack the case of 11 × 11 matrices. To check further necessary conditions the program performs a lot of floating-point calculation. Thus, a lot of CPU time is needed. Luckily, parallelization is possible, so the project can benefit from running on multiple machines.