checks:
- all the voted balots have been transformed
- all the challenges have been opened on the correct side
- ballots were properly printed (commitments for the revealed page)
- ballots were properly transformed (from P3 to D3 or from D3 to R)
- commitments to D2 or D4 is valid
algorithm:
- read in memory MeetingOneIn.xml (constant and ElectionSpecification)
- read in memory MeetingThreeIn.xml
- optional [check that the ballots that use for voting are not in MeetingTwoOut.xml]
- read in memory MeetingThreeOut.xml
- read in memory MeetingFourIn.xml
- optional [check that each challenge is for a valid did (is also in MeetingThreeOut.xml)]
- read in memory MeetingFourOut.xml
- check that all the requests have been opened on the correct side
- check that all the transformation have been made corectly
- go through each line of MeetingOneOut.xml (use sax)
- if a row in P is found, check if it is MeetingThreeOut
- check the commitment for p1 or p2
- if a row in D in found
- check the commeiment for d2 or d4
Checks:
- the reply contains what was asked for
- commitments to p1 and p2 is valid
- p1+p2=d2+d4
- commitment to d2 and d4 is valid
- check if all the pid in the D tables are among the requested ones
- check that all the rids in one partition are the same (no matter how many D instances)
Algorithm:
read in memory MeetingOneIn.xml
read in memory MeetingTwoIn.xml
read in memory MeetingTwoOut.xml
- check that all the requested ballots have been opened (while reading prints)
- TODO for each partition, check that the pid SET is the one that was requested
- TODO for each partition, check that the rid SET is the same for all partitions
- TODO check the files agains an xml schema
- check that p1+p2=d2+d4 for all partitions, all instances
go through each line of meeting one out (use sax)
- if a row in P is found, check if the ballot was requested for audit
- check the commitments for p1 and p2
- if a row in D is found
- check the commitment for d2 and d4
A cluster has a center of mass, is in a rectangle of coordonates ((xmin,ymin),(xmax,ymax))
and containes a number of points (different from the number of points in the rectangle)
A cluster is only a wrapper around those values