Technology
GNP/ESALR in particular context is a method of creating an exclusive 9 to 30-character >>>> 35 to 200-character identity ESALR code pertaining to any type and any size of data file, which can be stored or transmitted, and from which can be extracted the original compacted data file, without any loss of technology. In this context, [GNP] Geometrical Numeric Processing is a method of creating an exclusive 9 to 30-character >>>> 35 to 200-character identity GNP code pertaining to any type and size of data file, which can be stored or transmitted, and from which the original compacted data file can be extracted without any loss of integrity, content, or structure to its original form uniformly and orthogonally throughout the entire sourced and original file.
This ESALR technology provides the user a phenomenal choice, to overcome most of the bandwidth capacity disadvantages and privacy of any telecommunications type of network and mobile access devices, that are inherent in the current system.
ESALR Word Equation which is the output of the ESALR Compaction Encrypted transfer function. This function computes the Mathematical Roots of a 4th dimensional Multinomial Product containing the Hyper Factorials of the Riemann Zeta Function and its derivative the Hurwitz Zeta Function the Multinomial Product is the computational product of dimensionally indexed Binomial Heaps.
This Riemann Zeta Function was based on the hypothesis that the non-trivial zeros of zeta function lie between the zero and 1 and not on 1/2i. This algorithm along with multinomial binomial heaps which provide merge operation along priority queue is the main essence of the Imploder transfer function. Where a list can be converted into a heap using these algorithms. There is a provision for multi-layer programmable switches which help reach desired compaction Ratio of the original data. The switches will automatically determine the number of heaps the levels required for a given compaction.
The algorithm also has a programmable data Splitter / Combiner and Packet Length PreScaler to deal with very large files. Initially, one might think a 30-digit number can have no more than 300 bits of data (30 numbers x 10 possible digits). However, when the sequence of the digits is also considered, a 30-digit number contains a huge volume of data.
To give a short (and knowingly incomplete) example of how a smaller number can be uniquely defined with a larger number, let us set forth the following example: 25—is uniquely correlated with the larger number 1,223, which equals ((2 + 5) ^2) *5*5-2=1,123; and 93—is similarly uniquely correlated with the number 46,438,023,159
These examples are incomplete and leave other questions, including ones of simple logic, but highly proprietary, unanswered. For example, “How can three-digit numbers be exploded back to represent all the possible sixdigit numbers? That logically seems impossible.” These answers are trade secrets. There is a provision for multi-layer programmable switches which help reach desired compaction Ratio of the original data. The switches will automatically determine the number of heaps the levels required for a given compaction. The algorithm also has a programmable data Splitter / Combiner and Packet Length PreScaler to deal with very large files. Initially, one might think a 30-digit number can have no more than 300 bits of data (30 numbers x 10 possible digits). However, when the sequence of the digits is also considered, a 30-digit number contains a huge volume of data.
