84 lines
3.5 KiB
Python
Executable File
84 lines
3.5 KiB
Python
Executable File
'''
|
|
Onionr - Private P2P Communication
|
|
|
|
Use a communicator instance to announce our transport address to connected nodes
|
|
'''
|
|
'''
|
|
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/>.
|
|
'''
|
|
import base64
|
|
import onionrproofs, logger
|
|
from etc import onionrvalues
|
|
|
|
def announce_node(daemon):
|
|
'''Announce our node to our peers'''
|
|
ov = onionrvalues.OnionrValues()
|
|
retData = False
|
|
announceFail = False
|
|
|
|
# Do not let announceCache get too large
|
|
if len(daemon.announceCache) >= 10000:
|
|
daemon.announceCache.popitem()
|
|
|
|
if daemon._core.config.get('general.security_level', 0) == 0:
|
|
# Announce to random online peers
|
|
for i in daemon.onlinePeers:
|
|
if not i in daemon.announceCache and not i in daemon.announceProgress:
|
|
peer = i
|
|
break
|
|
else:
|
|
peer = daemon.pickOnlinePeer()
|
|
|
|
for x in range(1):
|
|
if x == 1 and daemon._core.config.get('i2p.host'):
|
|
ourID = daemon._core.config.get('i2p.own_addr').strip()
|
|
else:
|
|
ourID = daemon._core.hsAddress.strip()
|
|
|
|
url = 'http://' + peer + '/announce'
|
|
data = {'node': ourID}
|
|
|
|
combinedNodes = ourID + peer
|
|
if ourID != 1:
|
|
#TODO: Extend existingRand for i2p
|
|
existingRand = daemon._core._utils.bytesToStr(daemon._core.getAddressInfo(peer, 'powValue'))
|
|
# Reset existingRand if it no longer meets the minimum POW
|
|
if type(existingRand) is type(None) or not existingRand.endswith('0' * ov.announce_pow):
|
|
existingRand = ''
|
|
|
|
if peer in daemon.announceCache:
|
|
data['random'] = daemon.announceCache[peer]
|
|
elif len(existingRand) > 0:
|
|
data['random'] = existingRand
|
|
else:
|
|
daemon.announceProgress[peer] = True
|
|
proof = onionrproofs.DataPOW(combinedNodes, forceDifficulty=ov.announce_pow)
|
|
del daemon.announceProgress[peer]
|
|
try:
|
|
data['random'] = base64.b64encode(proof.waitForResult()[1])
|
|
except TypeError:
|
|
# Happens when we failed to produce a proof
|
|
logger.error("Failed to produce a pow for announcing to " + peer)
|
|
announceFail = True
|
|
else:
|
|
daemon.announceCache[peer] = data['random']
|
|
if not announceFail:
|
|
logger.info('Announcing node to ' + url)
|
|
if daemon._core._utils.doPostRequest(url, data) == 'Success':
|
|
logger.info('Successfully introduced node to ' + peer)
|
|
retData = True
|
|
daemon._core.setAddressInfo(peer, 'introduced', 1)
|
|
daemon._core.setAddressInfo(peer, 'powValue', data['random'])
|
|
daemon.decrementThreadCount('announce_node')
|
|
return retData |