github.com/isti4github/eth-ecc@v0.0.0-20201227085832-c337f2d99319/p2p/discover/v4_udp_lookup_test.go (about) 1 // Copyright 2019 The go-ethereum Authors 2 // This file is part of the go-ethereum library. 3 // 4 // The go-ethereum library is free software: you can redistribute it and/or modify 5 // it under the terms of the GNU Lesser General Public License as published by 6 // the Free Software Foundation, either version 3 of the License, or 7 // (at your option) any later version. 8 // 9 // The go-ethereum library is distributed in the hope that it will be useful, 10 // but WITHOUT ANY WARRANTY; without even the implied warranty of 11 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 // GNU Lesser General Public License for more details. 13 // 14 // You should have received a copy of the GNU Lesser General Public License 15 // along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>. 16 17 package discover 18 19 import ( 20 "crypto/ecdsa" 21 "fmt" 22 "net" 23 "reflect" 24 "sort" 25 "testing" 26 27 "github.com/Onther-Tech/go-ethereum/crypto" 28 "github.com/Onther-Tech/go-ethereum/p2p/enode" 29 ) 30 31 func TestUDPv4_Lookup(t *testing.T) { 32 t.Parallel() 33 test := newUDPTest(t) 34 35 // Lookup on empty table returns no nodes. 36 targetKey, _ := decodePubkey(lookupTestnet.target) 37 if results := test.udp.LookupPubkey(targetKey); len(results) > 0 { 38 t.Fatalf("lookup on empty table returned %d results: %#v", len(results), results) 39 } 40 41 // Seed table with initial node. 42 fillTable(test.table, []*node{wrapNode(lookupTestnet.node(256, 0))}) 43 44 // Start the lookup. 45 resultC := make(chan []*enode.Node, 1) 46 go func() { 47 resultC <- test.udp.LookupPubkey(targetKey) 48 test.close() 49 }() 50 51 // Answer lookup packets. 52 for done := false; !done; { 53 done = test.waitPacketOut(func(p packetV4, to *net.UDPAddr, hash []byte) { 54 n, key := lookupTestnet.nodeByAddr(to) 55 switch p.(type) { 56 case *pingV4: 57 test.packetInFrom(nil, key, to, &pongV4{Expiration: futureExp, ReplyTok: hash}) 58 case *findnodeV4: 59 dist := enode.LogDist(n.ID(), lookupTestnet.target.id()) 60 nodes := lookupTestnet.nodesAtDistance(dist - 1) 61 test.packetInFrom(nil, key, to, &neighborsV4{Expiration: futureExp, Nodes: nodes}) 62 } 63 }) 64 } 65 66 // Verify result nodes. 67 results := <-resultC 68 t.Logf("results:") 69 for _, e := range results { 70 t.Logf(" ld=%d, %x", enode.LogDist(lookupTestnet.target.id(), e.ID()), e.ID().Bytes()) 71 } 72 if len(results) != bucketSize { 73 t.Errorf("wrong number of results: got %d, want %d", len(results), bucketSize) 74 } 75 if hasDuplicates(wrapNodes(results)) { 76 t.Errorf("result set contains duplicate entries") 77 } 78 if !sortedByDistanceTo(lookupTestnet.target.id(), wrapNodes(results)) { 79 t.Errorf("result set not sorted by distance to target") 80 } 81 if !reflect.DeepEqual(results, lookupTestnet.closest(bucketSize)) { 82 t.Errorf("results aren't the closest %d nodes", bucketSize) 83 } 84 } 85 86 // This is the test network for the Lookup test. 87 // The nodes were obtained by running lookupTestnet.mine with a random NodeID as target. 88 var lookupTestnet = &preminedTestnet{ 89 target: hexEncPubkey("5d485bdcbe9bc89314a10ae9231e429d33853e3a8fa2af39f5f827370a2e4185e344ace5d16237491dad41f278f1d3785210d29ace76cd627b9147ee340b1125"), 90 dists: [257][]*ecdsa.PrivateKey{ 91 251: { 92 hexEncPrivkey("29738ba0c1a4397d6a65f292eee07f02df8e58d41594ba2be3cf84ce0fc58169"), 93 hexEncPrivkey("511b1686e4e58a917f7f848e9bf5539d206a68f5ad6b54b552c2399fe7d174ae"), 94 hexEncPrivkey("d09e5eaeec0fd596236faed210e55ef45112409a5aa7f3276d26646080dcfaeb"), 95 hexEncPrivkey("c1e20dbbf0d530e50573bd0a260b32ec15eb9190032b4633d44834afc8afe578"), 96 hexEncPrivkey("ed5f38f5702d92d306143e5d9154fb21819777da39af325ea359f453d179e80b"), 97 }, 98 252: { 99 hexEncPrivkey("1c9b1cafbec00848d2c174b858219914b42a7d5c9359b1ca03fd650e8239ae94"), 100 hexEncPrivkey("e0e1e8db4a6f13c1ffdd3e96b72fa7012293ced187c9dcdcb9ba2af37a46fa10"), 101 hexEncPrivkey("3d53823e0a0295cb09f3e11d16c1b44d07dd37cec6f739b8df3a590189fe9fb9"), 102 }, 103 253: { 104 hexEncPrivkey("2d0511ae9bf590166597eeab86b6f27b1ab761761eaea8965487b162f8703847"), 105 hexEncPrivkey("6cfbd7b8503073fc3dbdb746a7c672571648d3bd15197ccf7f7fef3d904f53a2"), 106 hexEncPrivkey("a30599b12827b69120633f15b98a7f6bc9fc2e9a0fd6ae2ebb767c0e64d743ab"), 107 hexEncPrivkey("14a98db9b46a831d67eff29f3b85b1b485bb12ae9796aea98d91be3dc78d8a91"), 108 hexEncPrivkey("2369ff1fc1ff8ca7d20b17e2673adc3365c3674377f21c5d9dafaff21fe12e24"), 109 hexEncPrivkey("9ae91101d6b5048607f41ec0f690ef5d09507928aded2410aabd9237aa2727d7"), 110 hexEncPrivkey("05e3c59090a3fd1ae697c09c574a36fcf9bedd0afa8fe3946f21117319ca4973"), 111 hexEncPrivkey("06f31c5ea632658f718a91a1b1b9ae4b7549d7b3bc61cbc2be5f4a439039f3ad"), 112 }, 113 254: { 114 hexEncPrivkey("dec742079ec00ff4ec1284d7905bc3de2366f67a0769431fd16f80fd68c58a7c"), 115 hexEncPrivkey("ff02c8861fa12fbd129d2a95ea663492ef9c1e51de19dcfbbfe1c59894a28d2b"), 116 hexEncPrivkey("4dded9e4eefcbce4262be4fd9e8a773670ab0b5f448f286ec97dfc8cf681444a"), 117 hexEncPrivkey("750d931e2a8baa2c9268cb46b7cd851f4198018bed22f4dceb09dd334a2395f6"), 118 hexEncPrivkey("ce1435a956a98ffec484cd11489c4f165cf1606819ab6b521cee440f0c677e9e"), 119 hexEncPrivkey("996e7f8d1638be92d7328b4770f47e5420fc4bafecb4324fd33b1f5d9f403a75"), 120 hexEncPrivkey("ebdc44e77a6cc0eb622e58cf3bb903c3da4c91ca75b447b0168505d8fc308b9c"), 121 hexEncPrivkey("46bd1eddcf6431bea66fc19ebc45df191c1c7d6ed552dcdc7392885009c322f0"), 122 }, 123 255: { 124 hexEncPrivkey("da8645f90826e57228d9ea72aff84500060ad111a5d62e4af831ed8e4b5acfb8"), 125 hexEncPrivkey("3c944c5d9af51d4c1d43f5d0f3a1a7ef65d5e82744d669b58b5fed242941a566"), 126 hexEncPrivkey("5ebcde76f1d579eebf6e43b0ffe9157e65ffaa391175d5b9aa988f47df3e33da"), 127 hexEncPrivkey("97f78253a7d1d796e4eaabce721febcc4550dd68fb11cc818378ba807a2cb7de"), 128 hexEncPrivkey("a38cd7dc9b4079d1c0406afd0fdb1165c285f2c44f946eca96fc67772c988c7d"), 129 hexEncPrivkey("d64cbb3ffdf712c372b7a22a176308ef8f91861398d5dbaf326fd89c6eaeef1c"), 130 hexEncPrivkey("d269609743ef29d6446e3355ec647e38d919c82a4eb5837e442efd7f4218944f"), 131 hexEncPrivkey("d8f7bcc4a530efde1d143717007179e0d9ace405ddaaf151c4d863753b7fd64c"), 132 }, 133 256: { 134 hexEncPrivkey("8c5b422155d33ea8e9d46f71d1ad3e7b24cb40051413ffa1a81cff613d243ba9"), 135 hexEncPrivkey("937b1af801def4e8f5a3a8bd225a8bcff1db764e41d3e177f2e9376e8dd87233"), 136 hexEncPrivkey("120260dce739b6f71f171da6f65bc361b5fad51db74cf02d3e973347819a6518"), 137 hexEncPrivkey("1fa56cf25d4b46c2bf94e82355aa631717b63190785ac6bae545a88aadc304a9"), 138 hexEncPrivkey("3c38c503c0376f9b4adcbe935d5f4b890391741c764f61b03cd4d0d42deae002"), 139 hexEncPrivkey("3a54af3e9fa162bc8623cdf3e5d9b70bf30ade1d54cc3abea8659aba6cff471f"), 140 hexEncPrivkey("6799a02ea1999aefdcbcc4d3ff9544478be7365a328d0d0f37c26bd95ade0cda"), 141 hexEncPrivkey("e24a7bc9051058f918646b0f6e3d16884b2a55a15553b89bab910d55ebc36116"), 142 }, 143 }, 144 } 145 146 type preminedTestnet struct { 147 target encPubkey 148 dists [hashBits + 1][]*ecdsa.PrivateKey 149 } 150 151 func (tn *preminedTestnet) node(dist, index int) *enode.Node { 152 key := tn.dists[dist][index] 153 ip := net.IP{127, byte(dist >> 8), byte(dist), byte(index)} 154 return enode.NewV4(&key.PublicKey, ip, 0, 5000) 155 } 156 157 func (tn *preminedTestnet) nodeByAddr(addr *net.UDPAddr) (*enode.Node, *ecdsa.PrivateKey) { 158 dist := int(addr.IP[1])<<8 + int(addr.IP[2]) 159 index := int(addr.IP[3]) 160 key := tn.dists[dist][index] 161 return tn.node(dist, index), key 162 } 163 164 func (tn *preminedTestnet) nodesAtDistance(dist int) []rpcNode { 165 result := make([]rpcNode, len(tn.dists[dist])) 166 for i := range result { 167 result[i] = nodeToRPC(wrapNode(tn.node(dist, i))) 168 } 169 return result 170 } 171 172 func (tn *preminedTestnet) closest(n int) (nodes []*enode.Node) { 173 for d := range tn.dists { 174 for i := range tn.dists[d] { 175 nodes = append(nodes, tn.node(d, i)) 176 } 177 } 178 sort.Slice(nodes, func(i, j int) bool { 179 return enode.DistCmp(tn.target.id(), nodes[i].ID(), nodes[j].ID()) < 0 180 }) 181 return nodes[:n] 182 } 183 184 var _ = (*preminedTestnet).mine // avoid linter warning about mine being dead code. 185 186 // mine generates a testnet struct literal with nodes at 187 // various distances to the network's target. 188 func (tn *preminedTestnet) mine() { 189 // Clear existing slices first (useful when re-mining). 190 for i := range tn.dists { 191 tn.dists[i] = nil 192 } 193 194 targetSha := tn.target.id() 195 found, need := 0, 40 196 for found < need { 197 k := newkey() 198 ld := enode.LogDist(targetSha, encodePubkey(&k.PublicKey).id()) 199 if len(tn.dists[ld]) < 8 { 200 tn.dists[ld] = append(tn.dists[ld], k) 201 found++ 202 fmt.Printf("found ID with ld %d (%d/%d)\n", ld, found, need) 203 } 204 } 205 fmt.Printf("&preminedTestnet{\n") 206 fmt.Printf(" target: hexEncPubkey(\"%x\"),\n", tn.target[:]) 207 fmt.Printf(" dists: [%d][]*ecdsa.PrivateKey{\n", len(tn.dists)) 208 for ld, ns := range tn.dists { 209 if len(ns) == 0 { 210 continue 211 } 212 fmt.Printf(" %d: {\n", ld) 213 for _, key := range ns { 214 fmt.Printf(" hexEncPrivkey(\"%x\"),\n", crypto.FromECDSA(key)) 215 } 216 fmt.Printf(" },\n") 217 } 218 fmt.Printf(" },\n") 219 fmt.Printf("}\n") 220 }