mirror of
https://github.com/QuilibriumNetwork/ceremonyclient.git
synced 2026-03-01 22:37:27 +08:00
* v2.1.0.2 * restore tweaks to simlibp2p * fix: nil ref on size calc * fix: panic should induce shutdown from event_distributor * fix: friendlier initialization that requires less manual kickstarting for test/devnets * fix: fewer available shards than provers should choose shard length * fix: update stored worker registry, improve logging for debug mode * fix: shut the fuck up, peer log * qol: log value should be snake cased * fix:non-archive snap sync issues * fix: separate X448/Decaf448 signed keys, add onion key to registry * fix: overflow arithmetic on frame number comparison * fix: worker registration should be idempotent if inputs are same, otherwise permit updated records * fix: remove global prover state from size calculation * fix: divide by zero case * fix: eager prover * fix: broadcast listener default * qol: diagnostic data for peer authenticator * fix: master/worker connectivity issue in sparse networks tight coupling of peer and workers can sometimes interfere if mesh is sparse, so give workers a pseudoidentity but publish messages with the proper peer key * fix: reorder steps of join creation * fix: join verify frame source + ensure domain is properly padded (unnecessary but good for consistency) * fix: add delegate to protobuf <-> reified join conversion * fix: preempt prover from planning with no workers * fix: use the unallocated workers to generate a proof * qol: underflow causes join fail in first ten frames on test/devnets * qol: small logging tweaks for easier log correlation in debug mode * qol: use fisher-yates shuffle to ensure prover allocations are evenly distributed when scores are equal * qol: separate decisional logic on post-enrollment confirmation into consensus engine, proposer, and worker manager where relevant, refactor out scoring * reuse shard descriptors for both join planning and confirm/reject decisions * fix: add missing interface method and amend test blossomsub to use new peer id basis * fix: only check allocations if they exist * fix: pomw mint proof data needs to be hierarchically under global intrinsic domain * staging temporary state under diagnostics * fix: first phase of distributed lock refactoring * fix: compute intrinsic locking * fix: hypergraph intrinsic locking * fix: token intrinsic locking * fix: update execution engines to support new locking model * fix: adjust tests with new execution shape * fix: weave in lock/unlock semantics to liveness provider * fix lock fallthrough, add missing allocation update * qol: additional logging for diagnostics, also testnet/devnet handling for confirmations * fix: establish grace period on halt scenario to permit recovery * fix: support test/devnet defaults for coverage scenarios * fix: nil ref on consensus halts for non-archive nodes * fix: remove unnecessary prefix from prover ref * add test coverage for fork choice behaviors and replay – once passing, blocker (2) is resolved * fix: no fork replay on repeat for non-archive nodes, snap now behaves correctly * rollup of pre-liveness check lock interactions * ahead of tests, get the protobuf/metrics-related changes out so teams can prepare * add test coverage for distributed lock behaviors – once passing, blocker (3) is resolved * fix: blocker (3) * Dev docs improvements (#445) * Make install deps script more robust * Improve testing instructions * Worker node should stop upon OS SIGINT/SIGTERM signal (#447) * move pebble close to Stop() * move deferred Stop() to Start() * add core id to worker stop log message * create done os signal channel and stop worker upon message to it --------- Co-authored-by: Cassandra Heart <7929478+CassOnMars@users.noreply.github.com> --------- Co-authored-by: Daz <daz_the_corgi@proton.me> Co-authored-by: Black Swan <3999712+blacks1ne@users.noreply.github.com>
91 lines
1.8 KiB
Go
91 lines
1.8 KiB
Go
package internal
|
|
|
|
import (
|
|
"context"
|
|
"sync"
|
|
"time"
|
|
|
|
"github.com/libp2p/go-libp2p/core/host"
|
|
"github.com/libp2p/go-libp2p/core/peer"
|
|
"github.com/libp2p/go-libp2p/p2p/protocol/ping"
|
|
"go.uber.org/zap"
|
|
)
|
|
|
|
type peerMonitor struct {
|
|
ps *ping.PingService
|
|
timeout time.Duration
|
|
period time.Duration
|
|
attempts int
|
|
}
|
|
|
|
func (pm *peerMonitor) pingOnce(
|
|
ctx context.Context,
|
|
logger *zap.Logger,
|
|
peer peer.ID,
|
|
) bool {
|
|
pingCtx, cancel := context.WithTimeout(ctx, pm.timeout)
|
|
defer cancel()
|
|
select {
|
|
case <-ctx.Done():
|
|
case <-pingCtx.Done():
|
|
return false
|
|
case res := <-pm.ps.Ping(pingCtx, peer):
|
|
if res.Error != nil {
|
|
logger.Debug("ping error", zap.Error(res.Error))
|
|
return false
|
|
}
|
|
}
|
|
return true
|
|
}
|
|
|
|
func (pm *peerMonitor) ping(
|
|
ctx context.Context,
|
|
logger *zap.Logger,
|
|
wg *sync.WaitGroup,
|
|
peer peer.ID,
|
|
) {
|
|
defer wg.Done()
|
|
for i := 0; i < pm.attempts; i++ {
|
|
pm.pingOnce(ctx, logger, peer)
|
|
}
|
|
}
|
|
|
|
func (pm *peerMonitor) run(ctx context.Context, logger *zap.Logger) {
|
|
for {
|
|
select {
|
|
case <-ctx.Done():
|
|
return
|
|
case <-time.After(pm.period):
|
|
peers := pm.ps.Host.Network().Peers()
|
|
wg := &sync.WaitGroup{}
|
|
for _, id := range peers {
|
|
slogger := logger.With(zap.String("peer_id", id.String()))
|
|
wg.Add(1)
|
|
go pm.ping(ctx, slogger, wg, id)
|
|
}
|
|
wg.Wait()
|
|
}
|
|
}
|
|
}
|
|
|
|
// MonitorPeers periodically looks up the peers connected to the host and pings
|
|
// them repeatedly to ensure they are still reachable. If the peer is not
|
|
// reachable after the attempts, the connections to the peer are closed.
|
|
func MonitorPeers(
|
|
ctx context.Context,
|
|
logger *zap.Logger,
|
|
h host.Host,
|
|
timeout, period time.Duration,
|
|
attempts int,
|
|
) {
|
|
ps := ping.NewPingService(h)
|
|
pm := &peerMonitor{
|
|
ps: ps,
|
|
timeout: timeout,
|
|
period: period,
|
|
attempts: attempts,
|
|
}
|
|
|
|
go pm.run(ctx, logger)
|
|
}
|