1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
|
// Copyright 2018 The dexon-consensus-core Authors
// This file is part of the dexon-consensus-core library.
//
// The dexon-consensus-core library is free software: you can redistribute it
// and/or modify it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation, either version 3 of the License,
// or (at your option) any later version.
//
// The dexon-consensus-core library is distributed in the hope that it will be
// useful, but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser
// General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with the dexon-consensus-core library. If not, see
// <http://www.gnu.org/licenses/>.
package dex
import (
"bytes"
"github.com/dexon-foundation/dexon/core/rawdb"
"math/big"
"sync"
"time"
coreCommon "github.com/dexon-foundation/dexon-consensus-core/common"
coreTypes "github.com/dexon-foundation/dexon-consensus-core/core/types"
"github.com/dexon-foundation/dexon/common"
"github.com/dexon-foundation/dexon/core"
"github.com/dexon-foundation/dexon/core/state"
"github.com/dexon-foundation/dexon/core/types"
"github.com/dexon-foundation/dexon/core/vm"
"github.com/dexon-foundation/dexon/ethdb"
"github.com/dexon-foundation/dexon/rlp"
)
// DexconApp implementes the DEXON consensus core application interface.
type DexconApp struct {
txPool *core.TxPool
blockchain *core.BlockChain
gov *DexconGovernance
chainDB ethdb.Database
config *Config
vmConfig vm.Config
notifyChan map[uint64]*notify
mutex *sync.Mutex
}
type notify struct {
results []chan bool
}
func NewDexconApp(txPool *core.TxPool, blockchain *core.BlockChain, gov *DexconGovernance, chainDB ethdb.Database, config *Config, vmConfig vm.Config) *DexconApp {
return &DexconApp{
txPool: txPool,
blockchain: blockchain,
gov: gov,
chainDB: chainDB,
config: config,
vmConfig: vmConfig,
notifyChan: make(map[uint64]*notify),
mutex: &sync.Mutex{},
}
}
func (d *DexconApp) addNotify(height uint64) <-chan bool {
d.mutex.Lock()
defer d.mutex.Unlock()
result := make(chan bool)
if n, exist := d.notifyChan[height]; exist {
n.results = append(n.results, result)
} else {
d.notifyChan[height] = ¬ify{}
d.notifyChan[height].results = append(d.notifyChan[height].results, result)
}
return result
}
func (d *DexconApp) notify(height uint64) {
d.mutex.Lock()
defer d.mutex.Unlock()
for h, n := range d.notifyChan {
if height >= h {
for _, ch := range n.results {
ch <- true
}
delete(d.notifyChan, h)
}
}
}
// PreparePayload is called when consensus core is preparing payload for block.
func (d *DexconApp) PreparePayload(position coreTypes.Position) (payload []byte) {
txsMap, err := d.txPool.Pending()
if err != nil {
return
}
currentBlock := d.blockchain.CurrentBlock()
gasLimit := core.CalcGasLimit(currentBlock, d.config.GasFloor, d.config.GasCeil)
gp := new(core.GasPool).AddGas(gasLimit)
stateDB, err := state.New(currentBlock.Root(), state.NewDatabase(d.chainDB))
if err != nil {
return
}
chainID := new(big.Int).SetUint64(uint64(position.ChainID))
chainSize := new(big.Int).SetUint64(uint64(d.gov.Configuration(position.Round).NumChains))
var allTxs types.Transactions
var gasUsed uint64
for addr, txs := range txsMap {
addrModChainSize := new(big.Int)
if addrModChainSize.Mod(addr.Big(), chainSize).Cmp(chainID) != 0 {
continue
}
var nonce uint64
for i, tx := range txs {
// validate start nonce
// check undelivered block first
// or else check compaction chain state
if i == 0 {
nonce = tx.Nonce()
msg, err := tx.AsMessage(types.MakeSigner(nil, currentBlock.Header().Number))
if err != nil {
return
}
undeliveredNonce, exist, err := d.blockchain.GetNonceInConfirmedBlock(position.ChainID, msg.From())
if err != nil {
return
} else if exist {
if msg.Nonce() != undeliveredNonce+1 {
break
}
} else {
stateDB, err := d.blockchain.State()
if err != nil {
return
}
if msg.Nonce() != stateDB.GetNonce(msg.From())+1 {
break
}
}
} else if tx.Nonce() != nonce+1 { // check if nonce is sequential
break
}
core.ApplyTransaction(d.blockchain.Config(), d.blockchain, nil, gp, stateDB, currentBlock.Header(), tx, &gasUsed, d.vmConfig)
if gasUsed > gasLimit {
break
}
allTxs = append(allTxs, tx)
nonce = tx.Nonce()
}
}
payload, err = rlp.EncodeToBytes(&allTxs)
if err != nil {
// do something
return
}
return
}
type WitnessData struct {
Root common.Hash
TxHash common.Hash
ReceiptHash common.Hash
}
func (d *DexconApp) PrepareWitness(consensusHeight uint64) (witness coreTypes.Witness) {
var currentBlock *types.Block
currentBlock = d.blockchain.CurrentBlock()
if currentBlock.NumberU64() < consensusHeight {
// wait notification
if <-d.addNotify(consensusHeight) {
currentBlock = d.blockchain.CurrentBlock()
} else {
// do something if notify fail
}
}
witnessData, err := rlp.EncodeToBytes(&WitnessData{
Root: currentBlock.Root(),
TxHash: currentBlock.TxHash(),
ReceiptHash: currentBlock.ReceiptHash(),
})
if err != nil {
return
}
return coreTypes.Witness{
Timestamp: time.Unix(currentBlock.Time().Int64(), 0),
Height: currentBlock.NumberU64(),
Data: witnessData,
}
}
// VerifyBlock verifies if the payloads are valid.
func (d *DexconApp) VerifyBlock(block *coreTypes.Block) bool {
// decode payload to transactions
var transactions types.Transactions
err := rlp.Decode(bytes.NewReader(block.Payload), &transactions)
if err != nil {
return false
}
currentBlock := d.blockchain.CurrentBlock()
// verify transactions
addressNonce := map[common.Address]*struct {
Min uint64
Max uint64
}{}
for _, transaction := range transactions {
if d.txPool.ValidateTx(transaction, false) != nil {
return false
}
msg, err := transaction.AsMessage(types.MakeSigner(nil, currentBlock.Header().Number))
if err != nil {
return false
}
nonce, exist := addressNonce[msg.From()]
if !exist {
addressNonce[msg.From()] = &struct {
Min uint64
Max uint64
}{Min: msg.Nonce(), Max: msg.Nonce()}
} else if msg.Nonce() != nonce.Max+1 {
// address nonce is not sequential
return false
}
nonce.Max++
}
for address, nonce := range addressNonce {
undeliveredNonce, exist, err := d.blockchain.GetNonceInConfirmedBlock(block.Position.ChainID, address)
if err != nil {
return false
} else if exist {
if nonce.Min != undeliveredNonce+1 {
return false
}
} else {
stateDB, err := d.blockchain.State()
if err != nil {
return false
}
if nonce.Min != stateDB.GetNonce(address)+1 {
return false
}
}
}
gasLimit := core.CalcGasLimit(currentBlock, d.config.GasFloor, d.config.GasCeil)
gp := new(core.GasPool).AddGas(gasLimit)
stateDB, err := state.New(currentBlock.Root(), state.NewDatabase(d.chainDB))
if err != nil {
return false
}
var gasUsed uint64
for _, tx := range transactions {
core.ApplyTransaction(d.blockchain.Config(), d.blockchain, nil, gp, stateDB, currentBlock.Header(), tx, &gasUsed, d.vmConfig)
}
if gasUsed > gasLimit+d.config.GasLimitTolerance {
return false
}
witnessData := WitnessData{}
err = rlp.Decode(bytes.NewReader(block.Witness.Data), &witnessData)
if err != nil {
return false
}
witnessBlock := d.blockchain.GetBlockByNumber(block.Witness.Height)
if witnessBlock == nil {
return false
} else if witnessBlock.Root() != witnessData.Root {
// invalid state root of witness data
return false
} else if witnessBlock.ReceiptHash() != witnessData.ReceiptHash {
// invalid receipt root of witness data
return false
} else if witnessBlock.TxHash() != witnessData.TxHash {
// invalid tx root of witness data
return false
}
for _, transaction := range witnessBlock.Transactions() {
tx, _, _, _ := rawdb.ReadTransaction(d.chainDB, transaction.Hash())
if tx == nil {
return false
}
}
return true
}
// BlockDelivered is called when a block is add to the compaction chain.
func (d *DexconApp) BlockDelivered(blockHash coreCommon.Hash, result coreTypes.FinalizationResult) {
block := d.blockchain.GetConfirmedBlockByHash(blockHash)
if block == nil {
// do something
return
}
var transactions types.Transactions
err := rlp.Decode(bytes.NewReader(block.Payload), &transactions)
if err != nil {
return
}
_, err = d.blockchain.InsertChain(
[]*types.Block{types.NewBlock(&types.Header{
ParentHash: common.Hash(block.ParentHash),
Number: new(big.Int).SetUint64(result.Height),
Time: new(big.Int).SetInt64(result.Timestamp.Unix()),
TxHash: types.DeriveSha(transactions),
Coinbase: common.BytesToAddress(block.ProposerID.Hash[:]),
}, transactions, nil, nil)})
if err != nil {
// do something
return
}
d.blockchain.RemoveConfirmedBlock(blockHash)
d.notify(result.Height)
}
// BlockConfirmed is called when a block is confirmed and added to lattice.
func (d *DexconApp) BlockConfirmed(block coreTypes.Block) {
d.blockchain.AddConfirmedBlock(&block)
}
|