Table of Contents
Fetching ...

Proof-of-Social-Capital: A Consensus Protocol Replacing Stake for Social Capital

Juraj Mariani, Ivan Homoliak

TL;DR

This paper introduces Proof-of-Social-Capital (PoSC), a consensus protocol that replaces financial stake with non-transferable social capital derived from social influence and endorsements. It combines privacy-preserving technologies (zkSNARKs, verifiable credentials) with identity fingerprints and a Whisk-like, randomness-based leader election to achieve Sybil-resistance and decentralization. A robust bootstrapping and scaling framework, including a non-linear scaling of social capital, aims to prevent monopolization and improve equity, while an incentive scheme rewards valid block production and follower engagement. The authors provide a Python-based prototype (Scap) and evaluate ZK overhead, inequality metrics (Gini coefficient), and scalability considerations, acknowledging security concerns such as off-chain bribery and trusted issuers and proposing potential extensions like post-quantum cryptography and hybrid models with stake.

Abstract

Consensus protocols used today in blockchains often rely on computational power or financial stakes - scarce resources. We propose a novel protocol using social capital - trust and influence from social interactions - as a non-transferable staking mechanism to ensure fairness and decentralization. The methodology integrates zero-knowledge proofs, verifiable credentials, a Whisk-like leader election, and an incentive scheme to prevent Sybil attacks and encourage engagement. The theoretical framework would enhance privacy and equity, though unresolved issues like off-chain bribery require further research. This work offers a new model aligned with modern social media behavior and lifestyle, with applications in finance, providing a practical insight for decentralized system development.

Proof-of-Social-Capital: A Consensus Protocol Replacing Stake for Social Capital

TL;DR

This paper introduces Proof-of-Social-Capital (PoSC), a consensus protocol that replaces financial stake with non-transferable social capital derived from social influence and endorsements. It combines privacy-preserving technologies (zkSNARKs, verifiable credentials) with identity fingerprints and a Whisk-like, randomness-based leader election to achieve Sybil-resistance and decentralization. A robust bootstrapping and scaling framework, including a non-linear scaling of social capital, aims to prevent monopolization and improve equity, while an incentive scheme rewards valid block production and follower engagement. The authors provide a Python-based prototype (Scap) and evaluate ZK overhead, inequality metrics (Gini coefficient), and scalability considerations, acknowledging security concerns such as off-chain bribery and trusted issuers and proposing potential extensions like post-quantum cryptography and hybrid models with stake.

Abstract

Consensus protocols used today in blockchains often rely on computational power or financial stakes - scarce resources. We propose a novel protocol using social capital - trust and influence from social interactions - as a non-transferable staking mechanism to ensure fairness and decentralization. The methodology integrates zero-knowledge proofs, verifiable credentials, a Whisk-like leader election, and an incentive scheme to prevent Sybil attacks and encourage engagement. The theoretical framework would enhance privacy and equity, though unresolved issues like off-chain bribery require further research. This work offers a new model aligned with modern social media behavior and lifestyle, with applications in finance, providing a practical insight for decentralized system development.
Paper Structure (42 sections, 5 figures, 1 table)

This paper contains 42 sections, 5 figures, 1 table.

Figures (5)

  • Figure 1: Overview of the proposed protocol.
  • Figure 2: Identity verification process.
  • Figure 3: Block proposal and (re)assignment of social capital. The dashed line is used for off-chain messages.
  • Figure 4: Gini coefficients in different scenarios of platform monetization.
  • Figure 5: Time and memory overhead of the included zkSNARK proof. The zkSNARK circuit consists of circa 600k R1 constraints.