Skip to main content
  • Home
  • Development
  • Documentation
  • Donate
  • Operational login
  • Browse the archive

swh logo
SoftwareHeritage
Software
Heritage
Archive
Features
  • Search

  • Downloads

  • Save code now

  • Add forge now

  • Help

  • bbb89f8
  • /
  • Figure 6 -- Tokens Task Data Analysis
  • /
  • prob_choice.m
Raw File Download

To reference or cite the objects present in the Software Heritage archive, permalinks based on SoftWare Hash IDentifiers (SWHIDs) must be used.
Select below a type of object currently browsed in order to display its associated SWHID and permalink.

  • content
  • directory
content badge
swh:1:cnt:47040c4200c24e9472b9e992052067467dd66a7e
directory badge
swh:1:dir:d615f04e1fe23058870cce8c51d6ba6cdac3dbd8

This interface enables to generate software citations, provided that the root directory of browsed objects contains a citation.cff or codemeta.json file.
Select below a type of object currently browsed in order to generate citations for them.

  • content
  • directory
Generate software citation in BibTex format (requires biblatex-software package)
Generating citation ...
Generate software citation in BibTex format (requires biblatex-software package)
Generating citation ...
prob_choice.m
function p = prob_choice(nTokensPro, nTokensCon, nTokensTot)

% PROB_CHOICE Calculate the probability that a given bin will receive more tokens
%
% p = prob_choice(nTokensPro, nTokensCon, nTokensTot)
%
% nTokensPro      - Number of tokens in favor of the choice
% nTokensCon      - Number of tokens against the choice
% nTokensTot      - Total number of tokens
%
% p               - Probability that Pro will be larger than Con when all tokens are committed

if rem(nTokensTot,2)==0
   nTokensTot = nTokensTot-1;
end

nNeedPro = ceil(nTokensTot / 2) - nTokensCon;  % Need this many more tokens to be in favor

nTokensLeft = nTokensTot - nTokensPro - nTokensCon;

p = 0;

for n=0:nNeedPro-1
   
   if nTokensLeft<n
      return;
   end
   
   % pNK = the probability of getting exactly K pro given that we have N left
   nCombs = 2^nTokensLeft;
   nGoodCombs = factorial(nTokensLeft) / (factorial(n) * factorial(nTokensLeft-n));
   
   pNK = nGoodCombs / nCombs;
   
   p = p + pNK;
   
end


back to top

Software Heritage — Copyright (C) 2015–2025, The Software Heritage developers. License: GNU AGPLv3+.
The source code of Software Heritage itself is available on our development forge.
The source code files archived by Software Heritage are available under their own copyright and licenses.
Terms of use: Archive access, API— Content policy— Contact— JavaScript license information— Web API