Uncovering the Antichrist (Uncover.EXE Program)
http://www.geocities.com/markofthebeastverichip/alphabetchallenge.html
Screen-shots are in very low resolution to save bandwidth
Uncovering the Antichrist - Software Download Area
|||| - Click here to Download the UncoverEXE (Borland Ver2.1 C++) 666 Calculator Program||||
PROGRAM INFO:
Uncovering the Antichrist - Software Download Area
PROGRAM INFO:
Note: This is a Borland C++ assembly program which calculates for all possible numeric alphabet combinations that give 666 totals for any inputted name or word using the scientific method and established mathematical laws. Each inputted word is processed through all 443,556 numeric alphabet combinations that are allowed within the scientific method when using whole numbers and the 26 letter English character sets. This program does NOT do numerology. See this program's operations information document located just below the download area for more information. INSTALL: There is no install except for placing the program in the directory or folder you wish it to operate it from. Just put the program in the directory of your choice and unzip it with an unzipping utility and then click the uncover.exe to launch the program.
NOTE: This program is small enough to download to a 1.44 diskette. This program will also run from the diskette after unzipped. So if you are concerned about a virus, download it to a diskette and check it with your virus tools before using it. I give you my word there is no virus in this program. If you need an unzipping utility I recommend WINZIP, they have free versions you can download.
Compatibility: This is an IBM compatible program, it works well with the following operating systems.
Win95, Win98, Win98 (second edition) Millennium 2000 ME, XP Home, XP Professional.
Macs that have the conversion software can also run this program.
Problems: Does not like the Windows Vista. The problem has to do with the graphics rendering of Vista and this programs default graphic driver. Some have made it work using some rendering properties adjustments but I recommend you just use and older computer using an operating system other than Windows Vista.
IMPORTANT NOTE: This program is only 60 KB in size and downloads in just a few seconds. Do not let this program's size mislead you, this is a powerful program and cannot be downloaded anywhere else.
|||| - Click here to Download the UncoverEXE (Borland Ver2.1 C++) 666 Calculator Program||||
Software Operations - How it works & how it was developed
Now lets talk about this program which found the English Gematria Bible Codes and how it operates its calculations. This program is called: "UNCOVERING THE ANTICHRIST, the language calculation program.(Uncover.exe) The following below is the basic nuts and bolts of how this program was developed and how it works.
First of all to start with there are exactly 443,556 possible whole number gematria alphabet systems in the English Language for determining 666 solutions. There are no more and there are no less. Anymore than these and you will step into randomness and numerology, to stay within mathematical laws for determining 666 solutions for words by the English language you must do two main things.
(Requirement # 1) If you are going to try isolating any one alphabet gematria that shows a clear pattern for 666 totals among inputted words, then you must first find out how many possible alphabet combinations exist. This within the standards required by the scientific method as well as mathematical laws, if you don't then someone will always question if you did all possibilities during your research. So the research must be exhaustive and complete to prove anything. As you develop the software you must ensure it is designed to do all possible combinations for each word that is inputted through it. It cannot be biased and it cannot have runtime errors or array glitches. It must process each word through all 443,556 combinations the same way each time for each word.
All right then, so how do we know how many gematria combinations exist using the scientific method? That's easy! Since we are not dealing with infinite possibilities this is simple. The formula is simply 666 squared. Since the number 666 is far from infinite, we need only to calculate within the parameters of A=1 up to A=666 for the base value variable as well as the progression variable.
If you have a word or name of two letters or more, a gematria alphabet using a base value of A=666 and a progression of 1 (A=666 B=667 C=668) then this would cause any word, even the word Abba, to have a total beyond 666. In other words you will have reached the calculation ceiling for 666 gematria solutions using the scientific method. However, there are 443,555 other gematria alphabets below that ceiling other than the A=666 B=667 C=668 used above.
Let me explain this a little more. Since we are using two variables, (a base value and a progression value) we know we must square it to find all possible progressive gematria solutions. The way we determine this is by squaring it at the highest possible base and highest possible progression value that we are doing research for. In this case the highest numeric progression and highest sum allowed for our research is 666. Since 666 squared is simply 666 x 666 we know this equals 443,556. This is how we know how many numeric gematria alphabets exist in the English language. There are exactly 443,556 gematria alphabets in the English. Since we must stay within the Koine Greek usage for the word Psephizo as shown in Rev. 13:16-18 then by using the above format we have done this, both mathematically and biblically.
Psephizo {psay-fid'-zo} 5586;
Count, (to count with pebbles, to compute, calculate, reckon 2)
Continuing...
Ok we now understand how many gematria alphabets exist in the English, but how do you apply this to the software to make it work? How does this software determine the calculation arrays from an inputted word from a computer keyboard and how do we know it is doing the calculations correctly? Good questions. The second question is easy to answer so I will answer it first. You would simply check the results given by the program manually. Following below is the basic method in the simplest terms on how the program works. This should help answer the first question.
When developing the software the first thing we had to determine was an input method for the English character sets. Obviously we have 26 characters or letter encryption positions to start with in the English. So we had to design the program to encrypt the inputted letters numerically at the smallest possible whole number encryption. This is A=1 B=2 C=3 D=4 and so onto Z=26. Now the program must take the English word or names inputted for calculation and then total it by the smallest gematria values. Then the program would need to save that total in its memory buffer at this smallest encryption. From there the program would begin processing it through the 443,556 gematria arrays.
An Example: (ABC) the total value of ABC at the smallest gematria is 6. The letter character positions 1-26 of the alphabet are also assigned at this time. Another example: If I entered the word CAT, it's total value at this same lowest encryption would be 24 ( C=3 A=1 T=20 ) or (3+1+20= 24) The character positions for the letters C is 3, A is 1, and T is position number 20 in the alphabet. The letter character positions remains constant after inputting a name or word, but the base and progression arrays increase in step form increments as the inputted word proceeds through the gematria alphabet arrays. Now we must develop the calculation arrays in a computer usable format. A simple visual demonstration of this that most will understand can be represented by a giant box of progressive numbers. Since we know how many gematria alphabets exist in the English let us imagine a giant box of 443,556 dots, each of these dots representing a base value numeric encryption for A, then the numeric progression increase from the letter A. Since we are using two variable progressions we know this is 666 squared or 443,556 gematria alphabets total. Here is a small example of that box.
Starting Base value (A= 1) through 666 (1-666) (Left to right)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 .. cont. to 666
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 .
4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 ..
5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 .
9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 ..
10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 ..
11 12 13 14 15 16 17 18 19 20 21 22 23 24 ..
(Top to bottom) Second letter (B=) progression (Constant) 1-666 etc.
(666 Squared) or 666 x 666 = 443,556
Imagine how big this box would be if we did all 443,556 of them. 1-666 moving in one direction and 1-666 in the other. Imagine also having to do these calculations by hand. Here is a good example for explaining how long it would take to manually do these calculations. Above in the example place your finger on any number moving left to right and select a value for the letter A, now select any number from moving top to bottom to select a progression value. If you had selected the number 10 for the letter A and then selected the number 5 your gematria alphabet values would be A=10+5 B=15+5 C=20 or (A=10 B=15 C=20 D=25 E=30) You would now select a word that you would like to calculate by this alphabet in order to see if it will total to 666. The next step would be to calculate this same word by each of the other 443,555 gematria alphabets which exist. You must calculate all of them for each word before you can look for designs or patterns. Many words and names can be calculated to 666 by numerous different alphabets, but very few produce any clear patterns. But you must do all 443,556 of them for each word before you can look for patterns or prove anything. Imagine doing this by manual calculations. It would take months for each word. Don't worry you can download this program for free and it will do all the calculations for you in nana seconds for each processed word. Lets continue now discussing the program's operations.
After you have set up the arrays in a program format you must then set up the IF question at the end of the arrays calculations memory buffer. Example: IF an inputted word can be calculated to 666 by any of the 443,556 alphabet arrays save results and write to data file. IF inputted word does not total 666 do not save results. This will cause the program to save only those results where a gematria solution was found for that inputted word.
When using this portion of the program you will notice most words will have many possible alphabet solutions for 666 by many different gematria alphabets. Some as many as 300 for 1 inputted word or name, however even though there are many solutions for many words, these solutions have very few patterns. In fact if you don't spend some real quality time looking for the patterns among the thousands of solutions a person would see, most would probably give up.
So what we did during our research for pattern is we started focusing on words, rather than on names. We started with words that could be related to attributes of the evil one, or sin. Then we tried words that could be related to the buying and selling mark in relationship to the Revelation 13:16-18 prophecy. After doing this a pattern began to emerge rather quickly. We found that the words (listed further down the page) not only totaled 666, but they did it by the same exact gematria alphabet. Then to add to this amazing pattern to our surprise we found that almost all of them had only one possible solution to be calculated to 666. This is significant because most words have multiple solutions. So when you consider the fact that there are 443,556 possible gematria combinations and then consider the odds that these words which can be related to each other prophetically and then having only one possible result, the same result. Well, it's mind boggling to say the least. The odds of this happening by chance are impossible.
After finding this pattern we just started using A=6 B=12 C=18 alphabet key and we started finding the other 444, 888, 906 patterns. These words groups could be directly related to each other in a different way as you will soon see. One of these groups is a 444 total for the words Jesus, Cross, Gospel.
Keep in mind brothers and sisters if God had not hid a pattern in the English to be found then this program would have only found thousands of 666 alphabet solutions, but it would have done so without revealing any real match patterns. If this had been the case then this same program would have proved without a doubt that there was no single gematria alphabet in the English. It would have also proved that God had hid nothing in the English to be found.
NOTE: This program is small enough to download to a 1.44 diskette. This program will also run from the diskette after unzipped. So if you are concerned about a virus, download it to a diskette and check it with your virus tools before using it. I give you my word there is no virus in this program. If you need an unzipping utility I recommend WINZIP, they have free versions you can download.
Compatibility: This is an IBM compatible program, it works well with the following operating systems.
Win95, Win98, Win98 (second edition) Millennium 2000 ME, XP Home, XP Professional.
Macs that have the conversion software can also run this program.
Problems: Does not like the Windows Vista. The problem has to do with the graphics rendering of Vista and this programs default graphic driver. Some have made it work using some rendering properties adjustments but I recommend you just use and older computer using an operating system other than Windows Vista.
IMPORTANT NOTE: This program is only 60 KB in size and downloads in just a few seconds. Do not let this program's size mislead you, this is a powerful program and cannot be downloaded anywhere else.
Software Operations - How it works & how it was developed
Now lets talk about this program which found the English Gematria Bible Codes and how it operates its calculations. This program is called: "UNCOVERING THE ANTICHRIST, the language calculation program.(Uncover.exe) The following below is the basic nuts and bolts of how this program was developed and how it works.
First of all to start with there are exactly 443,556 possible whole number gematria alphabet systems in the English Language for determining 666 solutions. There are no more and there are no less. Anymore than these and you will step into randomness and numerology, to stay within mathematical laws for determining 666 solutions for words by the English language you must do two main things.
(Requirement # 1) If you are going to try isolating any one alphabet gematria that shows a clear pattern for 666 totals among inputted words, then you must first find out how many possible alphabet combinations exist. This within the standards required by the scientific method as well as mathematical laws, if you don't then someone will always question if you did all possibilities during your research. So the research must be exhaustive and complete to prove anything. As you develop the software you must ensure it is designed to do all possible combinations for each word that is inputted through it. It cannot be biased and it cannot have runtime errors or array glitches. It must process each word through all 443,556 combinations the same way each time for each word.
All right then, so how do we know how many gematria combinations exist using the scientific method? That's easy! Since we are not dealing with infinite possibilities this is simple. The formula is simply 666 squared. Since the number 666 is far from infinite, we need only to calculate within the parameters of A=1 up to A=666 for the base value variable as well as the progression variable.
If you have a word or name of two letters or more, a gematria alphabet using a base value of A=666 and a progression of 1 (A=666 B=667 C=668) then this would cause any word, even the word Abba, to have a total beyond 666. In other words you will have reached the calculation ceiling for 666 gematria solutions using the scientific method. However, there are 443,555 other gematria alphabets below that ceiling other than the A=666 B=667 C=668 used above.
Let me explain this a little more. Since we are using two variables, (a base value and a progression value) we know we must square it to find all possible progressive gematria solutions. The way we determine this is by squaring it at the highest possible base and highest possible progression value that we are doing research for. In this case the highest numeric progression and highest sum allowed for our research is 666. Since 666 squared is simply 666 x 666 we know this equals 443,556. This is how we know how many numeric gematria alphabets exist in the English language. There are exactly 443,556 gematria alphabets in the English. Since we must stay within the Koine Greek usage for the word Psephizo as shown in Rev. 13:16-18 then by using the above format we have done this, both mathematically and biblically.
Psephizo {psay-fid'-zo} 5586;
Count, (to count with pebbles, to compute, calculate, reckon 2)
Continuing...
Ok we now understand how many gematria alphabets exist in the English, but how do you apply this to the software to make it work? How does this software determine the calculation arrays from an inputted word from a computer keyboard and how do we know it is doing the calculations correctly? Good questions. The second question is easy to answer so I will answer it first. You would simply check the results given by the program manually. Following below is the basic method in the simplest terms on how the program works. This should help answer the first question.
When developing the software the first thing we had to determine was an input method for the English character sets. Obviously we have 26 characters or letter encryption positions to start with in the English. So we had to design the program to encrypt the inputted letters numerically at the smallest possible whole number encryption. This is A=1 B=2 C=3 D=4 and so onto Z=26. Now the program must take the English word or names inputted for calculation and then total it by the smallest gematria values. Then the program would need to save that total in its memory buffer at this smallest encryption. From there the program would begin processing it through the 443,556 gematria arrays.
An Example: (ABC) the total value of ABC at the smallest gematria is 6. The letter character positions 1-26 of the alphabet are also assigned at this time. Another example: If I entered the word CAT, it's total value at this same lowest encryption would be 24 ( C=3 A=1 T=20 ) or (3+1+20= 24) The character positions for the letters C is 3, A is 1, and T is position number 20 in the alphabet. The letter character positions remains constant after inputting a name or word, but the base and progression arrays increase in step form increments as the inputted word proceeds through the gematria alphabet arrays. Now we must develop the calculation arrays in a computer usable format. A simple visual demonstration of this that most will understand can be represented by a giant box of progressive numbers. Since we know how many gematria alphabets exist in the English let us imagine a giant box of 443,556 dots, each of these dots representing a base value numeric encryption for A, then the numeric progression increase from the letter A. Since we are using two variable progressions we know this is 666 squared or 443,556 gematria alphabets total. Here is a small example of that box.
Starting Base value (A= 1) through 666 (1-666) (Left to right)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 .. cont. to 666
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 .
4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 ..
5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 .
9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 ..
10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 ..
11 12 13 14 15 16 17 18 19 20 21 22 23 24 ..
(Top to bottom) Second letter (B=) progression (Constant) 1-666 etc.
(666 Squared) or 666 x 666 = 443,556
Imagine how big this box would be if we did all 443,556 of them. 1-666 moving in one direction and 1-666 in the other. Imagine also having to do these calculations by hand. Here is a good example for explaining how long it would take to manually do these calculations. Above in the example place your finger on any number moving left to right and select a value for the letter A, now select any number from moving top to bottom to select a progression value. If you had selected the number 10 for the letter A and then selected the number 5 your gematria alphabet values would be A=10+5 B=15+5 C=20 or (A=10 B=15 C=20 D=25 E=30) You would now select a word that you would like to calculate by this alphabet in order to see if it will total to 666. The next step would be to calculate this same word by each of the other 443,555 gematria alphabets which exist. You must calculate all of them for each word before you can look for designs or patterns. Many words and names can be calculated to 666 by numerous different alphabets, but very few produce any clear patterns. But you must do all 443,556 of them for each word before you can look for patterns or prove anything. Imagine doing this by manual calculations. It would take months for each word. Don't worry you can download this program for free and it will do all the calculations for you in nana seconds for each processed word. Lets continue now discussing the program's operations.
After you have set up the arrays in a program format you must then set up the IF question at the end of the arrays calculations memory buffer. Example: IF an inputted word can be calculated to 666 by any of the 443,556 alphabet arrays save results and write to data file. IF inputted word does not total 666 do not save results. This will cause the program to save only those results where a gematria solution was found for that inputted word.
When using this portion of the program you will notice most words will have many possible alphabet solutions for 666 by many different gematria alphabets. Some as many as 300 for 1 inputted word or name, however even though there are many solutions for many words, these solutions have very few patterns. In fact if you don't spend some real quality time looking for the patterns among the thousands of solutions a person would see, most would probably give up.
So what we did during our research for pattern is we started focusing on words, rather than on names. We started with words that could be related to attributes of the evil one, or sin. Then we tried words that could be related to the buying and selling mark in relationship to the Revelation 13:16-18 prophecy. After doing this a pattern began to emerge rather quickly. We found that the words (listed further down the page) not only totaled 666, but they did it by the same exact gematria alphabet. Then to add to this amazing pattern to our surprise we found that almost all of them had only one possible solution to be calculated to 666. This is significant because most words have multiple solutions. So when you consider the fact that there are 443,556 possible gematria combinations and then consider the odds that these words which can be related to each other prophetically and then having only one possible result, the same result. Well, it's mind boggling to say the least. The odds of this happening by chance are impossible.
After finding this pattern we just started using A=6 B=12 C=18 alphabet key and we started finding the other 444, 888, 906 patterns. These words groups could be directly related to each other in a different way as you will soon see. One of these groups is a 444 total for the words Jesus, Cross, Gospel.
Keep in mind brothers and sisters if God had not hid a pattern in the English to be found then this program would have only found thousands of 666 alphabet solutions, but it would have done so without revealing any real match patterns. If this had been the case then this same program would have proved without a doubt that there was no single gematria alphabet in the English. It would have also proved that God had hid nothing in the English to be found.
http://www.geocities.com/markofthebeastverichip/alphabetchallenge.html
