#!@PYTHON@
# This file is part of GNUnet
# (C) 2013, 2018 Christian Grothoff (and other contributing authors)
#
# GNUnet is free software: you can redistribute it and/or modify it
# under the terms of the GNU Affero General Public License as published
# by the Free Software Foundation, either version 3 of the License,
# or (at your option) any later version.
#
# GNUnet is distributed in the hope that it will be useful, but
# WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Affero General Public License for more details.
#
# You should have received a copy of the GNU Affero General Public License
# along with this program. If not, see .
from __future__ import absolute_import
from __future__ import print_function
import argparse
import random
from math import ceil, log, floor
from past.builtins import xrange
def bsc(n):
""" count the bits set in n"""
l = n.bit_length()
c = 0
x = 1
for _ in range(0, l):
if n & x:
c = c + 1
x = x << 1
return c
def simulate(k, n, verbose):
assert k < n
largest_arc = int(2**ceil(log(n, 2))) / 2
num_ghosts = (2 * largest_arc) - n
if verbose:
print("we have", num_ghosts, "ghost peers")
# n.b. all peers with idx 1:
print("type of", str(peer_physical) + ":", peer_type)
info = new_info
arc = arc << 1
rounds = rounds + 1
random.shuffle(peers)
return rounds
if __name__ == "__main__":
parser = argparse.ArgumentParser()
parser.add_argument("k", metavar="k", type=int, help="#(bad peers)")
parser.add_argument("n", metavar="n", type=int, help="#(all peers)")
parser.add_argument("r", metavar="r", type=int, help="#(rounds)")
parser.add_argument('--verbose', '-v', action='count')
args = parser.parse_args()
sum = 0.0
for n in xrange(0, args.r):
sum += simulate(args.k, args.n, args.verbose)
print(sum / args.r)