Onionr/src/gossip/client/__init__.py

91 lines
2.6 KiB
Python

"""Onionr - Private P2P Communication.
Dandelion ++ Gossip client logic
"""
import traceback
from typing import TYPE_CHECKING
from typing import Set, List
from time import sleep
from queue import Queue
from onionrblocks import Block
from gossip.client.storeblocks import store_blocks
from ..constants import DANDELION_EPOCH_LENGTH
from ..connectpeer import connect_peer
if TYPE_CHECKING:
from ..peer import Peer
import logger
import onionrplugins
from ..commands import GossipCommands
from gossip.dandelion.phase import DandelionPhase
from onionrthreads import add_onionr_thread
from blockdb import store_vdf_block
from .announce import do_announce
from .dandelionstem import stem_out
from .peerexchange import get_new_peers
"""
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
"""
def gossip_client(
peer_set: Set['Peer'],
block_queues: List[Queue['Block']],
dandelion_seed: bytes):
"""
Gossip client does the following:
Stem new blocks we created or downloaded *during stem phase*
Stream new blocks
"""
bl: Block
do_announce(peer_set)
# Start a thread that runs every 1200 secs to
# Ask peers for a subset for their peer set
# The transport addresses for said peers will
# be passed to a plugin event where the respective
# transport plugin handles the new peer
add_onionr_thread(
get_new_peers,
1200, peer_set, initial_sleep=5)
dandelion_phase = DandelionPhase(dandelion_seed, DANDELION_EPOCH_LENGTH)
while True:
while not len(peer_set):
sleep(0.2)
if dandelion_phase.remaining_time <= 10:
sleep(dandelion_phase.remaining_time)
if dandelion_phase.is_stem_phase():
try:
# Stem out blocks for (roughly) remaining epoch time
stem_out(
block_queues, peer_set, dandelion_phase)
except TimeoutError:
continue
continue
else:
# Add block to primary block db, where the diffuser can read it
store_blocks(block_queues, dandelion_phase)