Comment
Author: Admin | 2025-04-28
Pool Manager, parameters of the puzzle ℓ, ℓ ′ , parameter t for solving the puzzleproceduremine(b, ℓ, ℓ ′ , t)while true do obtain mining job n ← r a n d o m N o n c e ( ) c ← P r e f i x ℓ ( h ( [ b | | n ] ) ) c ( 0 ) ← c i ← 1 c ( i ) ← E c ( i − 1 ) ( 1 ℓ ) c ( e n c ) ← E n c p ( c ( i ) ) Ask Pool Manager to check his table: f l a g ← q u e r y P o o l M a n a g e r ( c ( e n c ) , m i n e r I d , i , ℓ , ℓ ′ , t ) break else if f l a g = F s h a r e then Miner’s work is verified. Share is granted. else if f l a g = F s o l u t i o n then s e n d N o n c e T o P o o l M a n a g e r ( E n c p ( n ) ) breakend if Flag is F 0 so mining is continued i ← i + 1 end whileend whileend procedureAlgorithm A6 Pool Manager searches a table for the solution of the puzzle.Input received v a l u e , miner i d , mining s t e p , parameters of the puzzle ℓ, ℓ ′ , parameter t for solving the puzzleOutput Mining flagprocedurequeryPoolManager( v a l u e , i d , s t e p , ℓ, ℓ ′ , t) if s t o p M i n i n g ( ) then ▹ Stop mining if a new block was found by othersend if c ( i ) ← E n c s − 1 ( v a l u e ) r o w ← N u l l r o w ← s e a r c h T a b l e ( c ( i ) , m k ) s t o r e R o w ( r o w , i d ) ▹ store row for completing the block when the nonce arrivesend if p r o b ← r a n d ( 0 , 1 ) if s t e p > 1 ∧ p r o b Δ / t ′ then if c ( i ) = E c ( i − 1 ) ( 1 ℓ ) then ▹ check correctness of Miner’s work j i d ← j i d + 1 end if if j i d > = ℓ ′ ∧ s t e p = t thenend ifend if return F 0
Add Comment