Method for infinitely compressing and storing data

Abstract

The invention discloses a method for infinitely compressing and storing data, which comprises the following steps of: 1, forming a string of ultra-long messy codes only consisting of 0 and 1 by using computer probability messy codes, and then carrying out coding statistics on sound, picture and character symbols and letters expressed by data evolved by the computer 0 and 1; the codes are GBK codes or UTF-8 codes; 2, each special symbol obtained through statistics is expressed in a combination mode of 0 and 1; 3, substituting the expression record storage system into codes, and carrying out segmented storage; according to the computer coding principle, a specific symbol form is input through the system, automatic identification is carried out in the system, then positions of super-long messy code strings are searched out, and then P is output. According to the method, the storage space can be reduced to only dozens of bytes by utilizing the characteristics of pi, and the overall value of data is not influenced while a data result is obtained.

Description

Technical Field

[0001] This invention relates to the field of data storage technology, specifically to a method for infinitely compressed data storage. Background Technology

[0002] Memory, as a data storage medium, is widely used in various electronic products and terminal devices. With the continuous advancement of new materials technology and manufacturing processes, the performance of memory has been greatly improved, and various new types of memory have emerged. Memory is generally divided into two categories: internal memory and external memory. Internal memory is fast, but data is lost when power is off, such as RAM. External memory is relatively slower, but data is retained even when power is off, such as hard disks. Computers use binary code, consisting of only two digits, "0" and "1," to represent data. The two stable states of memory elements are represented by "0" and "1." Everyday decimal numbers must be converted to their equivalent binary values ​​before being stored in memory. Various characters processed by computers, such as English letters and operators, must also be converted to binary code for storage and manipulation. At this point, by inputting an extremely long random group of "0"s and "1"s into a network system's compressed memory, and utilizing the reusability to achieve an infinitely long random group, and then using the search function of a quantum computer, all data can be searched within the random group, and then the position and range results can be marked and saved.

[0003] With the advancement of technology, computers and mobile phones have become essential devices in every household. The proliferation of apps on electronic devices has drastically reduced storage space, exacerbating the problem and leading to numerous downloads and uninstalls. Scientific storage is even more stifling, with scientific databases growing exponentially, clearly pushing the system to its limits. Today's databases require extremely long and complex data, often consuming vast amounts of memory; even adding decimal points to reduce the size doesn't necessarily reduce memory usage. Summary of the Invention

[0004] To address the aforementioned technical shortcomings, the purpose of this invention is to provide a method for infinitely compressed data storage.

[0005] To solve the above-mentioned technical problems, the present invention adopts the following technical solution: This invention provides a method for infinitely compressed data storage, characterized by comprising the following steps: Step 1: Use computer probability to generate a very long string of random characters consisting only of 0s and 1s. Next, encode and statistically analyze the sound, image, text, symbols, and letters represented by the data derived from the computer's 0s and 1s; the encoding is either GBK encoding or UTF-8 encoding. Step 2: Next, each special symbol that has been counted will be represented using a combination of 0 and 1; Step 3: Then, these expressions are stored in the encoding system and can be saved in segments; according to the computer encoding principle, specific symbol forms are input through the system, the system automatically recognizes them, and then searches for their positions in the extremely long garbled string, and then outputs P.

[0006] The beneficial effects of this invention are as follows: This method utilizes the characteristics of π. As long as the numerical value is a combination of numbers, the corresponding result can be found in π. At this time, the data to be saved only needs to output π (1234664546-1234679526). The data is from a certain position after the decimal point of π to a certain position. This will become the storage result of the database, and the storage space is reduced to only a few dozen bytes. While obtaining the data result, the overall value of the data is not affected. Detailed Implementation

[0007] The technical solutions of the present invention will be clearly and completely described below with reference to the embodiments of the present invention. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of the present invention.

[0008] The method for infinitely compressing and storing data includes the following steps: Step 1: Use computer probability to generate a very long string of random characters consisting only of 0s and 1s. Next, encode and statistically analyze the sound, image, text, symbols and letters represented by the data evolved from computer 0s and 1s. It should be noted that everything in a computer can be represented by 0s and 1s. If it is GBK encoding, the corresponding binary code is: 11000100 11100011 10111010 11000011; If it is UTF-8 encoded, the corresponding binary code is: 11100100 10111101 10100000 11100101 10100101 10111101; Step 2: Next, each special symbol that has been counted will be represented by "01010" for "Hello" or "01101" for "World". Of course, you can also use other combinations of 0 and 1 to express it.

[0009] Step 3: Then, these expressions are stored in the encoding system. According to the computer encoding principle, specific symbol forms are input through the system, such as "Hello World". The system automatically recognizes them as "0101001101" and then searches for their positions in the long string of random characters, such as position P (1561-1570). Next, P (1561-1570) is output.

[0010] Finding the position P of an infinitely long garbled character group might result in a longer storage time. Also, if the stored data is too large, the search probability or time in the garbled character group will be longer. Therefore, in order to save time and improve the probability, we can save it in segments, such as 10,000 characters at a time, which will result in many segments. Then, the saved results are input again for a second iteration, a third iteration, and so on. After multiple iterations, the goal of infinitely compressed storage can be achieved.

