Breaking the Wheel ... https://www.youtube.com/watch?v=rEBPhNFHaaE

In this video you will see data from the NYT feed from PA on November fourth. In this data, particular vote ratios are transferred between random sets of seized precincts throughout the day (see image link below): https://ibb.co/h1x3Xds A total of nine exhibits are presented in this video, but there are in fact several hundred of these precincts seizures and ratio transfers on the day of November 4th alone, and the same ratios continue to be transferred for several more days within the overall dataset spanning an entire week. Original data sets: https://gofile.io/d/qZcQl6 ... https://www.youtube.com/watch?v=KIlI46HdqKg

Test ... https://www.youtube.com/watch?v=M9B8VA8UHn8

Maricopa Paper (reduced version of the Michigan Paper) https://docs.google.com/document/d/1f5cgmSW3tUJfOI6ijU4Dm6eArdUm9tngOab_rRjMkr8/edit?usp=sharing Oakland County Recorder Data https://docs.google.com/spreadsheets/d/1iNAkGavumvvDjKBNABH7T4S5FIUohDlsq1kLPUybIPU/edit?usp=sharing Macomb County Recorder Data https://docs.google.com/spreadsheets/d/1dzobdIuV7WC7JjqIVky7aCJ3tfpaJz8VcnQBYY1Vjgw/edit?usp=sharing Basic Michigan Algorithm: https://www.desmos.com/calculator/8ibu8ydios f(x) = reflection line; z(x) = proportion of Mail-ins to Election Day Votes, 2000 MiV votes to 1000 EDV votes means z(x) = 2 b1(x) = Biden EDV%; t2(x) = TrumpMIV % b2(x) = Biden Miv%; t1(x) = Trump EDV% The algorithm solves as t2 as a function of b1. (t1 is implied by b1, regardless of whether or not the election is or isn't fair, since t1 is always equal to 100%-b1). (b2 is implied by t1, regardless of whether or not the election is or isn't fair, since b2 is always equal to 100%-t1). a(x) = Biden's Aggregate Percentage for the entire precinct. Since b1(x), b2(x), t1(x), t2(x) and a(x) are all forced, one only needs the reflection constant and lambda and the predetermined aggregate a(x) to generate both candidates percentages for both the MiV and EDV. The intersection of the line x = k, (k bounded from 0 to 1) with all five percentage functions are the percentages of the candidate's. If a desired value of a(x) exists between 0% and 100% from x bounded from 0 to 1, then the algorithm simply reads the values of the functions b1(x), b2(x), t1(x) and t2(x) and multiples those percentages against the respective vote totals and generates the Tabulation Record. If a(x) does not exist, either the proportion z(x) must be increased, or the reflection line f(x) must be decreased. We note that at z(x) = 3 and f(x) = 0.25, that a(x) cannot drop below 50%, guaranteeing a victory for the candidate, even if they get 0% of the election day vote; thus one only requires a 3:1 ratio of MiV ballots to EDV ballots to guarantee a victory at the precinct, since if b1(x) = 0% EDV then b2(x) = 66.667%, MIV therefore the aggregate of 0% and 66.667% at a ratio of 3 MIV to 1 EDV ballot is an aggregate that exceeds 50%. Macomb County Recorder Website: https://electionresults.macombgov.org/m31/results.html Thesis Paper: https://docs.google.com/document/d/1Jj9ASctIWDhcpesR8d3r-qj9Ez6uxIIsFfxgkuNJgZE/edit?usp=sharing Source Video for the Derivation: https://www.youtube.com/watch?v=C5o2kUjevUA Michigan Engine (link is safe ignore warning): https://gofile.io/d/leCtNM Fair Reflection Test: https://docs.google.com/spreadsheets/d/1uMaoCdoGbNpm25fODpgnM6T497r8QQoWP0UJ9Az6uEY/edit?usp=sharing Unfair Reflection Test https://docs.google.com/spreadsheets/d/1Q3xczUxTAw3CCzrviZyitNplwxbPCMGohKz ... https://www.youtube.com/watch?v=jd3vPhH_MK8