github.com/alexdevranger/node-1.8.27@v0.0.0-20221128213301-aa5841e41d2d/accounts/hd.go (about) 1 // Copyright 2017 The go-ethereum Authors 2 // This file is part of the go-dubxcoin library. 3 // 4 // The go-dubxcoin 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-dubxcoin 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-dubxcoin library. If not, see <http://www.gnu.org/licenses/>. 16 17 package accounts 18 19 import ( 20 "errors" 21 "fmt" 22 "math" 23 "math/big" 24 "strings" 25 ) 26 27 // DefaultRootDerivationPath is the root path to which custom derivation endpoints 28 // are appended. As such, the first account will be at m/44'/60'/0'/0, the second 29 // at m/44'/60'/0'/1, etc. 30 var DefaultRootDerivationPath = DerivationPath{0x80000000 + 44, 0x80000000 + 60, 0x80000000 + 0, 0} 31 32 // DefaultBaseDerivationPath is the base path from which custom derivation endpoints 33 // are incremented. As such, the first account will be at m/44'/60'/0'/0/0, the second 34 // at m/44'/60'/0'/0/1, etc. 35 var DefaultBaseDerivationPath = DerivationPath{0x80000000 + 44, 0x80000000 + 60, 0x80000000 + 0, 0, 0} 36 37 // DefaultLedgerBaseDerivationPath is the base path from which custom derivation endpoints 38 // are incremented. As such, the first account will be at m/44'/60'/0'/0, the second 39 // at m/44'/60'/0'/1, etc. 40 var DefaultLedgerBaseDerivationPath = DerivationPath{0x80000000 + 44, 0x80000000 + 60, 0x80000000 + 0, 0} 41 42 // DerivationPath represents the computer friendly version of a hierarchical 43 // deterministic wallet account derivaion path. 44 // 45 // The BIP-32 spec https://github.com/bitcoin/bips/blob/master/bip-0032.mediawiki 46 // defines derivation paths to be of the form: 47 // 48 // m / purpose' / coin_type' / account' / change / address_index 49 // 50 // The BIP-44 spec https://github.com/bitcoin/bips/blob/master/bip-0044.mediawiki 51 // defines that the `purpose` be 44' (or 0x8000002C) for crypto currencies, and 52 // SLIP-44 https://github.com/satoshilabs/slips/blob/master/slip-0044.md assigns 53 // the `coin_type` 60' (or 0x8000003C) to Ethereum. 54 // 55 // The root path for Ethereum is m/44'/60'/0'/0 according to the specification 56 // from https://github.com/ethereum/EIPs/issues/84, albeit it's not set in stone 57 // yet whether accounts should increment the last component or the children of 58 // that. We will go with the simpler approach of incrementing the last component. 59 type DerivationPath []uint32 60 61 // ParseDerivationPath converts a user specified derivation path string to the 62 // internal binary representation. 63 // 64 // Full derivation paths need to start with the `m/` prefix, relative derivation 65 // paths (which will get appended to the default root path) must not have prefixes 66 // in front of the first element. Whitespace is ignored. 67 func ParseDerivationPath(path string) (DerivationPath, error) { 68 var result DerivationPath 69 70 // Handle absolute or relative paths 71 components := strings.Split(path, "/") 72 switch { 73 case len(components) == 0: 74 return nil, errors.New("empty derivation path") 75 76 case strings.TrimSpace(components[0]) == "": 77 return nil, errors.New("ambiguous path: use 'm/' prefix for absolute paths, or no leading '/' for relative ones") 78 79 case strings.TrimSpace(components[0]) == "m": 80 components = components[1:] 81 82 default: 83 result = append(result, DefaultRootDerivationPath...) 84 } 85 // All remaining components are relative, append one by one 86 if len(components) == 0 { 87 return nil, errors.New("empty derivation path") // Empty relative paths 88 } 89 for _, component := range components { 90 // Ignore any user added whitespace 91 component = strings.TrimSpace(component) 92 var value uint32 93 94 // Handle hardened paths 95 if strings.HasSuffix(component, "'") { 96 value = 0x80000000 97 component = strings.TrimSpace(strings.TrimSuffix(component, "'")) 98 } 99 // Handle the non hardened component 100 bigval, ok := new(big.Int).SetString(component, 0) 101 if !ok { 102 return nil, fmt.Errorf("invalid component: %s", component) 103 } 104 max := math.MaxUint32 - value 105 if bigval.Sign() < 0 || bigval.Cmp(big.NewInt(int64(max))) > 0 { 106 if value == 0 { 107 return nil, fmt.Errorf("component %v out of allowed range [0, %d]", bigval, max) 108 } 109 return nil, fmt.Errorf("component %v out of allowed hardened range [0, %d]", bigval, max) 110 } 111 value += uint32(bigval.Uint64()) 112 113 // Append and repeat 114 result = append(result, value) 115 } 116 return result, nil 117 } 118 119 // String implements the stringer interface, converting a binary derivation path 120 // to its canonical representation. 121 func (path DerivationPath) String() string { 122 result := "m" 123 for _, component := range path { 124 var hardened bool 125 if component >= 0x80000000 { 126 component -= 0x80000000 127 hardened = true 128 } 129 result = fmt.Sprintf("%s/%d", result, component) 130 if hardened { 131 result += "'" 132 } 133 } 134 return result 135 }