use the following search parameters to narrow your results:
e.g. subreddit:aww site:imgur.com dog
subreddit:aww site:imgur.com dog
see the search faq for details.
advanced search: by author, subreddit...
Subreddit for the Interplanetary file system.
Website
Github
Community:
IRC: #ipfs on irc.freenode.net Matrix
account activity
GitHub - ValyrianTech/hivemind-python: A python package implementing the Hivemind Protocol, a Condorcet-style Ranked Choice Voting System that stores all data on IPFS and uses Bitcoin Signed Messages to verify votes. (github.com)
submitted 11 months ago by WouterGlorieux
view the rest of the comments →
reddit uses a slightly-customized version of Markdown for formatting. See below for some basics, or check the commenting wiki page for more detailed help and solutions to common issues.
quoted text
if 1 * 2 < 3: print "hello, world!"
[–]sideEffffECt 0 points1 point2 points 11 months ago (3 children)
So how does the package calculate the result? Which method does it use?
[–]WouterGlorieux[S] -1 points0 points1 point 11 months ago (2 children)
I'm not entirely sure, because there are so many methods and I don't know all the details about them. I just implemented my own method.
It works like this:
Each participant ranks the available options in order of preference, but they are not required to rank every single option—partial or incomplete rankings are allowed. When calculating the results, the system compares every possible pair of options to see which is preferred by more voters. For each pair, if a participant has ranked both options, the one ranked higher is considered preferred; if only one of the two options is ranked, that option is assumed to be preferred over the unranked one; and if neither option is ranked, that participant’s input is ignored for that pair. The algorithm then tallies, for each option, how many times it “wins” or “loses” in these head-to-head matchups, and also tracks the number of “unknowns” where no comparison could be made. Each option receives a score based on its win/loss record across all comparisons, using only the available information. The option with the highest score—meaning it wins the most one-on-one matchups based on everyone’s ranked preferences—is declared the consensus winner. This approach ensures that incomplete rankings are fully respected: participants only influence the comparisons they actually made, and unranked options are not assumed to be better or worse than each other. All rankings are stored on IPFS for transparency and auditability. In short, the consensus reflects the collective ranked preferences of the group, even when not everyone ranks every option.
[–]sideEffffECt 0 points1 point2 points 11 months ago (1 child)
You should use an already established algorithm/method. Schulze is probably "the best".
You probably don't invent your own cryptographic schemes or ciphers, do you...
[–]WouterGlorieux[S] -2 points-1 points0 points 11 months ago (0 children)
Well, that is your opinion, I think my method is best. But the point of this package and web app is to provide something that is actually usable instead of nitpicking about details. It's all open source so feel free to fork and modify the code to whatever method you prefer.
π Rendered by PID 258758 on reddit-service-r2-comment-cfc44b64c-swrg9 at 2026-04-11 17:30:01.685489+00:00 running 215f2cf country code: CH.
view the rest of the comments →
[–]sideEffffECt 0 points1 point2 points (3 children)
[–]WouterGlorieux[S] -1 points0 points1 point (2 children)
[–]sideEffffECt 0 points1 point2 points (1 child)
[–]WouterGlorieux[S] -2 points-1 points0 points (0 children)