Anonymous ID: 6c4217 March 22, 2024, 4:55 a.m. No.20606347   🗄️.is 🔗kun

>>20606339

 

Notable

 

  • 10,000 illegal aliens, using the same exact social security number voted in the Nov 3, 2020 election, and this is just in the border state of Arizona,

 

Katie Hobbs belongs in prison,

Anonymous ID: 6c4217 March 22, 2024, 6:40 a.m. No.20606559   🗄️.is 🔗kun   >>6576 >>6594 >>6788 >>6849

>>20606530

 

>>20606531

>Whats the ev-number?

A number you give for evidence whether it is your driver's license number, ss number, or passport number. Your ballot is an encrypted salted hash of 512 characters based on what is filled out in the form. We could allow other numbers too. The hash changes with every different character down to even just a simple whitespace. The code can be open sourced too for the ballot without jeopardizing security.

 

Yes, what you see is actually a working prototype not something contrived. It starts by building the code for a web page and then puts application controls into that page in real time. On submit it returns you an encrypted salted hash of 512 characters of that actual form data. You can save that number to a thumbdrive and place it somewhere safe, then when you go back to the application if you submit that number, I return you your ballot with everything that you filled out.

Anonymous ID: 6c4217 March 22, 2024, 6:59 a.m. No.20606637   🗄️.is 🔗kun   >>6650 >>6661 >>6732

>>20606576

 

I use a well known security library for that but I can use anyone at all. Here is how it works at a high level. A 4 bit encrypted hash of a word, such as "Joe" may return xp@3 by the program, if you return xp@3 to the program it returns Joe. Now if you typed "Joey" then the hash changes to jx#! just because one character, symbol, or white space was added. So you have to get all the information right to return the same hash. Salting runs that algorithm numerous times against a new "secret word" in addition, so "Joe" hashed with the "secret word" salted runs that algorithm against xp@3 the original hash which then returns the final encrypted hash and let's say it comes out to v*3x after 3 salt iterations. That is more secure than just xp@3 because now even if you could figure out all the pertinent information as to what some used for their evidence number (DL, SS, Passport), you still have to figure out the secret of the salt and how many iterations it went through. Now imagine if all this returns not just 3 bits but 512 or 2048 bits, how hard it would be to compromise? There are hundreds of combinations in encryption algorithms that can be used. Even if by some brute force grid computing attack from a cloud based service was used, which costs thousands at the end of the month, a compromise could only affect one single vote not millions like in a server side hack of a voting machine.

 

Hope that all makes sense. WRWY

 

For God and Country

Anonymous ID: 6c4217 March 22, 2024, 7 a.m. No.20606648   🗄️.is 🔗kun

>>20606576

>Looks interesting. How are you planning on getting the ballot hash?

 

And by the way, what you see in the video is an actual working hash of these principles. It is not contrived.