Online 666 Flash Calculation program - YouTube
Uncover.exe 666 calculation program. Flash version by Carl
Quick info
This is the Online flash Version of the Uncover.exe 666 calculation program. This flash version requires no download or installation. It is click and use. Uncover.exe 666 calculation program. Flash version by Carl Use the URL shown in the video to use this calculator. This program calculates for all possible 666 numeric alphabet solutions for base and progression for any word or name entered. It calculates all 443,556 alphabet systems for each word entered. The formula for the calculation routines are simply 666 squared. This would be 666 x 666 = 443,556. Whatever word you calculate this program will find every possibility within the scientific method. The definition of the scientific method in respect to this program is: (a) It does not violate the laws of mathematics. (B) It is exhaustive in its calculations in the sense it is impossible for this program to miss a 666 solution for any word in which a 666 solution is possible. Note: Some words have no solution. (C) It is duplicatable by any quailfied programmer secular or Christian. If you would like more details about this program read the article below.
The serious 666 Calculation Program
Uncover.exe - How it works and how it was developed (Flash and Dos versions)
This program's short name shown above is called the UNCOVER.EXE program. It's full name is: "Uncovering the Antichrist the English Language Calculation Program." This is the program which found the A=6 B=12 C=18 numeric alphabet that exists within the 443,556 alphabet arrays of the program that are possible. The information shown below is the basics of what, why and how the program operates its calculation routines. The document below also discusses what was required to attain exhaustive and complete results.
First of all there are exactly 443,556 possible whole number gematria alphabet systems within the English language for determining accurate 666 solutions. There are no more and there are no less. If you use anymore than the 443,556 alphabets that are possible mathematically by this program, then you will have stepped into randomness and numerology. This program does not do numerology, it does pure mathematics within established mathematical laws. To stay within mathematical laws for determining 666 solutions for words using the English language you must do two main things, what we will talk about next are those two requirements.
(Requirement # 1) If you are going to try isolating any one numeric alphabet (gematria) that shows a clear pattern for 666 totals among inputted words, then you must first find out how many possible alphabet combination's exist mathematically so you can create and run those arrays in a programmable mathematical format. This within the standards required by the scientific method, which in this case means exhaustive method. This exhaustive method means simply that you must develop the program so that it will always find every possible English numeric alphabet that produces a 666 total for any word, name, or letter character sets entered. If the program does not do this, then it would be a worthless endeavor. Not to mention the skeptics and critics would say what was the point of doing it at all if you did not calculate for all possibilities during your research.
So the research must be exhaustive and complete to prove anything. The program must be able to be duplicated by other qualified programmers and must pass every mathematical test for accuracy using the exhaustive method. In other words it cannot omit even one solution for any word or name calculated. If the name or word calculated has a 666 solution that is possible, this within the scientific method and then the program misses it, well then you have a serious problem. For the record this program does not miss any solutions. I hope the programmers reading will prove this to themselves by issuing themselves a programming challenge to duplicate this program from scratch.
If you were to develop your own program you must ensure that it is designed to do all possible calculations for each word that is inputted into it. It cannot omit solutions through error or sub-routines canceling, not even for one solution. It must process each word through all 443,556 combination's the same way each time for each word. It must be tested in such a way that all the above criteria is met, this so it could survive the scrutiny of any programmer or mathematician.
So how do we know how many gematria combinations exist using the scientific method? That's is the easiest part of this to understand and it is the easiest to do respect to this program. Since we are not dealing with infinite possibilities with the number 666, then you only need to understand one basic mathematical law and formula. The formula is simply 666 squared. (666x666=443,556) Since the number 666 is far from infinite, we need only to calculate within the parameters of A=1 B=2 C=3 D=4 up to A=666 for the base value variable (A= equals) and then do the same thing with the progression variable.
If you have any word of two letters or more, then a numeric alphabet using a base value of A=666 and a progression of 1 (A=666 B=667 C=668) 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 alphabet solutions using the scientific method. However there would still be 443,555 other numeric alphabets below that ceiling of (A=666 B=667 C=668) that you need to calculate for.
Let me explain this a little more. Since we are using two basic variables that incrementally increase during the arrays process, this from the smallest base (A=1) we know we must square the sum we are looking for to find or determine all possible progressive alphabet 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 alphabets exist in the English language within established mathematical laws. There are exactly 443,556 numeric alphabets in the English that could produce 666 solutions for words of two letters or more. Since we must stay within the Koine Greek usage for the word Psephizo as shown in Rev. 13:16-18 for our calculations, then by using this above method we have done this, both mathematically and biblically.
Psephizo {psay-fid'-zo} 5586;
Count, (to count with pebbles, to compute, calculate, reckon 2)
Unlike many aspects of Quantum Mechanics, especially when considering Heisenbergs' uncertainty principle in respect to the collapse of wave-function, in perspective unlike this principle, we have no unknowns in the uncover.exe program. Please understand that there is no uncertainty principles utilized in the Uncover.exe program. This program does perfect and complete mathematics for which it was purposed and designed, there no guesswork or randomness involved.
Alright now that we understand how many numeric alphabets exist in the English for 666 calculations how do you apply this to the software to do the calculations? 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. The information that follows below is the basics in the simplest terms I could think of, to help you understand how this program does it's calculations. I hope this helps answer the first question.
When developing the software the first thing we had to determine was an input method for the English letter 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 name inputted for calculation and then total it by the smallest numeric alphabet. The program would then need to save that total in its memory buffer at this smallest encryption. The program would then begin processing it through the 443,556 numeric arrays depending on the total of the word at the smallest encryption.
Here is an example: (ABC) - the total value of the letters ABC at the smallest numeric alphabet is 6.
(A=1 B=2 C=3) 1+2+3 = 6 The letter character positions 1-26 of the alphabet are also assigned at this time. Another example: If I entered the word CAT, the total value for CAT at this same lowest encryption would be 24 (C=3 A=1 T=20 ) or 3+1+20 = 24
The letter character assignment position for the letter C is position 3, the letter A is position 1, and the letter T is position number 20 in the alphabet. The letter assignment 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 calculation arrays. So the next step is for us to develop the calculation arrays in a computer usable format. A simple visual demonstration of this that most will be able to understand can be represented by a giant box of progressive numbers. Since we know how many numeric alphabets exist in the English by squaring the number 666, then we only need giant box of 443,556 dots to demonstrate this principle. Each of these dots below represent a base value for the letter A=_ (moving from left to right), then the numeric progression increasing from A to find the next letter value. (Moving top to bottom) In other words 443,556 numeric alphabets are represented by this format. 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 manually.
Alright in the example box above place your finger on any number moving from left to right and select a value for the letter A. OK now select any number moving from top to bottom to select a progression value.
* If you had selected the number 10 for the base value (the letter A) and then selected the number 5 for the progression value, then your numeric values for your alphabet would be
A=10+5 B=15+5 C=20 or
* A=10 B=15 C=20 D=25 E=30 F=35 G=40 H=45 I=50 J=55 K=60 and so forth
You would now select a word that you would like to calculate by this alphabet in order to see if it will total 666.
In it's truest form this program is best described as an English language alphabet algorithm. An algorithm is any well-defined computational procedure that takes some value, or set of values, as input and produces some value, or set of values, as output. An algorithm is thus a sequence of computational steps that transform the input into the output. The 443,556 alphabets mathematically possible are arrayed numerically in such a way that through a series of IF commands using greater <> or lessor algorithm procedures determines the next array, or the finalization command depending on the output. When programmed correctly it produces all possible 666 solutions in an English numeric alphabet form for any word calculated, then it displays and stores the results. This is the simplest way to describe what the Uncover.exe program does.
Alright above we encrypted one numeric alphabet out of the 443,556 that exist. OK we cannot pat ourselves on the back yet, there are still 443,555 numeric alphabets to calculate by other than A=10 progression of 5 we just did above. You must calculate all 443,556 of them for each word before you can look for designs or patterns.
Uncover.exe 666 calculation program. Flash version by Carl
Quick info
This is the Online flash Version of the Uncover.exe 666 calculation program. This flash version requires no download or installation. It is click and use. Uncover.exe 666 calculation program. Flash version by Carl Use the URL shown in the video to use this calculator. This program calculates for all possible 666 numeric alphabet solutions for base and progression for any word or name entered. It calculates all 443,556 alphabet systems for each word entered. The formula for the calculation routines are simply 666 squared. This would be 666 x 666 = 443,556. Whatever word you calculate this program will find every possibility within the scientific method. The definition of the scientific method in respect to this program is: (a) It does not violate the laws of mathematics. (B) It is exhaustive in its calculations in the sense it is impossible for this program to miss a 666 solution for any word in which a 666 solution is possible. Note: Some words have no solution. (C) It is duplicatable by any quailfied programmer secular or Christian. If you would like more details about this program read the article below.
The serious 666 Calculation Program
Uncover.exe - How it works and how it was developed (Flash and Dos versions)
This program's short name shown above is called the UNCOVER.EXE program. It's full name is: "Uncovering the Antichrist the English Language Calculation Program." This is the program which found the A=6 B=12 C=18 numeric alphabet that exists within the 443,556 alphabet arrays of the program that are possible. The information shown below is the basics of what, why and how the program operates its calculation routines. The document below also discusses what was required to attain exhaustive and complete results.
First of all there are exactly 443,556 possible whole number gematria alphabet systems within the English language for determining accurate 666 solutions. There are no more and there are no less. If you use anymore than the 443,556 alphabets that are possible mathematically by this program, then you will have stepped into randomness and numerology. This program does not do numerology, it does pure mathematics within established mathematical laws. To stay within mathematical laws for determining 666 solutions for words using the English language you must do two main things, what we will talk about next are those two requirements.
(Requirement # 1) If you are going to try isolating any one numeric alphabet (gematria) that shows a clear pattern for 666 totals among inputted words, then you must first find out how many possible alphabet combination's exist mathematically so you can create and run those arrays in a programmable mathematical format. This within the standards required by the scientific method, which in this case means exhaustive method. This exhaustive method means simply that you must develop the program so that it will always find every possible English numeric alphabet that produces a 666 total for any word, name, or letter character sets entered. If the program does not do this, then it would be a worthless endeavor. Not to mention the skeptics and critics would say what was the point of doing it at all if you did not calculate for all possibilities during your research.
So the research must be exhaustive and complete to prove anything. The program must be able to be duplicated by other qualified programmers and must pass every mathematical test for accuracy using the exhaustive method. In other words it cannot omit even one solution for any word or name calculated. If the name or word calculated has a 666 solution that is possible, this within the scientific method and then the program misses it, well then you have a serious problem. For the record this program does not miss any solutions. I hope the programmers reading will prove this to themselves by issuing themselves a programming challenge to duplicate this program from scratch.
If you were to develop your own program you must ensure that it is designed to do all possible calculations for each word that is inputted into it. It cannot omit solutions through error or sub-routines canceling, not even for one solution. It must process each word through all 443,556 combination's the same way each time for each word. It must be tested in such a way that all the above criteria is met, this so it could survive the scrutiny of any programmer or mathematician.
So how do we know how many gematria combinations exist using the scientific method? That's is the easiest part of this to understand and it is the easiest to do respect to this program. Since we are not dealing with infinite possibilities with the number 666, then you only need to understand one basic mathematical law and formula. The formula is simply 666 squared. (666x666=443,556) Since the number 666 is far from infinite, we need only to calculate within the parameters of A=1 B=2 C=3 D=4 up to A=666 for the base value variable (A= equals) and then do the same thing with the progression variable.
If you have any word of two letters or more, then a numeric alphabet using a base value of A=666 and a progression of 1 (A=666 B=667 C=668) 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 alphabet solutions using the scientific method. However there would still be 443,555 other numeric alphabets below that ceiling of (A=666 B=667 C=668) that you need to calculate for.
Let me explain this a little more. Since we are using two basic variables that incrementally increase during the arrays process, this from the smallest base (A=1) we know we must square the sum we are looking for to find or determine all possible progressive alphabet 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 alphabets exist in the English language within established mathematical laws. There are exactly 443,556 numeric alphabets in the English that could produce 666 solutions for words of two letters or more. Since we must stay within the Koine Greek usage for the word Psephizo as shown in Rev. 13:16-18 for our calculations, then by using this above method we have done this, both mathematically and biblically.
Psephizo {psay-fid'-zo} 5586;
Count, (to count with pebbles, to compute, calculate, reckon 2)
Unlike many aspects of Quantum Mechanics, especially when considering Heisenbergs' uncertainty principle in respect to the collapse of wave-function, in perspective unlike this principle, we have no unknowns in the uncover.exe program. Please understand that there is no uncertainty principles utilized in the Uncover.exe program. This program does perfect and complete mathematics for which it was purposed and designed, there no guesswork or randomness involved.
Alright now that we understand how many numeric alphabets exist in the English for 666 calculations how do you apply this to the software to do the calculations? 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. The information that follows below is the basics in the simplest terms I could think of, to help you understand how this program does it's calculations. I hope this helps answer the first question.
When developing the software the first thing we had to determine was an input method for the English letter 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 name inputted for calculation and then total it by the smallest numeric alphabet. The program would then need to save that total in its memory buffer at this smallest encryption. The program would then begin processing it through the 443,556 numeric arrays depending on the total of the word at the smallest encryption.
Here is an example: (ABC) - the total value of the letters ABC at the smallest numeric alphabet is 6.
(A=1 B=2 C=3) 1+2+3 = 6 The letter character positions 1-26 of the alphabet are also assigned at this time. Another example: If I entered the word CAT, the total value for CAT at this same lowest encryption would be 24 (C=3 A=1 T=20 ) or 3+1+20 = 24
The letter character assignment position for the letter C is position 3, the letter A is position 1, and the letter T is position number 20 in the alphabet. The letter assignment 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 calculation arrays. So the next step is for us to develop the calculation arrays in a computer usable format. A simple visual demonstration of this that most will be able to understand can be represented by a giant box of progressive numbers. Since we know how many numeric alphabets exist in the English by squaring the number 666, then we only need giant box of 443,556 dots to demonstrate this principle. Each of these dots below represent a base value for the letter A=_ (moving from left to right), then the numeric progression increasing from A to find the next letter value. (Moving top to bottom) In other words 443,556 numeric alphabets are represented by this format. 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 manually.
Alright in the example box above place your finger on any number moving from left to right and select a value for the letter A. OK now select any number moving from top to bottom to select a progression value.
* If you had selected the number 10 for the base value (the letter A) and then selected the number 5 for the progression value, then your numeric values for your alphabet would be
A=10+5 B=15+5 C=20 or
* A=10 B=15 C=20 D=25 E=30 F=35 G=40 H=45 I=50 J=55 K=60 and so forth
You would now select a word that you would like to calculate by this alphabet in order to see if it will total 666.
In it's truest form this program is best described as an English language alphabet algorithm. An algorithm is any well-defined computational procedure that takes some value, or set of values, as input and produces some value, or set of values, as output. An algorithm is thus a sequence of computational steps that transform the input into the output. The 443,556 alphabets mathematically possible are arrayed numerically in such a way that through a series of IF commands using greater <> or lessor algorithm procedures determines the next array, or the finalization command depending on the output. When programmed correctly it produces all possible 666 solutions in an English numeric alphabet form for any word calculated, then it displays and stores the results. This is the simplest way to describe what the Uncover.exe program does.
Alright above we encrypted one numeric alphabet out of the 443,556 that exist. OK we cannot pat ourselves on the back yet, there are still 443,555 numeric alphabets to calculate by other than A=10 progression of 5 we just did above. You must calculate all 443,556 of them for each word before you can look for designs or patterns.
