ceremonyclient/node/consensus/data/main_data_loop.go

package data

import (
	"bytes"
	"time"

	"go.uber.org/zap"
	"source.quilibrium.com/quilibrium/monorepo/node/consensus"
	"source.quilibrium.com/quilibrium/monorepo/node/protobufs"
	"source.quilibrium.com/quilibrium/monorepo/node/tries"
)

func (
	e *DataClockConsensusEngine,
) GetFrameProverTries() []*tries.RollingFrecencyCritbitTrie {
	e.frameProverTriesMx.RLock()
	frameProverTries := make(
		[]*tries.RollingFrecencyCritbitTrie,
		len(e.frameProverTries),
	)

	for i, trie := range e.frameProverTries {
		newTrie := &tries.RollingFrecencyCritbitTrie{}
		b, err := trie.Serialize()
		if err != nil {
			panic(err)
		}

		err = newTrie.Deserialize(b)
		if err != nil {
			panic(err)
		}
		frameProverTries[i] = newTrie
	}

	e.frameProverTriesMx.RUnlock()
	return frameProverTries
}

func (e *DataClockConsensusEngine) runLoop() {
	dataFrameCh := e.dataTimeReel.NewFrameCh()

	for e.state < consensus.EngineStateStopping {
		peerCount := e.pubSub.GetNetworkPeersCount()
		if peerCount < e.minimumPeersRequired {
			e.logger.Info(
				"waiting for minimum peers",
				zap.Int("peer_count", peerCount),
			)
			time.Sleep(1 * time.Second)
		} else {
			latestFrame, err := e.dataTimeReel.Head()
			if err != nil {
				panic(err)
			}

			select {
			case dataFrame := <-dataFrameCh:
				if latestFrame != nil &&
					dataFrame.FrameNumber > latestFrame.FrameNumber {
					latestFrame = dataFrame
				}

				if e.latestFrameReceived < latestFrame.FrameNumber {
					e.latestFrameReceived = latestFrame.FrameNumber
				}

				trie := e.GetFrameProverTries()[0]
				selBI, _ := dataFrame.GetSelector()
				sel := make([]byte, 32)
				sel = selBI.FillBytes(sel)

				if bytes.Equal(
					trie.FindNearest(sel).External.Key,
					e.provingKeyAddress,
				) {
					var nextFrame *protobufs.ClockFrame
					if nextFrame, err = e.prove(latestFrame); err != nil {
						e.logger.Error("could not prove", zap.Error(err))
						e.state = consensus.EngineStateCollecting
						continue
					}

					// e.proverTrieRequestsMx.Lock()
					// joinAddrs := tries.NewMinHeap[peerSeniorityItem]()
					// leaveAddrs := tries.NewMinHeap[peerSeniorityItem]()
					// for _, addr := range e.proverTrieJoinRequests {
					// 	if _, ok := (*e.peerSeniority)[addr]; !ok {
					// 		joinAddrs.Push(peerSeniorityItem{
					// 			addr:      addr,
					// 			seniority: 0,
					// 		})
					// 	} else {
					// 		joinAddrs.Push((*e.peerSeniority)[addr])
					// 	}
					// }
					// for _, addr := range e.proverTrieLeaveRequests {
					// 	if _, ok := (*e.peerSeniority)[addr]; !ok {
					// 		leaveAddrs.Push(peerSeniorityItem{
					// 			addr:      addr,
					// 			seniority: 0,
					// 		})
					// 	} else {
					// 		leaveAddrs.Push((*e.peerSeniority)[addr])
					// 	}
					// }
					// for _, addr := range e.proverTrieResumeRequests {
					// 	if _, ok := e.proverTriePauseRequests[addr]; ok {
					// 		delete(e.proverTriePauseRequests, addr)
					// 	}
					// }

					// joinReqs := make([]peerSeniorityItem, len(joinAddrs.All()))
					// copy(joinReqs, joinAddrs.All())
					// slices.Reverse(joinReqs)
					// leaveReqs := make([]peerSeniorityItem, len(leaveAddrs.All()))
					// copy(leaveReqs, leaveAddrs.All())
					// slices.Reverse(leaveReqs)

					// e.proverTrieJoinRequests = make(map[string]string)
					// e.proverTrieLeaveRequests = make(map[string]string)
					// e.proverTrieRequestsMx.Unlock()

					// e.frameProverTriesMx.Lock()
					// for _, addr := range joinReqs {
					// 	rings := len(e.frameProverTries)
					// 	last := e.frameProverTries[rings-1]
					// 	set := last.FindNearestAndApproximateNeighbors(make([]byte, 32))
					// 	if len(set) == 1024 {
					// 		e.frameProverTries = append(
					// 			e.frameProverTries,
					// 			&tries.RollingFrecencyCritbitTrie{},
					// 		)
					// 		last = e.frameProverTries[rings]
					// 	}
					// 	last.Add([]byte(addr.addr), nextFrame.FrameNumber)
					// }
					// for _, addr := range leaveReqs {
					// 	for _, t := range e.frameProverTries {
					// 		if bytes.Equal(
					// 			t.FindNearest([]byte(addr.addr)).External.Key,
					// 			[]byte(addr.addr),
					// 		) {
					// 			t.Remove([]byte(addr.addr))
					// 			break
					// 		}
					// 	}
					// }
					// e.frameProverTriesMx.Unlock()

					e.dataTimeReel.Insert(nextFrame, true)

					if err = e.publishProof(nextFrame); err != nil {
						e.logger.Error("could not publish", zap.Error(err))
						e.state = consensus.EngineStateCollecting
					}
					break
				}
			case <-time.After(20 * time.Second):
				dataFrame, err := e.dataTimeReel.Head()
				if err != nil {
					panic(err)
				}

				if latestFrame == nil ||
					latestFrame.FrameNumber < dataFrame.FrameNumber {
					latestFrame, err = e.dataTimeReel.Head()
					if err != nil {
						panic(err)
					}
				}

				if e.latestFrameReceived < latestFrame.FrameNumber {
					e.latestFrameReceived = latestFrame.FrameNumber
				}

				for _, trie := range e.GetFrameProverTries() {
					if bytes.Equal(
						trie.FindNearest(e.provingKeyAddress).External.Key,
						e.provingKeyAddress,
					) {
						var nextFrame *protobufs.ClockFrame
						if nextFrame, err = e.prove(latestFrame); err != nil {
							e.logger.Error("could not prove", zap.Error(err))
							e.state = consensus.EngineStateCollecting
							continue
						}

						// e.proverTrieRequestsMx.Lock()
						// joinAddrs := tries.NewMinHeap[peerSeniorityItem]()
						// leaveAddrs := tries.NewMinHeap[peerSeniorityItem]()
						// for _, addr := range e.proverTrieJoinRequests {
						// 	if _, ok := (*e.peerSeniority)[addr]; !ok {
						// 		joinAddrs.Push(peerSeniorityItem{
						// 			addr:      addr,
						// 			seniority: 0,
						// 		})
						// 	} else {
						// 		joinAddrs.Push((*e.peerSeniority)[addr])
						// 	}
						// }
						// for _, addr := range e.proverTrieLeaveRequests {
						// 	if _, ok := (*e.peerSeniority)[addr]; !ok {
						// 		leaveAddrs.Push(peerSeniorityItem{
						// 			addr:      addr,
						// 			seniority: 0,
						// 		})
						// 	} else {
						// 		leaveAddrs.Push((*e.peerSeniority)[addr])
						// 	}
						// }
						// for _, addr := range e.proverTrieResumeRequests {
						// 	if _, ok := e.proverTriePauseRequests[addr]; ok {
						// 		delete(e.proverTriePauseRequests, addr)
						// 	}
						// }

						// joinReqs := make([]peerSeniorityItem, len(joinAddrs.All()))
						// copy(joinReqs, joinAddrs.All())
						// slices.Reverse(joinReqs)
						// leaveReqs := make([]peerSeniorityItem, len(leaveAddrs.All()))
						// copy(leaveReqs, leaveAddrs.All())
						// slices.Reverse(leaveReqs)

						// e.proverTrieJoinRequests = make(map[string]string)
						// e.proverTrieLeaveRequests = make(map[string]string)
						// e.proverTrieRequestsMx.Unlock()

						// e.frameProverTriesMx.Lock()
						// for _, addr := range joinReqs {
						// 	rings := len(e.frameProverTries)
						// 	last := e.frameProverTries[rings-1]
						// 	set := last.FindNearestAndApproximateNeighbors(make([]byte, 32))
						// 	if len(set) == 8 {
						// 		e.frameProverTries = append(
						// 			e.frameProverTries,
						// 			&tries.RollingFrecencyCritbitTrie{},
						// 		)
						// 		last = e.frameProverTries[rings]
						// 	}
						// 	last.Add([]byte(addr.addr), nextFrame.FrameNumber)
						// }
						// for _, addr := range leaveReqs {
						// 	for _, t := range e.frameProverTries {
						// 		if bytes.Equal(
						// 			t.FindNearest([]byte(addr.addr)).External.Key,
						// 			[]byte(addr.addr),
						// 		) {
						// 			t.Remove([]byte(addr.addr))
						// 			break
						// 		}
						// 	}
						// }
						// e.frameProverTriesMx.Unlock()

						e.dataTimeReel.Insert(nextFrame, true)

						if err = e.publishProof(nextFrame); err != nil {
							e.logger.Error("could not publish", zap.Error(err))
							e.state = consensus.EngineStateCollecting
						}
						break
					}
				}
			}
		}
	}
}

