Minimalist algorithm capable of identifying the highest-consensus reflection among 100,000, with accuracy rates ranging from 45% to 77%, depending on the simulated scenario.

Polivoz is a PUBLIC DOMAIN design that combines pairwise comparison (A vs. B) with a minimalist algorithm (without AI) to identify consensus in large groups.

Pairwise comparison involves repeatedly making binary judgments (A vs. B) where voters express their preference for one option over another (A or B). This technique allows for the efficient and fair ordering of thousands or millions of options, without requiring voters to be informed about all of them at once (typically, they are only asked about around 30).

If the algorithm grants the same initial visibility to each proposal, inequalities stemming from variables external to the voting process—which are highly difficult to control—are significantly reduced.

Furthermore, by rewarding options that garner more consensus with higher visibility, while minimizing the exposure of less appealing ones, high-quality rankings are achieved in the top tier.

In computer simulations, the minimalist Polivoz algorithm demonstrates its potential to identify the highest-consensus proposal among 100,000 options, with success rates ranging from 45% to 77% depending on the research scenario.

In the context of civic technology, this pairwise comparison (A vs. B) functionality with a meritocratic matching algorithm could significantly increase a platform's capacity to identify the highest-consensus options in extreme use cases involving thousands of proposals.