ceremonyclient/node/p2p/peer_info_manager.go
Cassandra Heart 2bbd1e0690
v1.4.18 (#193)
* Remove bootstrap peer (#189)

* Change bootstrap servers to DHT-only peers (#187)

* support voucher file-based claims (#183)

* Change bootstrap servers to DHT-only peers

Changing my bootstrap servers to DHT-only peers with somewhat lower
specs. One of the new ones is in the US and the other one is in
Switzerland. Both use reliable providers and have 10Gbps network
interfaces.

---------

Co-authored-by: Cassandra Heart <7929478+CassOnMars@users.noreply.github.com>

* Don't run self-test in DHT-only mode (#186)

* support voucher file-based claims (#183)

* Don't run self-test in DHT-only mode

The node tries to create a self-test when ran with the `-dht-only`
flag, but it doesn't load the KZG ceremony data in DHT-only mode
which leads to a crash.

Don't run self-test when the `-dht-only` flag is set.

I tested by starting a node locally with and without existing
self-test and with the `-dht-only` flag.

---------

Co-authored-by: Cassandra Heart <7929478+CassOnMars@users.noreply.github.com>

* Embed json files in binary (#182)

* Embed ceremony.json in binary

* Embed retroactive_peers.json in binary

* Signers build and verification tasks (#181)

* add signers specific Taskfile

* add verify tasks

* move signer task under signer folder

* create docker image specific for signers

* map current user into docker image and container

* ignore node-tmp-*

* add verify:build:internal

* prevent tasks with docker commands from being run inside a container

* rename *:internal to *:container

* add README.md

* add pem files to git

* Updating Q Guide link (#173)

* Update README.md

Updated link to Quilibrium guide to new website

* Update README.md

* feat: network switching and namespaced announce strings/bitmasks (#190)

* feat: network switching and namespaced announce strings/bitmasks

* bump version name and logo

* feat: mini pomw proofs as part of peer manifest (#191)

* shift default config directory under current folder (#176)

* feat: signature check (#192)

* feat: signature check

* adjust docker command so it doesn't invoke sigcheck

* remove old version

* add binaries and digests

* fix bug, revert build

* shasum has weird byte at end

* proper binaries and digests

* Signatory #13 added

* Signatory #3 added

* Signer 4 (#194)

* Signatory #5 added

* Signatory #9 added (#195)

* Signatory #1 added

* added sig.6 files (#196)

* Signatories #8 and #16 added

* Signatory #12 added

* Add signature (#197)

* reset build for v1.4.18 after testnet bug

* updated build, resigned by #13

* Signatory #16 added

* added sig.6 files (#198)

* Signatory #8 added

* Signatory #17 added

* Signatory #1 added

* Signatory #7 added

* Signatory #4 added

* Signatory #14 added

* remove binaries, ready to ship

---------

Co-authored-by: littleblackcloud <163544315+littleblackcloud@users.noreply.github.com>
Co-authored-by: Agost Biro <5764438+agostbiro@users.noreply.github.com>
Co-authored-by: Marius Scurtescu <marius.scurtescu@gmail.com>
Co-authored-by: Demipoet <161999657+demipoet@users.noreply.github.com>
Co-authored-by: 0xOzgur <29779769+0xOzgur@users.noreply.github.com>
Co-authored-by: Freekers <1370857+Freekers@users.noreply.github.com>
2024-05-25 00:22:50 -05:00

148 lines
3.2 KiB
Go

package p2p
import (
"bytes"
"sync"
"go.uber.org/zap"
)
type PeerInfoManager interface {
Start()
Stop()
AddPeerInfo(manifest *PeerManifest)
GetPeerInfo(peerId []byte) *PeerManifest
GetPeerMap() map[string]*PeerManifest
GetPeersBySpeed() [][]byte
}
type Capability struct {
ProtocolIdentifier uint32
AdditionalMetadata []byte
}
type PeerManifest struct {
PeerId []byte
Difficulty uint32
DifficultyMetric int64
Commit_16Metric int64
Commit_128Metric int64
Commit_1024Metric int64
Commit_65536Metric int64
Proof_16Metric int64
Proof_128Metric int64
Proof_1024Metric int64
Proof_65536Metric int64
Cores uint32
Memory []byte
Storage []byte
Capabilities []Capability
MasterHeadFrame uint64
Bandwidth uint64
LastSeen int64
}
type InMemoryPeerInfoManager struct {
logger *zap.Logger
peerInfoCh chan *PeerManifest
quitCh chan struct{}
peerInfoMx sync.RWMutex
peerMap map[string]*PeerManifest
fastestPeers []*PeerManifest
}
var _ PeerInfoManager = (*InMemoryPeerInfoManager)(nil)
func NewInMemoryPeerInfoManager(logger *zap.Logger) *InMemoryPeerInfoManager {
return &InMemoryPeerInfoManager{
logger: logger,
peerInfoCh: make(chan *PeerManifest),
fastestPeers: []*PeerManifest{},
peerMap: make(map[string]*PeerManifest),
}
}
func (m *InMemoryPeerInfoManager) Start() {
go func() {
for {
select {
case manifest := <-m.peerInfoCh:
m.peerInfoMx.Lock()
m.peerMap[string(manifest.PeerId)] = manifest
m.searchAndInsertPeer(manifest)
m.peerInfoMx.Unlock()
case <-m.quitCh:
return
}
}
}()
}
func (m *InMemoryPeerInfoManager) Stop() {
go func() {
m.quitCh <- struct{}{}
}()
}
func (m *InMemoryPeerInfoManager) AddPeerInfo(manifest *PeerManifest) {
go func() {
m.peerInfoCh <- manifest
}()
}
func (m *InMemoryPeerInfoManager) GetPeerInfo(peerId []byte) *PeerManifest {
m.peerInfoMx.RLock()
manifest, ok := m.peerMap[string(peerId)]
m.peerInfoMx.RUnlock()
if !ok {
return nil
}
return manifest
}
func (m *InMemoryPeerInfoManager) GetPeerMap() map[string]*PeerManifest {
data := make(map[string]*PeerManifest)
m.peerInfoMx.RLock()
for k, v := range m.peerMap {
data[k] = v
}
m.peerInfoMx.RUnlock()
return data
}
func (m *InMemoryPeerInfoManager) GetPeersBySpeed() [][]byte {
result := [][]byte{}
m.peerInfoMx.RLock()
for _, info := range m.fastestPeers {
result = append(result, info.PeerId)
}
m.peerInfoMx.RUnlock()
return result
}
// blatantly lifted from slices.BinarySearchFunc, optimized for direct insertion
// and uint64 comparison without overflow
func (m *InMemoryPeerInfoManager) searchAndInsertPeer(manifest *PeerManifest) {
n := len(m.fastestPeers)
i, j := 0, n
for i < j {
h := int(uint(i+j) >> 1)
if m.fastestPeers[h].Bandwidth > manifest.Bandwidth {
i = h + 1
} else {
j = h
}
}
if i < n && m.fastestPeers[i].Bandwidth == manifest.Bandwidth &&
bytes.Equal(m.fastestPeers[i].PeerId, manifest.PeerId) {
m.fastestPeers[i] = manifest
} else {
m.fastestPeers = append(m.fastestPeers, new(PeerManifest))
copy(m.fastestPeers[i+1:], m.fastestPeers[i:])
m.fastestPeers[i] = manifest
}
}