<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Social Protocols</title><link>https://social-protocols.org/</link><description>Recent content on Social Protocols</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Fri, 02 May 2025 00:00:00 +0000</lastBuildDate><atom:link href="https://social-protocols.org/index.xml" rel="self" type="application/rss+xml"/><item><title>What Is a Social Protocol?</title><link>https://social-protocols.org/what-is-a-social-protocol/</link><pubDate>Tue, 10 Dec 2024 00:00:00 +0200</pubDate><guid>https://social-protocols.org/what-is-a-social-protocol/</guid><description>Introduction The rules that determine what gets attention on social platforms are often called &amp;ldquo;algorithms,&amp;rdquo; but algorithms are only part of the story. Another way to understand social platforms is as social protocols, or sets of formal and informal rules that groups use to allocate their collective attention.</description></item><item><title>What Deserves Our Attention?</title><link>https://social-protocols.org/what-deserves-our-attention/</link><pubDate>Mon, 01 May 2023 00:00:00 +0200</pubDate><guid>https://social-protocols.org/what-deserves-our-attention/</guid><description>Every online community has rules that determine how the attention of the community is directed. For example in some online forums, the most up-voted posts are shown at the top of the page.</description></item><item><title>Why Quadratic Funding Is Not Optimal</title><link>https://social-protocols.org/quadratic-funding-is-not-optimal/</link><pubDate>Fri, 02 May 2025 00:00:00 +0000</pubDate><guid>https://social-protocols.org/quadratic-funding-is-not-optimal/</guid><description>Introduction Quadratic funding has received a lot of attention recently as a mechanism for funding public goods. The Gitcoin grants program alone has distributed over $59M through QF funding rounds as of January 20241.</description></item><item><title>Deliberative Consensus Protocols</title><link>https://social-protocols.org/deliberative-consensus-protocols/</link><pubDate>Fri, 05 Apr 2024 00:00:00 +0000</pubDate><guid>https://social-protocols.org/deliberative-consensus-protocols/</guid><description>Introduction: Scalable Group Decision-Making A deliberative consensus protocol is a process that online groups can use to make decisions. It&amp;rsquo;s designed to produce good decisions that are fair and manifest the collective intelligence of the group.</description></item><item><title>Understanding Community Notes and Bridging-Based Ranking</title><link>https://social-protocols.org/understanding-community-notes/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://social-protocols.org/understanding-community-notes/</guid><description>&lt;p>&lt;strong>UPDATE&lt;/strong>: See a discussion of this article on &lt;a href="https://news.ycombinator.com/item?id=38939660">Hacker News&lt;/a>.&lt;/p>
&lt;h2 id="introduction">Introduction&lt;/h2>
&lt;p>&lt;a href="https://www.belfercenter.org/publication/bridging-based-ranking">Bridging-Based Ranking&lt;/a> is a way of scoring and ranking online content that bridges divides.&lt;/p>
&lt;p>The term &amp;ldquo;Bridging-Based Ranking&amp;rdquo; was introduced in &lt;a href="https://www.belfercenter.org/sites/default/files/pantheon_files/files/publication/TAPP-Aviv_BridgingBasedRanking_FINAL_220518_0.pdf">this essay&lt;/a> by Aviv Ovadya of the Harvard Kennedy School Belfer Center. In his essay Ovadya explains how social media algorithms today tend to promote polarization and division. But it doesn&amp;rsquo;t have to be this way. Instead of promoting divisive comment that triggers people&amp;rsquo;s tribal instincts, couldn&amp;rsquo;t the algorithms help find and promote areas of common ground?&lt;/p></description></item><item><title>Multidimensional Community Notes</title><link>https://social-protocols.org/multidimensional-community-notes/</link><pubDate>Fri, 05 Jan 2024 00:00:00 +0000</pubDate><guid>https://social-protocols.org/multidimensional-community-notes/</guid><description>Introduction In my article on Understanding Community Notes, I describe the basic Matrix Factorization algorithm used to identify notes that are helpful despite user polarization. In this article, I introduce a way to break this algorithm and describe an variation of the algorithm that uses 2-factor Matrix factorization.</description></item><item><title>Resources</title><link>https://social-protocols.org/resources/</link><pubDate>Fri, 26 Jan 2024 00:00:00 +0000</pubDate><guid>https://social-protocols.org/resources/</guid><description>This is a curated list of resources we found helpful along the way. Links to commercial websites are not affiliate links. If you spot any errors (e.g., if we have done a poor job summarizing your article or project), feel free to raise an issue.</description></item><item><title>We're Building Jabble: Social Media from the Future</title><link>https://social-protocols.org/social-network/</link><pubDate>Mon, 23 Oct 2023 00:00:00 +0000</pubDate><guid>https://social-protocols.org/social-network/</guid><description>We are in the process of creating a social media platform based on what we&amp;rsquo;ve learned from our experiments during the past years. The core of our concepts is a suite of novel algorithms that distribute attention over content.</description></item><item><title>Human Alignment Technology</title><link>https://social-protocols.org/human-alignment-technology/</link><pubDate>Fri, 02 Jun 2023 00:00:00 +0200</pubDate><guid>https://social-protocols.org/human-alignment-technology/</guid><description>Human alignment, the process of establishing shared understanding among individuals, is crucial for effective collaboration and organization. It is essential for civilizations to flourish.</description></item><item><title>About Social Protocols</title><link>https://social-protocols.org/about/</link><pubDate>Mon, 01 May 2023 00:00:00 +0000</pubDate><guid>https://social-protocols.org/about/</guid><description>The goal of Social Protocols is to enhance collective intelligence. We are working on open algorithms and protocols that benefit large scale human interaction.
Follow us on Mastodon or Twitter, or send a mail.</description></item><item><title>The Law of Attention</title><link>https://social-protocols.org/the-law-of-attention/</link><pubDate>Mon, 13 Sep 2021 00:00:00 +0200</pubDate><guid>https://social-protocols.org/the-law-of-attention/</guid><description>In this article, I argue that we can apply game theory to explain and control the behaviors that dominate in an online community. Not only can game theory explain why misinformation and abuse are so common in social platforms, it can be used to design social platforms that will be filled with honest, informed, civil, and behavior.</description></item><item><title>Truthtelling Games</title><link>https://social-protocols.org/truthtelling-games/</link><pubDate>Sun, 12 Sep 2021 00:00:00 +0200</pubDate><guid>https://social-protocols.org/truthtelling-games/</guid><description>In this article, I will use game theory to explain why, under certain conditions, otherwise dishonest Internet people will behave with scrupulous honesty, and how social platforms can be intentionally engineered to create these conditions.</description></item><item><title>Give Truth the Advantage</title><link>https://social-protocols.org/give-truth-the-advantage/</link><pubDate>Wed, 08 Sep 2021 00:00:00 +0200</pubDate><guid>https://social-protocols.org/give-truth-the-advantage/</guid><description>Everyone knows that the infamous social media algorithms promote the spread of false and misleading information on the Internet. But could they be engineered to do the opposite?</description></item><item><title>The Deliberative Poll</title><link>https://social-protocols.org/the-deliberative-poll/</link><pubDate>Sun, 08 Nov 2020 13:40:43 -0700</pubDate><guid>https://social-protocols.org/the-deliberative-poll/</guid><description>&lt;p>A deliberative poll measures the &lt;strong>informed opinion&lt;/strong> of a group of people who have participated in a discussion about the topic of the poll. This essay introduces a method for integrating deliberative polling into online discussions in social platforms, in order to discover the informed opinion of a group.&lt;/p></description></item><item><title/><link>https://social-protocols.org/research-notes/2024-02-05--top-note-algorithm/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://social-protocols.org/research-notes/2024-02-05--top-note-algorithm/</guid><description>Review of the Top Note Algorithm We are considering two posts: $A$ and $B$. $B$ is a reply to $A$.
Then we are observing the following events:
$u_A := \text{the event that a vote on A is an upvote}$ $u_B := \text{analogous}$ $s_B := \text{the user was shown post B}$ $\bar{s_B} := \text{the user was not shown post B}$ $s_{B*} := \text{the user was shown the top note on B}$ $\bar{s_{B*}} := \text{the user was not shown the top note on B}$ Then we define two quantities:</description></item><item><title/><link>https://social-protocols.org/research-notes/2024-02-06-informed-probability/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://social-protocols.org/research-notes/2024-02-06-informed-probability/</guid><description>Measuring Informed Probability Our scoring formula starts with an estimate of the probability that a user upvotes a post, and then observes how exposure to information in the note influences that probability.</description></item><item><title/><link>https://social-protocols.org/research-notes/2024-02-06-vote-tallies/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://social-protocols.org/research-notes/2024-02-06-vote-tallies/</guid><description>Computing Vote Tallies The notes here have been updated and moved to 2024-05-24-calculating-tallies.md</description></item><item><title/><link>https://social-protocols.org/research-notes/2024-02-10-brigading-solution-matrix-factorization/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://social-protocols.org/research-notes/2024-02-10-brigading-solution-matrix-factorization/</guid><description>Thoughts on &amp;ldquo;Brigading&amp;rdquo; The community notes algorithm, doesn&amp;rsquo;t solve the problem of &amp;ldquo;brigading&amp;rdquo;, or the &amp;ldquo;self-selection problem.&amp;rdquo;
But here&amp;rsquo;s an idea how a variation of this algorithm could solve the problem.</description></item><item><title/><link>https://social-protocols.org/research-notes/2024-03-01-support-formula/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://social-protocols.org/research-notes/2024-03-01-support-formula/</guid><description>Derivation of the &amp;ldquo;Support Formula&amp;rdquo; The Problem Suppose we have an estimate of the effect of note B on post A, and the effect of subnote C on note B. Should we be able to predict the effect of subnote C on post A.</description></item><item><title/><link>https://social-protocols.org/research-notes/2024-03-05-support-formula-derivation/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://social-protocols.org/research-notes/2024-03-05-support-formula-derivation/</guid><description>More Formal Derivation of Support Formula In my notes on the support formula I used some fairly informal reasoning to derive the formula.
Here are my thoughts on a somewhat more formal derivation.</description></item><item><title/><link>https://social-protocols.org/research-notes/2024-03-07-adjustment-for-informed-vote-selection-bias/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://social-protocols.org/research-notes/2024-03-07-adjustment-for-informed-vote-selection-bias/</guid><description>Adjustment for Informed Vote Selection Bias The informed upvote probability calculated from the informed tally suffers from a selection bias. People who choose to vote on the note may vote differently on the post from people who don&amp;rsquo;t vote on the note.</description></item><item><title/><link>https://social-protocols.org/research-notes/2024-03-07-improvements-to-algorithm/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://social-protocols.org/research-notes/2024-03-07-improvements-to-algorithm/</guid><description>Improvements to Scoring Algorithm Fix algorithm for 3-level arguments (post-&amp;gt;note-&amp;gt;subnote): estimate $P(A|C)$ using tallies for A given considered C. Better heuristic for top note: $informedVotes × relativeEntropy$ Adjustment for Informed Vote Selection Bias Adjustment for Entrenchment Bias: Users&amp;rsquo; informed votes influenced by whether they voted on post before voting on note Implement/Improve support formula (use $P(note|subnote)$ to inform prior for $P(post|subnote)$: deal with probabilities below 0 or about 1 improvements based on notes in 2024-03-05-support-formula-derivation.</description></item><item><title/><link>https://social-protocols.org/research-notes/2024-03-27-questions/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://social-protocols.org/research-notes/2024-03-27-questions/</guid><description>Question Model Here&amp;rsquo;s a review of an idea we have had for adding questions to our model and the possible benefits.
UI A post can be a question, and the UI enforces that it is worded like a question.</description></item><item><title/><link>https://social-protocols.org/research-notes/2024-04-09-feedback-deliberative-consensus-protocol/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://social-protocols.org/research-notes/2024-04-09-feedback-deliberative-consensus-protocol/</guid><description>2024-04-09: Feedback on &amp;ldquo;Deliberative Consensus Protocol&amp;rdquo; Link: https://social-protocols.org/deliberative-consensus-protocols/
Introduction: Scalable Group Decision-Making However, there are solutions to all these problems!
That sounds like too enticing of a promise too early on in the essay.</description></item><item><title/><link>https://social-protocols.org/research-notes/2024-05-24-calculating-tallies/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://social-protocols.org/research-notes/2024-05-24-calculating-tallies/</guid><description>Calculation of Informed and Uninformed Tallies Background: Effects One of the most important concepts in the GlobalBrain algorithm is the &amp;ldquo;effect&amp;rdquo; of a reply on a target. We use the term &amp;ldquo;target&amp;rdquo; to refer to the post being affected.</description></item><item><title/><link>https://social-protocols.org/research-notes/2024-06-03-choosing-priors/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://social-protocols.org/research-notes/2024-06-03-choosing-priors/</guid><description>Choosing Prior Upvote Probability We currently use a prior of $Beta(0.25, .025)$ for the uninformed upvote probability.
This was arrived at from two different directions:
1. The Empirical Prior The &amp;lsquo;Empirical Prior&amp;rsquo; of $Beta(.</description></item><item><title/><link>https://social-protocols.org/research-notes/2024-06-10-transitive-support-formula-review/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://social-protocols.org/research-notes/2024-06-10-transitive-support-formula-review/</guid><description>Uses of the Transitive Support Formula This note briefly reviews the support formula, why we are not using it now, and how we could use it.
The support formula allows us to estimate effects transitively: e.</description></item><item><title/><link>https://social-protocols.org/research-notes/2024-06-10-weighted-average-informed-probability/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://social-protocols.org/research-notes/2024-06-10-weighted-average-informed-probability/</guid><description>Proposed Change to Scoring Formula I think that we should change our scoring formula to calculate p not based on a single critical thread, but as a weighted average of all argument threads.</description></item><item><title/><link>https://social-protocols.org/research-notes/2024-07-16-rationales-on-weights-in-score-calculations/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://social-protocols.org/research-notes/2024-07-16-rationales-on-weights-in-score-calculations/</guid><description>[!NOTE] Moved here from src/lib/score.jl in GlobalBrain.jl.
weight returns a score for determining the top comment for purposes of calculating the informed probability of the post. It is a measure of how much the critical thread that starts with that comment changes the probability of upvoting the post.</description></item><item><title/><link>https://social-protocols.org/research-notes/2024-07-19-notes-on-imbalance-score/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://social-protocols.org/research-notes/2024-07-19-notes-on-imbalance-score/</guid><description>Notes on 2024-07-19-thoughts-on-convincingness.md This note is a response to Johannes&amp;rsquo;s 2024-07-19-thoughts-on-convincingness.md
&amp;ldquo;Imbalance&amp;rdquo; ≈ &amp;ldquo;Statistical Independence&amp;rdquo; It seems to me that &amp;ldquo;imbalance&amp;rdquo; as you are defining it boils down to statistical independence, or lack of correlation.</description></item><item><title/><link>https://social-protocols.org/research-notes/2024-07-19-thoughts-on-convincingness/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://social-protocols.org/research-notes/2024-07-19-thoughts-on-convincingness/</guid><description>Measuring Convincingness A lot of the Global Brain algorithm revolves around the concept of convincingness. We approached the concept of convincingness as how convincing a comment is with regard to the post it replies to, measuring it as how likely users are to change their vote on the target post, given that they considered the comment.</description></item><item><title/><link>https://social-protocols.org/research-notes/2024-10-03-factcheck-based-scoring/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://social-protocols.org/research-notes/2024-10-03-factcheck-based-scoring/</guid><description>Proposed New Factcheck-Based Algorithm So what if, under a fact checks or opinion poll, all replies are other fact checks.
The system then chooses the top sub fact-check (initially, the one with the most upvotes).</description></item><item><title/><link>https://social-protocols.org/research-notes/2024-10-09-merging-community-notes-matrix-factorization/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://social-protocols.org/research-notes/2024-10-09-merging-community-notes-matrix-factorization/</guid><description>Merging Community Notes Matrix Factorization into the Global Brain The primary goal of the global algorithm is to estimate informed opinion &amp;ndash; how users would vote on a item given they had considered all the comments on the item.</description></item></channel></rss>