MétaCan
Menu
Back to cohort
Record W4405181946 · doi:10.1145/3658644.3691414

Poster: Solving the Free-rider Problem in Bittensor

2024· article· en· W4405181946 on OpenAlexaff
Sin Tai Liu, Jia Yuan Yu, Jacob Steeves

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicInternet Traffic Analysis and Secure E-voting
Canadian institutionsConcordia University
Fundersnot available
KeywordsCopyingCommitScheme (mathematics)Computer scienceFunction (biology)Power (physics)Duration (music)Computer securityDistributed computingMathematicsDatabaseLaw

Abstract

fetched live from OpenAlex

The design and operation of Bittensor is a decentralized and anonymous system where actors are incentivized by rewards to provide utilities.To ensure that it is a fair game, utilities obtained by copying other participants should be identified and punished.Our first contribution is to apply a commitment scheme to address this free-rider problem.Under appropriate conditions, we show theoretically and empirically that a commitment scheme dissuades copying by reducing the rewards to the copier.In particular, this dissuasive power is a function of the duration between the commit-and reveal-steps.Our second contribution is to propose the liquid alpha solution to amplify the effect of the commitment scheme.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.992
Threshold uncertainty score0.529

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.011
GPT teacher head0.229
Teacher spread0.218 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2024
Admission routes1
Has abstractyes

Explore more

Same topicInternet Traffic Analysis and Secure E-votingFrench-language works237,207