Is it possible --
to set up a fraudulent function in a computerized vote-counting program --
so that anyone given the "key" --
could throw any election
whose votes are counted by that program?
And, so that the database of votes remains unchanged?
And, so that any method which allows a voter to "verify" that his vote was correctly recorded, will answer "Yes"?
I think so.
(below is the whole thing --
presented step-by-step at the right)
One of the common arguments used to say that messing with the computer program itself won't work for a fraudster,
is that the program won't know which candidate to make the winner - because the ballot layouts change with every election.
Well, here is the way to get around that!
Here is the demonstration (concept model) of a method that an insider -- or an outsider given at least a few minutes inadequately supervised access to the computer code of a vote-counting program, can manage to set up a way to steal the election. One person can do the whole thing in his state.
This demo is a series of webpages which represent the steps of such a compromised election tally, in the actual sequence they would follow if used. On each page, you will see actions, then a choice, presented as both a graphic and a description. Click on each image or on the choice with a link, and the site will step you through to the next step in the program, in a style similar to what a real program would do.
The general concept is - do an activity, look at the conditions which followed that activity, and ask a Yes-No question, the responses representing the branches of the program. In program diagrams, a diamond is "A Choice" - and almost always a "Yes or No". It is the model of:
So, if you are ready to see the steps, here we go..........
Prepare to read the ballots, which have already been reviewed by staff, found to meet marking standards, and are prepared for the ballot scanner (or have been downloaded from DRE's, etc.)