* High speed, our encryption algorithm are minimum 10 times faster than RSA asymmetric encryption for small documents encryption and more than 100 times faster for big files. The deference depends on size of key&file.You can encrypt and decrypt big media file within a seconds!

* Not only post-quantum, developed for Non-determine Turing machine. Future super and quantum computers won't be able to hack us.

*Our product can be used like hybrid encryption and also can speed up your prime numbers based encryption like RSA (minimum 30%)

How we can convert if conditions and words into math?

Our main formula is the formula, which can replace logical condition like “if” with a mathematical formula. You can check that we are first, who do it for all data types. Our algorithm can convert a text into math function. In an example we can convert “Hello world!” into math function: https://gist.github.com/timurryspekov/ea32cd1bca74a0910b8d5a698a483dad

The console demo of working metaprogramming algorithm: https://www.youtube.com/watch?v=ui7Y8dZPXcw

For the initial proof of working code, I attached a working code to find primes up to 120 and 168 with just one simple loop with simple arithmetic (you can check that it's new way to work with prime numbers and we are first, who do it).

https://gist.github.com/timurryspekov/e7394c24b83ae989749f6000ac6c5cb4 (up to 120)

https://gist.github.com/timurryspekov/3576c1a20fae07b6671aa6fd05943ec5 (up to 168)

Demo of sieves speedup (simple version of our formula): https://youtu.be/CbZpRKC0sBg

Looking forward to hearing from you, BR, Tim