[0011] The spaces can be randomly added to the extremely long garbled text group to represent some "2".

[0012] Customers can now copy and save this output. When they need the data later, they can simply access the system and enter or click P (1561-1570) in their account. The system will then translate the original input based on its stored data and output the answer "Hello world".

[0013] This system allows for virtually unlimited compressed storage. Simply input large amounts of data, such as numerous images or videos. Since data recording is based on the 0s and 1s principle, the internal system will convert the data and output only P(649546846-65499453546). Save this result to your document, app, or webpage, and add a name and annotation. When needed, simply access the system webpage, input or click the result P(***-***), and the system will immediately translate and output your original data. This can significantly save users' computer storage space.

[0014] Develop the software or webpage for this system, designing it as a number substitution translation system. Input the desired data, and the output will be a location P (***-***). Save the location output within the software or webpage. To use it, simply click on the location information to translate and output the original data.

[0015] Since ultimately, any input location information can be translated, and if memory allows, inputs from P1 to P100000000 can be used to translate various valuable information. Therefore, users need to register an account and password to log in to the software or website. If the location information entered matches previously stored information, the location information can be retrieved. Users must first transcribe their own information before translation; otherwise, a translation error will be displayed. Internal personnel are an exception. Of course, this software or website also has drawbacks; both translation and transcription take time, so a quantum computer is needed, as the larger the data, the faster the speed.

[0016] When writing the system program, for example, the first extremely long code block, you need to input an infinite number of 0s first, and then randomly insert the same number of 1s.

[0017] In addition, there are two methods to solve the problem of a large number of false discrepancies.

[0018] Method 1: When a segment of the stored numerical information in the input is exactly the opposite of the super long code group, if it is in one of those positions, it can be set as a secondary record dummy number, such as: PJ (1234-1244). If there is a number between two digits, and the number between each digit is 1, then the special number group is recorded as: PG① (1234-1334). If you encounter a false incrementing interval, such as starting from 3 and incrementing, and the true incrementing interval is 2, then set it as: PZ③-②(1234-1334). In fact, any number with a discernible pattern can have its pattern represented by a special formula. Simply find the location information of false numbers and mark it with a special formula.

[0019] Method Two: If a large number of numbers are identical or similar, they can be automatically segmented and saved without complete translation. This requires programming to identify them, followed by a second iteration to shorten the storage. The storage simplification method follows the same principle. If the memory data is as long as 100 million characters, it can be segmented and shortened to a search every 500 characters, resulting in 200,000 storage records. These records can then be iterated a second, third, and so on, repeatedly until infinite compression is achieved. Because each iteration's result is necessarily more concise than the previous one, using the stored results for secondary storage is a simpler and more practical approach.

[0020] Solution for excessively long garbled character groups (without needing to exceed the limit): Assuming the extremely long scrambled character set contains only 100 million numbers, when inputting numbers for information storage, the system can continuously record them repeatedly if no results are found. That is, when the number is insufficient, it automatically connects to the beginning and reuses the previous number, or continues recording from the end in reverse order. When marking a position, the value N billion is automatically added repeatedly, and this increments by hundreds of millions after several repetitions. Alternatively, a circle of extremely long scrambled characters can be designed, repeatedly using various methods to form different combinations, such as every other number or every two numbers (this is mainly to prevent low-probability matching when searching for scrambled character sets; as long as the scrambled character sets are diverse and reach an infinitely long length, low probability becomes less of a problem).

[0021] Quantum computers are perfectly positioned to fulfill this need. They utilize quantum superposition to quickly search for password results, and since quantum computers currently have no practical applications, this system software is a perfect fit. Its infinite compression storage capability can save a significant amount of space, making it essential for mobile phones and computers. Ordinary computers can only store information using 0s or 1s, commonly known as bits. However, quantum computer qubits can not only be 0s or 1s, but also both 0s and 1s, allowing for the existence of "superposition states." For example, if we want to find a criminal in a database of 5 million faces, a classical computer would search one by one, which is very time-consuming. A quantum computer, on the other hand, could search all 5 million faces simultaneously, quickly finding the information we need.

[0022] Obviously, those skilled in the art can make various modifications and variations to this invention without departing from its spirit and scope. Therefore, if these modifications and variations fall within the scope of the claims of this invention and their equivalents, this invention also intends to include these modifications and variations.

Claims

1. A method for infinitely compressing and storing data, characterized in that, Includes the following steps: Step 1: Use computer probability to generate a very long string of random characters consisting only of 0s and 1s. Next, encode and statistically analyze the sound, image, text, symbols and letters represented by the data generated by the computer's 0s and 1s. Encode it as GBK or UTF-8; Step 2: Next, each special symbol that has been counted will be represented using a combination of 0 and 1; Step 3: Then, these expressions are stored in the encoding system and can be saved in segments; according to the computer encoding principle, specific symbol forms are input through the system, the system automatically recognizes them, and then searches for their positions in the extremely long garbled string, and then outputs P.