New: pseudonympairsAll contenthive-129948krhive-196917steemzzanhive-183959hive-166405hive-185836photographyhive-180932uncommonlabhive-183397hive-101145hive-150122hive-188619bitcoinhive-144064krsuccesshive-145157lifehive-193637hive-184714hive-181136hive-109690hive-103599TrendingNewHotLikersjohan-nygren (63)in pseudonympairs • 4 years agoPseudonym Pairs fake accountsI think this script calculates collusion attacks in Pseudonym Pairs correct. If you attack with 10%, you'll be able to gain control 11% of the population (10% + 1%). If 20% collude (1.6 billion…johan-nygren (63)in pseudonympairs • 4 years agoPerfecting randomization in Pseudonym Pairs, using consensus-by-betRandomization in Pseudonym Pairs is trivial if a random seed can be generated. How to do that is something that can be perfected. But to demo the system, what is in test net implementation…johan-nygren (63)in pseudonympairs • 4 years agoThe long-term goal of perfecting the randomization in Pseudonym PairsThe weak point in the randomization is the validators. To perfect randomization, Pseudonym Pairs will likely use a commit-reveal scheme. Each person commits random numbers during registration phase.…johan-nygren (63)in pseudonympairs • 4 years agoOne approach to man-in-the-middle attack in Pseudonym PairsConsidering adapting the protocol for the "pre-meetings" approach to man in middle attack. They actually improve the "Turing test" (PP not a turing test since it is human-centric, but the metaphor…johan-nygren (63)in pseudonympairs • 5 years agoscheduling in Pseudonym Pairs revisitedPseudonym Pairs is built around a simple schedule, and all actions are contained within the period your "proof-of-personhood" is valid. In the reference implementation I am writing, a modifier…johan-nygren (63)in pseudonympairs • 5 years agoPseudonym Pairs reference implementationThe code for issuing "border tokens", giving a random person the ability to issue one more. This mechanism is used to allow the swarm to grow as fast as it wants. Think a colony of bacteria, or a…johan-nygren (63)in pseudonympairs • 5 years agoPseudonym Pairs as an egalitarian social coordination protocolThe game theory in Pseudonym Pairs is that pairs are broken if there is a conflict. As long as people play nice, people only meet 1 on 1. Mob rule is only introduced if there is a conflict, 2 over…johan-nygren (63)in pse • 5 years agoPseudonym Pairs, most of what I think is needed for the full systemuint genesisEvent = 1580540400;johan-nygren (63)in pseudonympairs • 5 years agoPseudonym Pairs reference implementationRoughly how I'm structuring the Pseudonym Pairs reference implementation at the moment. I'm not a coder, I'm learning as I go along. To implement this is harder for me than for an experienced…johan-nygren (63)in pseudonympairs • 5 years agoThe algorithm for sorting into pairsWhen the event begins, people are in index[registry[msg.sender]]/2 , floored. uint[] index;johan-nygren (63)in pseudonympairs • 5 years agoScheduler for Pseudonym Pairsuint pseudonymEvent = 1578726000;johan-nygren (63)in pseudonympairs • 6 years agonew sorting mechanismnew one, lets people join continuously, everyone ends up in a pair, and people who opt-in can assign themselves to pairs continuously as well. the optIn() function has a few lines that need to be…johan-nygren (63)in pseudonympairs • 6 years agoanother sorting mechanismanother one. good thing about this one is that every person sorted ends up in a pair, except if there is an uneven number. and, no need to index anything beforehand.johan-nygren (63)in pseudonympairs • 6 years agoGas cost per person for scheduling, over infinite pseudonym eventsThis here does scheduling. No input needed except for the people using the system. Once deployed it operates with no other input than the people it mediates. Gas cost per person for scheduling, per…
.png)