func (e *DataClockConsensusEngine) rebroadcastLoop() {
	if e.GetFrameProverTries()[0].Contains(e.provingKeyAddress) {
		time.Sleep(120 * time.Second)
		for {
			_, err := e.dataTimeReel.Head()
			if err != nil {
				e.logger.Info("no frames to rebroadcast yet, waiting...")
				time.Sleep(10 * time.Second)
				continue
			}

			iter, err := e.clockStore.RangeDataClockFrames(e.filter, 1, 60840)
			i := 0
			frames := []*protobufs.ClockFrame{}
			sent := false
			for iter.First(); iter.Valid(); iter.Next() {
				if e.state == consensus.EngineStateStopped ||
					e.state == consensus.EngineStateStopping {
					e.logger.Info("shutting down rebroadcaster")
					return
				}
				i++
				frame, err := iter.Value()
				if err != nil {
					e.logger.Error("error while iterating", zap.Error(err))
				}

				frames = append(frames, frame)
				if i == 50 {
					i = 0
					e.logger.Info(
						"rebroadcasting frames",
						zap.Uint64("from", frames[0].FrameNumber),
						zap.Uint64("to", frames[len(frames)-1].FrameNumber),
					)
					e.publishMessage(e.filter, &protobufs.FrameRebroadcast{
						From:        frames[0].FrameNumber,
						To:          frames[len(frames)-1].FrameNumber,
						ClockFrames: frames,
					})
					time.Sleep(10 * time.Second)
					sent = true
					frames = []*protobufs.ClockFrame{}
				}
			}

			if !sent && len(frames) != 0 {
				e.logger.Info(
					"rebroadcasting frames",
					zap.Uint64("from", frames[0].FrameNumber),
					zap.Uint64("to", frames[len(frames)-1].FrameNumber),
				)
				e.publishMessage(e.filter, &protobufs.FrameRebroadcast{
					From:        frames[0].FrameNumber,
					To:          frames[len(frames)-1].FrameNumber,
					ClockFrames: frames,
				})
				time.Sleep(1 * time.Second)
			}
		}
	}
}