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
 342
 343
 344
 345
 346
 347
 348
 349
 350
 351
 352
 353
 354
 355
 356
 357
 358
 359
 360
 361
 362
 363
 364
 365
 366
 367
 368
 369
 370
 371
 372
 373
 374
 375
 376
 377
 378
 379
 380
 381
 382
 383
 384
 385
 386
 387
 388
 389
 390
 391
 392
 393
 394
 395
 396
 397
 398
 399
 400
 401
 402
 403
 404
 405
 406
 407
 408
 409
 410
 411
 412
 413
 414
 415
 416
 417
 418
 419
 420
 421
 422
 423
 424
 425
 426
 427
 428
 429
 430
 431
 432
 433
 434
 435
 436
 437
 438
 439
 440
 441
 442
 443
 444
 445
 446
 447
 448
 449
 450
 451
 452
 453
 454
 455
 456
 457
 458
 459
 460
 461
 462
 463
 464
 465
 466
 467
 468
 469
 470
 471
 472
 473
 474
 475
 476
 477
 478
 479
 480
 481
 482
 483
 484
 485
 486
 487
 488
 489
 490
 491
 492
 493
 494
 495
 496
 497
 498
 499
 500
 501
 502
 503
 504
 505
 506
 507
 508
 509
 510
 511
 512
 513
 514
 515
 516
 517
 518
 519
 520
 521
 522
 523
 524
 525
 526
 527
 528
 529
 530
 531
 532
 533
 534
 535
 536
 537
 538
 539
 540
 541
 542
 543
 544
 545
 546
 547
 548
 549
 550
 551
 552
 553
 554
 555
 556
 557
 558
 559
 560
 561
 562
 563
 564
 565
 566
 567
 568
 569
 570
 571
 572
 573
 574
 575
 576
 577
 578
 579
 580
 581
 582
 583
 584
 585
 586
 587
 588
 589
 590
 591
 592
 593
 594
 595
 596
 597
 598
 599
 600
 601
 602
 603
 604
 605
 606
 607
 608
 609
 610
 611
 612
 613
 614
 615
 616
 617
 618
 619
 620
 621
 622
 623
 624
 625
 626
 627
 628
 629
 630
 631
 632
 633
 634
 635
 636
 637
 638
 639
 640
 641
 642
 643
 644
 645
 646
 647
 648
 649
 650
 651
 652
 653
 654
 655
 656
 657
 658
 659
 660
 661
 662
 663
 664
 665
 666
 667
 668
 669
 670
 671
 672
 673
 674
 675
 676
 677
 678
 679
 680
 681
 682
 683
 684
 685
 686
 687
 688
 689
 690
 691
 692
 693
 694
 695
 696
 697
 698
 699
 700
 701
 702
 703
 704
 705
 706
 707
 708
 709
 710
 711
 712
 713
 714
 715
 716
 717
 718
 719
 720
 721
 722
 723
 724
 725
 726
 727
 728
 729
 730
 731
 732
 733
 734
 735
 736
 737
 738
 739
 740
 741
 742
 743
 744
 745
 746
 747
 748
 749
 750
 751
 752
 753
 754
 755
 756
 757
 758
 759
 760
 761
 762
 763
 764
 765
 766
 767
 768
 769
 770
 771
 772
 773
 774
 775
 776
 777
 778
 779
 780
 781
 782
 783
 784
 785
 786
 787
 788
 789
 790
 791
 792
 793
 794
 795
 796
 797
 798
 799
 800
 801
 802
 803
 804
 805
 806
 807
 808
 809
 810
 811
 812
 813
 814
 815
 816
 817
 818
 819
 820
 821
 822
 823
 824
 825
 826
 827
 828
 829
 830
 831
 832
 833
 834
 835
 836
 837
 838
 839
 840
 841
 842
 843
 844
 845
 846
 847
 848
 849
 850
 851
 852
 853
 854
 855
 856
 857
 858
 859
 860
 861
 862
 863
 864
 865
 866
 867
 868
 869
 870
 871
 872
 873
 874
 875
 876
 877
 878
 879
 880
 881
 882
 883
 884
 885
 886
 887
 888
 889
 890
 891
 892
 893
 894
 895
 896
 897
 898
 899
 900
 901
 902
 903
 904
 905
 906
 907
 908
 909
 910
 911
 912
 913
 914
 915
 916
 917
 918
 919
 920
 921
 922
 923
 924
 925
 926
 927
 928
 929
 930
 931
 932
 933
 934
 935
 936
 937
 938
 939
 940
 941
 942
 943
 944
 945
 946
 947
 948
 949
 950
 951
 952
 953
 954
 955
 956
 957
 958
 959
 960
 961
 962
 963
 964
 965
 966
 967
 968
 969
 970
 971
 972
 973
 974
 975
 976
 977
 978
 979
 980
 981
 982
 983
 984
 985
 986
 987
 988
 989
 990
 991
 992
 993
 994
 995
 996
 997
 998
 999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
use std::cmp::{min, max};
use std::collections::{HashMap, HashSet, VecDeque};
use std::collections::hash_map::Entry;
use std::sync::Arc;
use futures::Future;
use parking_lot::Mutex;
use time::precise_time_s;
use chain::{IndexedBlockHeader, IndexedTransaction, Transaction, IndexedBlock};
use message::types;
use message::common::{InventoryType, InventoryVector};
use miner::transaction_fee_rate;
use primitives::hash::H256;
use verification::BackwardsCompatibleChainVerifier as ChainVerifier;
use synchronization_chain::{Chain, BlockState, TransactionState, BlockInsertionResult};
use synchronization_executor::{Task, TaskExecutor};
use synchronization_manager::ManagementWorker;
use synchronization_peers_tasks::PeersTasks;
use synchronization_verifier::{VerificationSink, BlockVerificationSink, TransactionVerificationSink, VerificationTask};
use types::{BlockHeight, ClientCoreRef, PeersRef, PeerIndex, SynchronizationStateRef, EmptyBoxFuture, SyncListenerRef};
use utils::{AverageSpeedMeter, MessageBlockHeadersProvider, OrphanBlocksPool, OrphanTransactionsPool, HashPosition};
#[cfg(test)] use synchronization_peers_tasks::{Information as PeersTasksInformation};
#[cfg(test)] use synchronization_chain::{Information as ChainInformation};

/// Approximate maximal number of blocks hashes in scheduled queue.
const MAX_SCHEDULED_HASHES: BlockHeight = 4 * 1024;
/// Approximate maximal number of blocks hashes in requested queue.
const MAX_REQUESTED_BLOCKS: BlockHeight = 256;
/// Approximate maximal number of blocks in verifying queue.
const MAX_VERIFYING_BLOCKS: BlockHeight = 256;
/// Minimum number of blocks to request from peer
const MIN_BLOCKS_IN_REQUEST: BlockHeight = 32;
/// Maximum number of blocks to request from peer
const MAX_BLOCKS_IN_REQUEST: BlockHeight = 128;
/// Number of blocks to receive since synchronization start to begin duplicating blocks requests
const NEAR_EMPTY_VERIFICATION_QUEUE_THRESHOLD_BLOCKS: usize = 20;
/// Number of seconds left before verification queue will be empty to count it as 'near empty queue'
const NEAR_EMPTY_VERIFICATION_QUEUE_THRESHOLD_S: f64 = 20_f64;
/// Number of blocks to inspect when calculating average sync speed
const SYNC_SPEED_BLOCKS_TO_INSPECT: usize = 512;
/// Number of blocks to inspect when calculating average blocks speed
const BLOCKS_SPEED_BLOCKS_TO_INSPECT: usize = 512;
/// Minimal time between duplicated blocks requests.
const MIN_BLOCK_DUPLICATION_INTERVAL_S: f64 = 10_f64;
/// Maximal number of blocks in duplicate requests.
const MAX_BLOCKS_IN_DUPLICATE_REQUEST: BlockHeight = 4;
/// Minimal number of blocks in duplicate requests.
const MIN_BLOCKS_IN_DUPLICATE_REQUEST: BlockHeight = 8;

/// Information on current synchronization state.
#[cfg(test)]
#[derive(Debug)]
pub struct Information {
	/// Current synchronization state.
	pub state: State,
	/// Information on synchronization peers.
	pub peers_tasks: PeersTasksInformation,
	/// Current synchronization chain inormation.
	pub chain: ChainInformation,
	/// Number of currently orphaned blocks.
	pub orphaned_blocks: usize,
	/// Number of currently orphaned transactions.
	pub orphaned_transactions: usize,
}

/// Synchronization client trait
pub trait ClientCore {
	fn on_connect(&mut self, peer_index: PeerIndex);
	fn on_disconnect(&mut self, peer_index: PeerIndex);
	fn on_inventory(&self, peer_index: PeerIndex, message: types::Inv);
	fn on_headers(&mut self, peer_index: PeerIndex, message: types::Headers);
	fn on_block(&mut self, peer_index: PeerIndex, block: IndexedBlock) -> Option<VecDeque<IndexedBlock>>;
	fn on_transaction(&mut self, peer_index: PeerIndex, transaction: IndexedTransaction) -> Option<VecDeque<IndexedTransaction>>;
	fn on_notfound(&mut self, peer_index: PeerIndex, message: types::NotFound);
	fn after_peer_nearly_blocks_verified(&mut self, peer_index: PeerIndex, future: EmptyBoxFuture);
	fn accept_transaction(&mut self, transaction: Transaction, sink: Box<TransactionVerificationSink>) -> Result<VecDeque<IndexedTransaction>, String>;
	fn install_sync_listener(&mut self, listener: SyncListenerRef);
	fn execute_synchronization_tasks(&mut self, forced_blocks_requests: Option<Vec<H256>>, final_blocks_requests: Option<Vec<H256>>);
	fn try_switch_to_saturated_state(&mut self) -> bool;
}

/// Synchronization client configuration options.
#[derive(Debug)]
pub struct Config {
	/// If true, connection to peer who has provided us with bad block is closed
	pub close_connection_on_bad_block: bool,
}

/// Synchronization client.
pub struct SynchronizationClientCore<T: TaskExecutor> {
	/// Shared synchronization client state.
	shared_state: SynchronizationStateRef,
	/// Synchronization state.
	state: State,
	/// Sync management worker.
	management_worker: Option<ManagementWorker>,
	/// Synchronization peers
	peers: PeersRef,
	/// Synchronization peers tasks.
	peers_tasks: PeersTasks,
	/// Task executor.
	executor: Arc<T>,
	/// Chain reference.
	chain: Chain,
	/// Orphaned blocks pool.
	orphaned_blocks_pool: OrphanBlocksPool,
	/// Orphaned transactions pool.
	orphaned_transactions_pool: OrphanTransactionsPool,
	/// Chain verifier
	chain_verifier: Arc<ChainVerifier>,
	/// Verify block headers?
	verify_headers: bool,
	/// Verifying blocks by peer
	verifying_blocks_by_peer: HashMap<H256, PeerIndex>,
	/// Verifying blocks futures
	verifying_blocks_futures: HashMap<PeerIndex, (HashSet<H256>, Vec<EmptyBoxFuture>)>,
	/// Verifying transactions futures
	verifying_transactions_sinks: HashMap<H256, Box<TransactionVerificationSink>>,
	/// Hashes of items we do not want to relay after verification is completed
	do_not_relay: HashSet<H256>,
	/// Block processing speed meter
	block_speed_meter: AverageSpeedMeter,
	/// Block synchronization speed meter
	sync_speed_meter: AverageSpeedMeter,
	/// Configuration
	config: Config,
	/// Synchronization events listener
	listener: Option<SyncListenerRef>,
	/// Time of last duplicated blocks request.
	last_dup_time: f64,
}

/// Verification sink for synchronization client core
pub struct CoreVerificationSink<T: TaskExecutor> {
	/// Client core reference
	core: ClientCoreRef<SynchronizationClientCore<T>>,
}

/// Synchronization state
#[derive(Debug, Clone, Copy)]
pub enum State {
	/// We know that there are > 1 unknown blocks, unknown to us in the blockchain
	Synchronizing(f64, BlockHeight),
	/// There is only one unknown block in the blockchain
	NearlySaturated,
	/// We have downloaded all blocks of the blockchain of which we have ever heard
	Saturated,
}

/// Blocks request limits.
pub struct BlocksRequestLimits {
	/// Approximate maximal number of blocks hashes in scheduled queue.
	pub max_scheduled_hashes: BlockHeight,
	/// Approximate maximal number of blocks hashes in requested queue.
	pub max_requested_blocks: BlockHeight,
	/// Approximate maximal number of blocks in verifying queue.
	pub max_verifying_blocks: BlockHeight,
	/// Minimum number of blocks to request from peer
	pub min_blocks_in_request: BlockHeight,
	/// Maximum number of blocks to request from peer
	pub max_blocks_in_request: BlockHeight,
}

/// Transaction append error
enum AppendTransactionError {
	Synchronizing,
	Orphan(HashSet<H256>),
}

/// Blocks headers verification result
enum BlocksHeadersVerificationResult {
	/// Skip these blocks headers
	Skip,
	/// Error during verification of header with given index
	Error(usize),
	/// Successful verification
	Success,
}

impl State {
	pub fn is_saturated(&self) -> bool {
		match *self {
			State::Saturated => true,
			_ => false,
		}
	}

	pub fn is_synchronizing(&self) -> bool {
		match *self {
			State::Synchronizing(_, _) => true,
			_ => false,
		}
	}

	pub fn is_nearly_saturated(&self) -> bool {
		match *self {
			State::NearlySaturated => true,
			_ => false,
		}
	}
}


impl<T> ClientCore for SynchronizationClientCore<T> where T: TaskExecutor {
	fn on_connect(&mut self, peer_index: PeerIndex) {
		// ask peer for its block headers to find our best common block
		let block_locator_hashes = self.chain.block_locator_hashes();
		self.executor.execute(Task::GetHeaders(peer_index, types::GetHeaders::with_block_locator_hashes(block_locator_hashes)));
		// unuseful until respond with headers message
		self.peers_tasks.unuseful_peer(peer_index);
		self.peers_tasks.on_headers_requested(peer_index);
	}

	fn on_disconnect(&mut self, peer_index: PeerIndex) {
		// sync tasks from this peers must be executed by other peers
		let peer_tasks = self.peers_tasks.reset_blocks_tasks(peer_index);
		self.peers_tasks.disconnect(peer_index);
		self.execute_synchronization_tasks(Some(peer_tasks), None);
	}

	fn on_inventory(&self, peer_index: PeerIndex, message: types::Inv) {
		// we are synchronizing => we ask only for blocks with known headers => there are no useful blocks hashes for us
		// we are synchronizing => we ignore all transactions until it is completed => there are no useful transactions hashes for us
		if self.state.is_synchronizing() {
			trace!(target: "sync", "Ignoring {} inventory items from peer#{} as synchronization is in progress", message.inventory.len(), peer_index);
			return;
		}

		// else ask for all unknown transactions and blocks
		let is_segwit_possible = self.chain.is_segwit_possible();
		let unknown_inventory: Vec<_> = message.inventory.into_iter()
			.filter(|item| {
				match item.inv_type {
					// check that transaction is unknown to us
					InventoryType::MessageTx| InventoryType::MessageWitnessTx =>
						self.chain.transaction_state(&item.hash) == TransactionState::Unknown
							&& !self.orphaned_transactions_pool.contains(&item.hash),
					// check that block is unknown to us
					InventoryType::MessageBlock | InventoryType::MessageWitnessBlock => match self.chain.block_state(&item.hash) {
						BlockState::Unknown => !self.orphaned_blocks_pool.contains_unknown_block(&item.hash),
						BlockState::DeadEnd if !self.config.close_connection_on_bad_block => true,
						BlockState::DeadEnd if self.config.close_connection_on_bad_block => {
							self.peers.misbehaving(peer_index, &format!("Provided dead-end block {:?}", item.hash.to_reversed_str()));
							false
						},
						_ => false,
					},
					// we never ask for merkle blocks && we never ask for compact blocks
					InventoryType::MessageCompactBlock | InventoryType::MessageFilteredBlock
						| InventoryType::MessageWitnessFilteredBlock
						 => false,
					// unknown inventory type
					InventoryType::Error => {
						self.peers.misbehaving(peer_index, &format!("Provided unknown inventory type {:?}", item.hash.to_reversed_str()));
						false
					}
				}
			})
			// we are not synchronizing =>
			// 1) either segwit is active and we are connected to segwit-enabled nodes => we could ask for witness
			// 2) or segwit is inactive => we shall not ask for witness
			.map(|item| if !is_segwit_possible {
					item
				} else {
					match item.inv_type {
						InventoryType::MessageTx => InventoryVector {
							inv_type: InventoryType::MessageWitnessTx,
							hash: item.hash,
						},
						InventoryType::MessageBlock => InventoryVector {
							inv_type: InventoryType::MessageWitnessBlock,
							hash: item.hash,
						},
						_ => item,
					}
				})
			.collect();

		// if everything is known => ignore this message
		if unknown_inventory.is_empty() {
			trace!(target: "sync", "Ignoring inventory message from peer#{} as all items are known", peer_index);
			return;
		}

		// ask for unknown items
		let message = types::GetData::with_inventory(unknown_inventory);
		self.executor.execute(Task::GetData(peer_index, message));
	}

	/// Try to queue synchronization of unknown blocks when blocks headers are received.
	fn on_headers(&mut self, peer_index: PeerIndex, message: types::Headers) {
		assert!(!message.headers.is_empty(), "This must be checked in incoming connection");

		// transform to indexed headers
		let mut headers: Vec<_> = message.headers.into_iter().map(IndexedBlockHeader::from).collect();

		// update peers to select next tasks
		self.peers_tasks.on_headers_received(peer_index);

		// headers are ordered
		// => if we know nothing about headers[0].parent
		// => all headers are also unknown to us
		let header0 = headers[0].clone();
		if self.chain.block_state(&header0.raw.previous_header_hash) == BlockState::Unknown {
			warn!(target: "sync", "Previous header of the first header from peer#{} `headers` message is unknown. First: {}. Previous: {}", peer_index, header0.hash.to_reversed_str(), header0.raw.previous_header_hash.to_reversed_str());
			return;
		}

		// find first unknown header position
		// optimization: normally, the first header will be unknown
		let num_headers = headers.len();
		let first_unknown_index = match self.chain.block_state(&header0.hash) {
			BlockState::Unknown => 0,
			_ => {
				// optimization: if last header is known, then all headers are also known
				let header_last = &headers[num_headers - 1];
				match self.chain.block_state(&header_last.hash) {
					BlockState::Unknown => 1 + headers.iter().skip(1)
						.position(|header| self.chain.block_state(&header.hash) == BlockState::Unknown)
						.expect("last header has UnknownState; we are searching for first unknown header; qed"),
					// else all headers are known
					_ => {
						trace!(target: "sync", "Ignoring {} known headers from peer#{}", headers.len(), peer_index);
						// but this peer is still useful for synchronization
						self.peers_tasks.useful_peer(peer_index);
						return;
					},
				}
			}
		};

		// validate blocks headers before scheduling
		let last_known_hash = if first_unknown_index > 0 { headers[first_unknown_index - 1].hash.clone() } else { header0.raw.previous_header_hash.clone() };
		if self.config.close_connection_on_bad_block && self.chain.block_state(&last_known_hash) == BlockState::DeadEnd {
			self.peers.misbehaving(peer_index, &format!("Provided after dead-end block {}", last_known_hash.to_reversed_str()));
			return;
		}
		match self.verify_headers(peer_index, last_known_hash, &headers[first_unknown_index..num_headers]) {
			BlocksHeadersVerificationResult::Error(error_index) => self.chain.mark_dead_end_block(&headers[first_unknown_index + error_index].hash),
			BlocksHeadersVerificationResult::Skip => (),
			BlocksHeadersVerificationResult::Success => {
				// report progress
				let num_new_headers = num_headers - first_unknown_index;
				trace!(target: "sync", "New {} headers from peer#{}. First {:?}, last: {:?}",
					num_new_headers,
					peer_index,
					headers[first_unknown_index].hash.to_reversed_str(),
					headers[num_headers - 1].hash.to_reversed_str()
				);

				// prepare new headers array
				let new_headers = headers.split_off(first_unknown_index);
				self.chain.schedule_blocks_headers(new_headers);

				// switch to synchronization state
				if !self.state.is_synchronizing() {
					if self.chain.length_of_blocks_state(BlockState::Scheduled) +
						self.chain.length_of_blocks_state(BlockState::Requested) == 1 {
						self.switch_to_nearly_saturated_state();
					} else {
						self.switch_to_synchronization_state();
					}
				}

				// this peers has supplied us with new headers => useful indeed
				self.peers_tasks.useful_peer(peer_index);
				// and execute tasks
				self.execute_synchronization_tasks(None, None);
			},
		}
	}

	fn on_block(&mut self, peer_index: PeerIndex, block: IndexedBlock) -> Option<VecDeque<IndexedBlock>> {
		// update peers to select next tasks
		self.peers_tasks.on_block_received(peer_index, &block.header.hash);

		// prepare list of blocks to verify + make all required changes to the chain
		let mut result: Option<VecDeque<IndexedBlock>> = None;
		let block_state = self.chain.block_state(&block.header.hash);
		match block_state {
			BlockState::Verifying | BlockState::Stored => {
				// remember peer as useful
				// and do nothing else, because we have already processed this block before
				self.peers_tasks.useful_peer(peer_index);
			},
			BlockState::Unknown | BlockState::Scheduled | BlockState::Requested | BlockState::DeadEnd => {
				if block_state == BlockState::DeadEnd {
					if self.config.close_connection_on_bad_block {
						self.peers.misbehaving(peer_index, &format!("Provided dead-end block {}", block.header.hash.to_reversed_str()));
						return None;
					}
					warn!(target: "sync", "Peer#{} has provided dead-end block {}", peer_index, block.header.hash.to_reversed_str());
				}

				// check parent block state
				let parent_block_state = self.chain.block_state(&block.header.raw.previous_header_hash);
				match parent_block_state {
					BlockState::Unknown | BlockState::DeadEnd => {
						if parent_block_state == BlockState::DeadEnd {
							if self.config.close_connection_on_bad_block {
								self.peers.misbehaving(peer_index, &format!("Provided dead-end block {}", block.header.hash.to_reversed_str()));
								return None;
							}
							warn!(target: "sync", "Peer#{} has provided dead-end block {}", peer_index, block.header.hash.to_reversed_str());
						}

						if self.state.is_synchronizing() {
							// when synchronizing, we tend to receive all blocks in-order
							trace!(
								target: "sync",
								"Ignoring block {} from peer#{}, because its parent is unknown and we are synchronizing",
								block.header.hash.to_reversed_str(),
								peer_index
							);
							// remove block from current queue
							self.chain.forget_block(&block.header.hash);
							// remove orphaned blocks
							let removed_blocks_hashes: Vec<_> = self.orphaned_blocks_pool
								.remove_blocks_for_parent(block.hash())
								.into_iter()
								.map(|b| b.header.hash)
								.collect();
							self.chain.forget_blocks_leave_header(&removed_blocks_hashes);
						} else {
							// remove this block from the queue
							self.chain.forget_block_leave_header(&block.header.hash);
							// remember this block as unknown
							if !self.orphaned_blocks_pool.contains_unknown_block(&block.header.hash) {
								self.orphaned_blocks_pool.insert_unknown_block(block);
							}
						}
					},
					BlockState::Verifying | BlockState::Stored => {
						// update synchronization speed
						self.sync_speed_meter.checkpoint();
						// remember peer as useful
						self.peers_tasks.useful_peer(peer_index);
						// schedule verification
						let mut blocks_to_verify: VecDeque<IndexedBlock> = VecDeque::new();
						blocks_to_verify.extend(self.orphaned_blocks_pool.remove_blocks_for_parent(&block.header.hash));
						blocks_to_verify.push_front(block);
						// forget blocks we are going to process
						let blocks_hashes_to_forget: Vec<_> = blocks_to_verify.iter().map(|b| b.hash().clone()).collect();
						self.chain.forget_blocks_leave_header(&blocks_hashes_to_forget);
						// remember that we are verifying these blocks
						let blocks_headers_to_verify: Vec<_> = blocks_to_verify.iter().map(|b| b.header.clone()).collect();
						self.chain.verify_blocks(blocks_headers_to_verify);
						// remember that we are verifying block from this peer
						for verifying_block_hash in blocks_to_verify.iter().map(|b| b.hash().clone()) {
							self.verifying_blocks_by_peer.insert(verifying_block_hash, peer_index);
						}
						match self.verifying_blocks_futures.entry(peer_index) {
							Entry::Occupied(mut entry) => {
								entry.get_mut().0.extend(blocks_to_verify.iter().map(|b| b.hash().clone()));
							},
							Entry::Vacant(entry) => {
								let block_hashes: HashSet<_> = blocks_to_verify.iter().map(|b| b.hash().clone()).collect();
								entry.insert((block_hashes, Vec::new()));
							}
						}
						result = Some(blocks_to_verify);
					},
					BlockState::Requested | BlockState::Scheduled => {
						// remember peer as useful
						self.peers_tasks.useful_peer(peer_index);
						// remember as orphan block
						self.orphaned_blocks_pool.insert_orphaned_block(block);
					}
				}
			},
		}

		result
	}

	fn on_transaction(&mut self, peer_index: PeerIndex, transaction: IndexedTransaction) -> Option<VecDeque<IndexedTransaction>> {
		// check if this transaction is already known
		if self.orphaned_transactions_pool.contains(&transaction.hash) ||
			self.chain.transaction_state(&transaction.hash) != TransactionState::Unknown {
			return None;
		}

		self.process_peer_transaction(Some(peer_index), transaction, true)
	}

	/// When peer has no blocks
	fn on_notfound(&mut self, peer_index: PeerIndex, message: types::NotFound) {
		let notfound_blocks: HashSet<_> = message.inventory
			.into_iter()
			.filter(|item| item.inv_type == InventoryType::MessageBlock)
			.map(|item| item.hash)
			.collect();

		// we only interested in notfound blocks
		if notfound_blocks.is_empty() {
			return;
		}

		// we only interested in blocks, which we were asking before
		let is_requested_block = if let Some(requested_blocks) = self.peers_tasks.get_blocks_tasks(peer_index) {
			// check if peer has responded with notfound to requested blocks
			// if notfound some other blocks => just ignore the message
			requested_blocks.intersection(&notfound_blocks).nth(0).is_some()
		} else {
			false
		};

		if is_requested_block {
			// for now, let's exclude peer from synchronization - we are relying on full nodes for synchronization
			let removed_tasks = self.peers_tasks.reset_blocks_tasks(peer_index);
			self.peers_tasks.unuseful_peer(peer_index);
			if self.state.is_synchronizing() {
				self.peers.misbehaving(peer_index, &format!("Responded with NotFound(unrequested_block)"));
			}

			// if peer has had some blocks tasks, rerequest these blocks
			self.execute_synchronization_tasks(Some(removed_tasks), None);
		}
	}

	/// Execute after last block from this peer in NearlySaturated state is verified.
	/// If there are no verifying blocks from this peer or we are not in the NearlySaturated state => execute immediately.
	fn after_peer_nearly_blocks_verified(&mut self, peer_index: PeerIndex, future: EmptyBoxFuture) {
		// if we are currently synchronizing => no need to wait
		if self.state.is_synchronizing() {
			future.wait().expect("no-error future");
			return;
		}

		// we have to wait until all previous peer requests are server
		match self.verifying_blocks_futures.entry(peer_index) {
			Entry::Occupied(mut entry) => {
				entry.get_mut().1.push(future);
			},
			_ => future.wait().expect("no-error future"),
		}
	}

	fn accept_transaction(&mut self, transaction: Transaction, sink: Box<TransactionVerificationSink>) -> Result<VecDeque<IndexedTransaction>, String> {
		let hash = transaction.hash();
		match self.try_append_transaction(transaction.into(), true) {
			Err(AppendTransactionError::Orphan(_)) => Err("Cannot append transaction as its inputs are unknown".to_owned()),
			Err(AppendTransactionError::Synchronizing) => Err("Cannot append transaction as node is not yet fully synchronized".to_owned()),
			Ok(transactions) => {
				self.verifying_transactions_sinks.insert(hash, sink);
				Ok(transactions)
			},
		}
	}

	fn install_sync_listener(&mut self, listener: SyncListenerRef) {
		// currently single, single-setup listener is supported
		assert!(self.listener.is_none());
		self.listener = Some(listener);
	}

	/// Schedule new synchronization tasks, if any.
	fn execute_synchronization_tasks(&mut self, forced_blocks_requests: Option<Vec<H256>>, final_blocks_requests: Option<Vec<H256>>) {
		let mut tasks: Vec<Task> = Vec::new();

		// display information if processed many blocks || enough time has passed since sync start
		self.print_synchronization_information();

		// prepare limits. TODO: must be updated using current retrieval && verification speed && blocks size
		let mut limits = BlocksRequestLimits::default();
		if self.chain.length_of_blocks_state(BlockState::Stored) > 150_000 {
			limits.min_blocks_in_request = 8;
			limits.max_blocks_in_request = 16;
		}

		// if some blocks requests are forced => we should ask peers even if there are no idle peers
		let verifying_hashes_len = self.chain.length_of_blocks_state(BlockState::Verifying);
		if let Some(forced_blocks_requests) = forced_blocks_requests {
			let useful_peers = self.peers_tasks.useful_peers();
			// if we have to request blocks && there are no useful peers at all => switch to saturated state
			if useful_peers.is_empty() {
				warn!(target: "sync", "Last peer was marked as non-useful. Moving to saturated state.");
				self.switch_to_saturated_state();
				return;
			}

			let forced_tasks = self.prepare_blocks_requests_tasks(&limits, useful_peers, forced_blocks_requests);
			tasks.extend(forced_tasks);
		}

		// if some blocks requests are marked as last [i.e. blocks are potentialy wrong] => ask peers anyway
		if let Some(final_blocks_requests) = final_blocks_requests {
			let useful_peers = self.peers_tasks.useful_peers();
			if !useful_peers.is_empty() { // if empty => not a problem, just forget these blocks
				let forced_tasks = self.prepare_blocks_requests_tasks(&limits, useful_peers, final_blocks_requests);
				tasks.extend(forced_tasks);
			}
		}

		let mut blocks_requests: Option<Vec<H256>> = None;
		let blocks_idle_peers: Vec<_> = self.peers_tasks.idle_peers_for_blocks().iter().cloned().collect();
		{
			// check if we can query some blocks headers
			let headers_idle_peers: Vec<_> = self.peers_tasks.idle_peers_for_headers().iter().cloned().collect();
			if !headers_idle_peers.is_empty() {
				let scheduled_hashes_len = self.chain.length_of_blocks_state(BlockState::Scheduled);
				if scheduled_hashes_len < MAX_SCHEDULED_HASHES {
					for header_peer in &headers_idle_peers {
						self.peers_tasks.on_headers_requested(*header_peer);
					}

					let block_locator_hashes = self.chain.block_locator_hashes();
					let headers_tasks = headers_idle_peers
						.iter()
						.map(move |peer_index| Task::GetHeaders(*peer_index, types::GetHeaders::with_block_locator_hashes(block_locator_hashes.clone())));
					tasks.extend(headers_tasks);
				}
			}

			let blocks_idle_peers_len = blocks_idle_peers.len() as BlockHeight;
			if blocks_idle_peers_len != 0 {
				// check if verification queue is empty/almost empty
				// && there are pending blocks requests
				// && there are idle block peers
				// => we may need to duplicate pending blocks requests to idle peers
				// this will result in additional network load, but verification queue will be filled up earlier
				// it is very useful when dealing with large blocks + some peer is responding, but with very low speed:
				//    requested: [B1, B2, B3, B4] from peer1
				//    orphans: [B5, B6, B7, B8, ... B1024] ===> 1GB of RAM
				//    verifying: None <=== we are waiting for B1 to come
				//    idle: [peer2]
				//    peer1 responds with single block in ~20 seconds
				//    => we could ask idle peer2 about [B1, B2, B3, B4]
				// these requests has priority over new blocks requests below
				let requested_hashes_len = self.chain.length_of_blocks_state(BlockState::Requested);
				if requested_hashes_len != 0 {
					let verification_speed: f64 = self.block_speed_meter.speed();
					let synchronization_speed: f64 = self.sync_speed_meter.speed();
					// estimate time when verification queue will be empty
					let verification_queue_will_be_empty_in = if verifying_hashes_len == 0 {
						// verification queue is already empty
						if self.block_speed_meter.inspected_items_len() < NEAR_EMPTY_VERIFICATION_QUEUE_THRESHOLD_BLOCKS {
							// the very beginning of synchronization
							// => peers have not yet responded with a single requested blocks
							60_f64
						} else {
							// blocks were are already received
							// => bad situation
							0_f64
						}
					} else if verification_speed < 0.01_f64 {
						// verification speed is too slow
						60_f64
					} else {
						// blocks / (blocks / second) -> second
						verifying_hashes_len as f64 / verification_speed
					};
					// estimate time when all synchronization requests will complete
					let synchronization_queue_will_be_full_in = if synchronization_speed < 0.01_f64 {
						// synchronization speed is too slow
						60_f64
					} else {
						// blocks / (blocks / second) -> second
						requested_hashes_len as f64 / synchronization_speed
					};
					// if verification queue will be empty before all synchronization requests will be completed
					// + do not spam with duplicated blocks requests if blocks are too big && there are still blocks left for NEAR_EMPTY_VERIFICATION_QUEUE_THRESHOLD_S
					// => duplicate blocks requests
					let now = precise_time_s();
					if synchronization_queue_will_be_full_in > verification_queue_will_be_empty_in &&
						verification_queue_will_be_empty_in < NEAR_EMPTY_VERIFICATION_QUEUE_THRESHOLD_S &&
						now - self.last_dup_time > MIN_BLOCK_DUPLICATION_INTERVAL_S {
						// do not duplicate too often
						self.last_dup_time = now;
						// blocks / second * second -> blocks
						let hashes_requests_to_duplicate_len = (synchronization_speed * (synchronization_queue_will_be_full_in - verification_queue_will_be_empty_in)) as BlockHeight;
						// do not ask for too many blocks
						let hashes_requests_to_duplicate_len = min(MAX_BLOCKS_IN_DUPLICATE_REQUEST, hashes_requests_to_duplicate_len);
						// ask for at least 1 block
						let hashes_requests_to_duplicate_len = max(MIN_BLOCKS_IN_DUPLICATE_REQUEST, min(requested_hashes_len, hashes_requests_to_duplicate_len));
						blocks_requests = Some(self.chain.best_n_of_blocks_state(BlockState::Requested, hashes_requests_to_duplicate_len as BlockHeight));

						trace!(target: "sync", "Duplicating {} blocks requests. Sync speed: {} * {}, blocks speed: {} * {}.", hashes_requests_to_duplicate_len, synchronization_speed, requested_hashes_len, verification_speed, verifying_hashes_len);
					}
				}

				// check if we can move some blocks from scheduled to requested queue
				{
					// TODO: only request minimal number of blocks, if other urgent blocks are requested
					let scheduled_hashes_len = self.chain.length_of_blocks_state(BlockState::Scheduled);
					if requested_hashes_len + verifying_hashes_len < MAX_REQUESTED_BLOCKS + MAX_VERIFYING_BLOCKS && scheduled_hashes_len != 0 {
						let chunk_size = min(limits.max_blocks_in_request, max(scheduled_hashes_len / blocks_idle_peers_len, limits.min_blocks_in_request));
						let hashes_to_request_len = chunk_size * blocks_idle_peers_len;
						let hashes_to_request = self.chain.request_blocks_hashes(hashes_to_request_len);
						match blocks_requests {
							Some(ref mut blocks_requests) => blocks_requests.extend(hashes_to_request),
							None => blocks_requests = Some(hashes_to_request),
						}
					}
				}
			}
		}

		// append blocks requests tasks
		if let Some(blocks_requests) = blocks_requests {
			tasks.extend(self.prepare_blocks_requests_tasks(&limits, blocks_idle_peers, blocks_requests));
		}

		// execute synchronization tasks
		for task in tasks {
			self.executor.execute(task);
		}
	}

	fn try_switch_to_saturated_state(&mut self) -> bool {
		let switch_to_saturated = {
			// requested block is received => move to saturated state if there are no more blocks
			self.chain.length_of_blocks_state(BlockState::Scheduled) == 0
				&& self.chain.length_of_blocks_state(BlockState::Requested) == 0
		};

		if switch_to_saturated {
			self.switch_to_saturated_state();
		}

		switch_to_saturated
	}
}

impl<T> CoreVerificationSink<T> where T: TaskExecutor {
	pub fn new(core: ClientCoreRef<SynchronizationClientCore<T>>) -> Self {
		CoreVerificationSink {
			core: core,
		}
	}
}

impl<T> VerificationSink for CoreVerificationSink<T> where T: TaskExecutor {
}

impl<T> BlockVerificationSink for CoreVerificationSink<T> where T: TaskExecutor {
	/// Process successful block verification
	fn on_block_verification_success(&self, block: IndexedBlock) -> Option<Vec<VerificationTask>> {
		self.core.lock().on_block_verification_success(block)
	}

	/// Process failed block verification
	fn on_block_verification_error(&self, err: &str, hash: &H256) {
		self.core.lock().on_block_verification_error(err, hash)
	}
}

impl<T> TransactionVerificationSink for CoreVerificationSink<T> where T: TaskExecutor {
	/// Process successful transaction verification
	fn on_transaction_verification_success(&self, transaction: IndexedTransaction) {
		self.core.lock().on_transaction_verification_success(transaction)
	}

	/// Process failed transaction verification
	fn on_transaction_verification_error(&self, err: &str, hash: &H256) {
		self.core.lock().on_transaction_verification_error(err, hash)
	}
}

impl<T> SynchronizationClientCore<T> where T: TaskExecutor {
	/// Create new synchronization client core
	pub fn new(config: Config, shared_state: SynchronizationStateRef, peers: PeersRef, executor: Arc<T>, chain: Chain, chain_verifier: Arc<ChainVerifier>) -> ClientCoreRef<Self> {
		let sync = Arc::new(Mutex::new(
			SynchronizationClientCore {
				shared_state: shared_state,
				state: State::Saturated,
				peers: peers,
				peers_tasks: PeersTasks::default(),
				management_worker: None,
				executor: executor,
				chain: chain,
				orphaned_blocks_pool: OrphanBlocksPool::new(),
				orphaned_transactions_pool: OrphanTransactionsPool::new(),
				chain_verifier: chain_verifier,
				verify_headers: true,
				verifying_blocks_by_peer: HashMap::new(),
				verifying_blocks_futures: HashMap::new(),
				verifying_transactions_sinks: HashMap::new(),
				do_not_relay: HashSet::new(),
				block_speed_meter: AverageSpeedMeter::with_inspect_items(SYNC_SPEED_BLOCKS_TO_INSPECT),
				sync_speed_meter: AverageSpeedMeter::with_inspect_items(BLOCKS_SPEED_BLOCKS_TO_INSPECT),
				config: config,
				listener: None,
				last_dup_time: 0f64,
			}
		));

		{
			let csync = Arc::downgrade(&sync);
			let mut lsync = sync.lock();
			lsync.management_worker = Some(ManagementWorker::new(csync));
		}

		sync
	}

	/// Get information on current synchronization state.
	#[cfg(test)]
	pub fn information(&self) -> Information {
		Information {
			state: self.state,
			peers_tasks: self.peers_tasks.information(),
			chain: self.chain.information(),
			orphaned_blocks: self.orphaned_blocks_pool.len(),
			orphaned_transactions: self.orphaned_transactions_pool.len(),
		}
	}

	/// Get synchronization state
	pub fn state(&self) -> State {
		self.state
	}

	/// Return chain reference
	pub fn chain(&mut self) -> &mut Chain {
		&mut self.chain
	}

	/// Return peers reference
	pub fn peers(&self) -> PeersRef {
		self.peers.clone()
	}

	/// Return peers tasks reference
	pub fn peers_tasks(&mut self) -> &mut PeersTasks {
		&mut self.peers_tasks
	}

	/// Get orphaned blocks pool reference
	pub fn orphaned_blocks_pool(&mut self) -> &mut OrphanBlocksPool {
		&mut self.orphaned_blocks_pool
	}

	/// Get orphaned transactions pool reference
	pub fn orphaned_transactions_pool(&mut self) -> &mut OrphanTransactionsPool {
		&mut self.orphaned_transactions_pool
	}

	/// Verify block headers or not?
	#[cfg(test)]
	pub fn set_verify_headers(&mut self, verify: bool) {
		self.verify_headers = verify;
	}

	/// Print synchronization information
	pub fn print_synchronization_information(&mut self) {
		if let State::Synchronizing(timestamp, num_of_blocks) = self.state {
			let new_timestamp = precise_time_s();
			let timestamp_diff = new_timestamp - timestamp;
			let new_num_of_blocks = self.chain.best_storage_block().number;
			let blocks_diff = if new_num_of_blocks > num_of_blocks { new_num_of_blocks - num_of_blocks } else { 0 };
			if timestamp_diff >= 60.0 || blocks_diff >= 1000 {
				self.state = State::Synchronizing(precise_time_s(), new_num_of_blocks);
				let blocks_speed = blocks_diff as f64 / timestamp_diff;
				info!(target: "sync", "Processed {} blocks in {:.2} seconds ({:.2} blk/s).\tPeers: {:?}.\tChain: {:?}"
					, blocks_diff
					, timestamp_diff
					, blocks_speed
					, self.peers_tasks.information()
					, self.chain.information());
			}
		}
	}

	/// Forget blocks, which have been requested several times, but no one has responded
	pub fn forget_failed_blocks(&mut self, blocks_to_forget: &[H256]) {
		if blocks_to_forget.is_empty() {
			return;
		}

		for block_to_forget in blocks_to_forget {
			self.chain.forget_block_with_children(block_to_forget);
		}
	}

	/// Verify and select unknown headers for scheduling
	fn verify_headers(&mut self, peer_index: PeerIndex, last_known_hash: H256, headers: &[IndexedBlockHeader]) -> BlocksHeadersVerificationResult {
		// validate blocks headers before scheduling
		let mut last_known_hash = &last_known_hash;
		let mut headers_provider = MessageBlockHeadersProvider::new(&self.chain, self.chain.best_block_header().number);
		for (header_index, header) in headers.iter().enumerate() {
			// check that this header is direct child of previous header
			if &header.raw.previous_header_hash != last_known_hash {
				self.peers.misbehaving(peer_index, &format!("Neighbour headers in `headers` message are unlinked: Prev: {}, PrevLink: {}, Curr: {}",
					last_known_hash.to_reversed_str(), header.raw.previous_header_hash.to_reversed_str(), header.hash.to_reversed_str()));
				return BlocksHeadersVerificationResult::Skip;
			}

			// check that we do not know all blocks in range [first_unknown_index..]
			// if we know some block => there has been verification error => all headers should be ignored
			// see when_previous_block_verification_failed_fork_is_not_requested for details
			match self.chain.block_state(&header.hash) {
				BlockState::Unknown => (),
				BlockState::DeadEnd if self.config.close_connection_on_bad_block => {
					self.peers.misbehaving(peer_index, &format!("Provided dead-end block {:?}", header.hash.to_reversed_str()));
					return BlocksHeadersVerificationResult::Skip;
				},
				block_state => {
					trace!(target: "sync", "Ignoring {} headers from peer#{} - known ({:?}) header {} at the {}/{} ({}...{})",
						headers.len(), peer_index, block_state, header.hash.to_reversed_str(), header_index, headers.len(),
						headers[0].hash.to_reversed_str(), headers[headers.len() - 1].hash.to_reversed_str());
					self.peers_tasks.useful_peer(peer_index);
					return BlocksHeadersVerificationResult::Skip;
				},
			}

			// verify header
			if self.verify_headers {
				if let Err(error) = self.chain_verifier.verify_block_header(&headers_provider, &header.hash, &header.raw) {
					if self.config.close_connection_on_bad_block {
						self.peers.misbehaving(peer_index, &format!("Error verifying header {} from `headers`: {:?}", header.hash.to_reversed_str(), error));
					} else {
						warn!(target: "sync", "Error verifying header {} from `headers` message: {:?}", header.hash.to_reversed_str(), error);
					}
					return BlocksHeadersVerificationResult::Error(header_index);
				}
			}

			last_known_hash = &header.hash;
			headers_provider.append_header(header.hash.clone(), header.raw.clone());
		}

		BlocksHeadersVerificationResult::Success
	}

	/// Process new peer transaction
	fn process_peer_transaction(&mut self, _peer_index: Option<PeerIndex>, transaction: IndexedTransaction, relay: bool) -> Option<VecDeque<IndexedTransaction>> {
		match self.try_append_transaction(transaction.clone(), relay) {
			Err(AppendTransactionError::Orphan(unknown_parents)) => {
				self.orphaned_transactions_pool.insert(transaction, unknown_parents);
				None
			},
			Err(AppendTransactionError::Synchronizing) => None,
			Ok(transactions) => Some(transactions),
		}
	}

	fn try_append_transaction(&mut self, transaction: IndexedTransaction, relay: bool) -> Result<VecDeque<IndexedTransaction>, AppendTransactionError> {
		// if we are in synchronization state, we will ignore this message
		if self.state.is_synchronizing() {
			return Err(AppendTransactionError::Synchronizing);
		}

		// else => verify transaction + it's orphans and then add to the memory pool
		// if any parent transaction is unknown => we have orphan transaction => remember in orphan pool
		let unknown_parents: HashSet<H256> = transaction.raw.inputs.iter()
			.filter(|input| self.chain.transaction_state(&input.previous_output.hash) == TransactionState::Unknown)
			.map(|input| input.previous_output.hash.clone())
			.collect();
		if !unknown_parents.is_empty() {
			return Err(AppendTransactionError::Orphan(unknown_parents));
		}

		// else verify && insert this transaction && all dependent orphans
		let mut transactions: VecDeque<IndexedTransaction> = VecDeque::new();
		transactions.extend(self.orphaned_transactions_pool.remove_transactions_for_parent(&transaction.hash));
		transactions.push_front(transaction);
		// remember that we are verifying these transactions
		for tx in &transactions {
			if !relay {
				self.do_not_relay.insert(tx.hash.clone());
			}
			self.chain.verify_transaction((*tx).clone());
		}
		Ok(transactions)
	}

	fn prepare_blocks_requests_tasks(&mut self, limits: &BlocksRequestLimits, mut peers: Vec<PeerIndex>, mut hashes: Vec<H256>) -> Vec<Task> {
		use std::mem::swap;

		// ask fastest peers for hashes at the beginning of `hashes`
		self.peers_tasks.sort_peers_for_blocks(&mut peers);

		let chunk_size = min(limits.max_blocks_in_request, max(hashes.len() as BlockHeight, limits.min_blocks_in_request));
		let last_peer_index = peers.len() - 1;
		let mut tasks: Vec<Task> = Vec::new();
		let is_segwit_possible = self.chain.is_segwit_possible();
		let inv_type = if is_segwit_possible { InventoryType::MessageWitnessBlock } else { InventoryType::MessageBlock };
		for (peer_index, peer) in peers.into_iter().enumerate() {
			// we have to request all blocks => we will request last peer for all remaining blocks
			let peer_chunk_size = if peer_index == last_peer_index { hashes.len() } else { min(hashes.len(), chunk_size as usize) };
			if peer_chunk_size == 0 {
				break;
			}

			let mut chunk_hashes = hashes.split_off(peer_chunk_size);
			swap(&mut chunk_hashes, &mut hashes);

			// remember that peer is asked for these blocks
			self.peers_tasks.on_blocks_requested(peer, &chunk_hashes);

			// request blocks. If block is believed to have witness - ask for witness
			let getdata = types::GetData {
				inventory: chunk_hashes.into_iter().map(|h| InventoryVector {
					inv_type: inv_type,
					hash: h,
				}).collect(),
			};
			tasks.push(Task::GetData(peer, getdata));
		}

		assert_eq!(hashes.len(), 0);
		tasks
	}

	/// Switch to synchronization state
	fn switch_to_synchronization_state(&mut self) {
		if self.state.is_synchronizing() {
			return;
		}

		if let Some(ref listener) = self.listener {
			listener.synchronization_state_switched(true);
		}

		self.shared_state.update_synchronizing(true);
		self.state = State::Synchronizing(precise_time_s(), self.chain.best_storage_block().number);
	}

	/// Switch to nearly saturated state
	fn switch_to_nearly_saturated_state(&mut self) {
		if self.state.is_nearly_saturated() {
			return;
		}

		if let Some(ref listener) = self.listener {
			listener.synchronization_state_switched(false);
		}

		self.shared_state.update_synchronizing(false);
		self.state = State::NearlySaturated;
	}

	/// Switch to saturated state
	fn switch_to_saturated_state(&mut self) {
		if self.state.is_saturated() {
			return;
		}

		if let Some(ref listener) = self.listener {
			listener.synchronization_state_switched(false);
		}

		self.shared_state.update_synchronizing(false);
		self.state = State::Saturated;
		self.peers_tasks.reset();

		// remove sync orphans, but leave unknown orphans until they'll be removed by management thread
		let removed_orphans = self.orphaned_blocks_pool.remove_known_blocks();

		// leave currently verifying blocks
		{
			self.chain.forget_blocks(&removed_orphans);
			self.chain.forget_all_blocks_with_state(BlockState::Requested);
			self.chain.forget_all_blocks_with_state(BlockState::Scheduled);

			info!(target: "sync", "Switched to saturated state.\tChain: {:?}",
				self.chain.information());
		}

		// finally - ask all known peers for their best blocks inventory, in case if some peer
		// has lead us to the fork
		// + ask all peers for their memory pool
		{
			let block_locator_hashes: Vec<H256> = self.chain.block_locator_hashes();
			for peer in self.peers_tasks.all_peers() {
				self.executor.execute(Task::GetHeaders(*peer, types::GetHeaders::with_block_locator_hashes(block_locator_hashes.clone())));
				self.executor.execute(Task::MemoryPool(*peer));
			}
		}
	}

	fn on_block_verification_success(&mut self, block: IndexedBlock) -> Option<Vec<VerificationTask>> {
		// update block processing speed
		self.block_speed_meter.checkpoint();

		// remove flags
		let needs_relay = !self.do_not_relay.remove(block.hash());

		let block_hash = block.hash().clone();
		// insert block to the storage
		match {
			// remove block from verification queue
			// header is removed in `insert_best_block` call
			// or it is removed earlier, when block was removed from the verifying queue
			if self.chain.forget_block_with_state_leave_header(block.hash(), BlockState::Verifying) != HashPosition::Missing {
				// block was in verification queue => insert to storage
				self.chain.insert_best_block(block)
			} else {
				Ok(BlockInsertionResult::default())
			}
		} {
			Ok(insert_result) => {
				// update shared state
				self.shared_state.update_best_storage_block_height(self.chain.best_storage_block().number);

				// notify listener
				if let Some(best_block_hash) = insert_result.canonized_blocks_hashes.last() {
					if let Some(ref listener) = self.listener {
						listener.best_storage_block_inserted(best_block_hash);
					}
				}

				// awake threads, waiting for this block insertion
				self.awake_waiting_threads(&block_hash);

				// continue with synchronization
				self.execute_synchronization_tasks(None, None);

				// relay block to our peers
				if needs_relay && (self.state.is_saturated() || self.state.is_nearly_saturated()) {
					for block_hash in insert_result.canonized_blocks_hashes {
						if let Some(block) = self.chain.storage().block(block_hash.into()) {
							self.executor.execute(Task::RelayNewBlock(block.into()));
						}
					}
				}

				// deal with block transactions
				let mut verification_tasks: Vec<VerificationTask> = Vec::with_capacity(insert_result.transactions_to_reverify.len());
				let next_block_height = self.chain.best_block().number + 1;
				for tx in insert_result.transactions_to_reverify {
					// do not relay resurrected transactions again
					if let Some(tx_orphans) = self.process_peer_transaction(None, tx.into(), false) {
						let tx_tasks = tx_orphans.into_iter().map(|tx| VerificationTask::VerifyTransaction(next_block_height, tx));
						verification_tasks.extend(tx_tasks);
					};
				}
				Some(verification_tasks)
			},
			Err(e) => {
				// process as irrecoverable failure
				panic!("Block {} insertion failed with error {:?}", block_hash.to_reversed_str(), e);
			},
		}
	}

	fn on_block_verification_error(&mut self, err: &str, hash: &H256) {
		warn!(target: "sync", "Block {:?} verification failed with error {:?}", hash.to_reversed_str(), err);

		// remove flags
		self.do_not_relay.remove(hash);

		// close connection with this peer
		if let Some(peer_index) = self.verifying_blocks_by_peer.get(hash) {
			if self.config.close_connection_on_bad_block {
				self.peers.dos(*peer_index, &format!("Provided wrong block {}", hash.to_reversed_str()))
			} else {
				warn!(target: "sync", "Peer#{} has provided wrong block {:?}", peer_index, hash.to_reversed_str());
			}
		}

		// forget for this block and all its children
		// headers are also removed as they all are invalid
		self.chain.forget_block_with_children(hash);

		// mark failed block as dead end (this branch won't be synchronized)
		self.chain.mark_dead_end_block(hash);

		// awake threads, waiting for this block insertion
		self.awake_waiting_threads(hash);

		// start new tasks
		self.execute_synchronization_tasks(None, None);
	}

	fn on_transaction_verification_success(&mut self, transaction: IndexedTransaction) {
		// remove flags
		let needs_relay = !self.do_not_relay.remove(&transaction.hash);

		// insert transaction to the memory pool
		// remove transaction from verification queue
		// if it is not in the queue => it was removed due to error or reorganization
		if !self.chain.forget_verifying_transaction(&transaction.hash) {
			return;
		}

		// transaction was in verification queue => insert to memory pool
		self.chain.insert_verified_transaction(transaction.clone());

		// calculate transaction fee rate
		let transaction_fee_rate = transaction_fee_rate(&self.chain, &transaction.raw);

		// relay transaction to peers
		if needs_relay {
			self.executor.execute(Task::RelayNewTransaction(transaction.clone(), transaction_fee_rate));
		}

		// call verification future, if any
		if let Some(future_sink) = self.verifying_transactions_sinks.remove(&transaction.hash) {
			future_sink.on_transaction_verification_success(transaction);
		}
	}

	fn on_transaction_verification_error(&mut self, err: &str, hash: &H256) {
		warn!(target: "sync", "Transaction {} verification failed with error {:?}", hash.to_reversed_str(), err);

		// remove flags
		self.do_not_relay.remove(hash);

		// forget for this transaction and all its children
		self.chain.forget_verifying_transaction_with_children(hash);

		// call verification future, if any
		if let Some(future_sink) = self.verifying_transactions_sinks.remove(hash) {
			future_sink.on_transaction_verification_error(err, hash);
		}
	}

	/// Execute futures, which were waiting for this block verification
	fn awake_waiting_threads(&mut self, hash: &H256) {
		// find a peer, which has supplied us with this block
		if let Entry::Occupied(block_entry) = self.verifying_blocks_by_peer.entry(hash.clone()) {
			let peer_index = *block_entry.get();
			// find a # of blocks, which this thread has supplied
			if let Entry::Occupied(mut entry) = self.verifying_blocks_futures.entry(peer_index) {
				let is_last_block = {
					let &mut (ref mut waiting, ref mut futures) = entry.get_mut();
					waiting.remove(hash);
					// if this is the last block => awake waiting threads
					let is_last_block = waiting.is_empty();
					if is_last_block {
						for future in futures.drain(..) {
							future.wait().expect("no-error future");
						}
					}
					is_last_block
				};

				if is_last_block {
					entry.remove_entry();
				}
			}
			block_entry.remove_entry();
		}
	}
}

impl Default for BlocksRequestLimits {
	fn default() -> Self {
		BlocksRequestLimits {
			max_scheduled_hashes: MAX_SCHEDULED_HASHES,
			max_requested_blocks: MAX_REQUESTED_BLOCKS,
			max_verifying_blocks: MAX_VERIFYING_BLOCKS,
			min_blocks_in_request: MIN_BLOCKS_IN_REQUEST,
			max_blocks_in_request: MAX_BLOCKS_IN_REQUEST,
		}
	}
}

#[cfg(test)]
pub mod tests {
	extern crate test_data;

	use std::sync::Arc;
	use parking_lot::{Mutex, RwLock};
	use chain::{Block, Transaction};
	use db::BlockChainDatabase;
	use message::common::InventoryVector;
	use message::{Services, types};
	use miner::MemoryPool;
	use network::{ConsensusParams, ConsensusFork, Network};
	use primitives::hash::H256;
	use verification::BackwardsCompatibleChainVerifier as ChainVerifier;
	use inbound_connection::tests::DummyOutboundSyncConnection;
	use synchronization_chain::Chain;
	use synchronization_client::{SynchronizationClient, Client};
	use synchronization_peers::PeersImpl;
	use synchronization_executor::Task;
	use synchronization_executor::tests::DummyTaskExecutor;
	use synchronization_verifier::tests::DummyVerifier;
	use utils::SynchronizationState;
	use types::{PeerIndex, StorageRef, SynchronizationStateRef, ClientCoreRef};
	use super::{Config, SynchronizationClientCore, ClientCore, CoreVerificationSink};
	use super::super::SyncListener;

	#[derive(Default)]
	struct DummySyncListenerData {
		pub is_synchronizing: bool,
		pub best_blocks: Vec<H256>,
	}

	struct DummySyncListener {
		data: Arc<Mutex<DummySyncListenerData>>,
	}

	impl DummySyncListener {
		pub fn new(data: Arc<Mutex<DummySyncListenerData>>) -> Self {
			DummySyncListener {
				data: data,
			}
		}
	}

	impl SyncListener for DummySyncListener {
		fn synchronization_state_switched(&self, is_synchronizing: bool) {
			self.data.lock().is_synchronizing = is_synchronizing;
		}

		fn best_storage_block_inserted(&self, block_hash: &H256) {
			self.data.lock().best_blocks.push(block_hash.clone());
		}
	}

	fn create_sync(storage: Option<StorageRef>, verifier: Option<DummyVerifier>) -> (Arc<DummyTaskExecutor>, ClientCoreRef<SynchronizationClientCore<DummyTaskExecutor>>, Arc<SynchronizationClient<DummyTaskExecutor, DummyVerifier>>) {
		let sync_peers = Arc::new(PeersImpl::default());
		let storage = match storage {
			Some(storage) => storage,
			None => Arc::new(BlockChainDatabase::init_test_chain(vec![test_data::genesis().into()])),
		};
		let sync_state = SynchronizationStateRef::new(SynchronizationState::with_storage(storage.clone()));
		let memory_pool = Arc::new(RwLock::new(MemoryPool::new()));
		let chain = Chain::new(storage.clone(), ConsensusParams::new(Network::Unitest, ConsensusFork::BitcoinCore), memory_pool.clone());
		let executor = DummyTaskExecutor::new();
		let config = Config { close_connection_on_bad_block: true };

		let chain_verifier = Arc::new(ChainVerifier::new(storage.clone(), ConsensusParams::new(Network::Unitest, ConsensusFork::BitcoinCore)));
		let client_core = SynchronizationClientCore::new(config, sync_state.clone(), sync_peers.clone(), executor.clone(), chain, chain_verifier.clone());
		{
			client_core.lock().set_verify_headers(false);
		}
		let mut verifier = verifier.unwrap_or_default();
		verifier.set_sink(Arc::new(CoreVerificationSink::new(client_core.clone())));
		verifier.set_storage(storage);
		verifier.set_memory_pool(memory_pool);
		verifier.set_verifier(chain_verifier);

		let client = SynchronizationClient::new(sync_state, client_core.clone(), verifier);
		(executor, client_core, client)
	}

	fn request_block_headers_genesis(peer_index: PeerIndex) -> Task {
		Task::GetHeaders(peer_index, types::GetHeaders::with_block_locator_hashes(vec![test_data::genesis().hash()]))
	}

	fn request_block_headers_genesis_and(peer_index: PeerIndex, mut hashes: Vec<H256>) -> Task {
		hashes.push(test_data::genesis().hash());
		Task::GetHeaders(peer_index, types::GetHeaders::with_block_locator_hashes(hashes))
	}

	fn request_blocks(peer_index: PeerIndex, hashes: Vec<H256>) -> Task {
		Task::GetData(peer_index, types::GetData {
			inventory: hashes.into_iter().map(InventoryVector::witness_block).collect(),
		})
	}

	#[test]
	fn synchronization_request_inventory_on_sync_start() {
		let (executor, _, sync) = create_sync(None, None);
		// start sync session
		sync.on_connect(0);
		// => ask for inventory
		let tasks = executor.take_tasks();
		assert_eq!(tasks, vec![request_block_headers_genesis(0)]);
	}

	#[test]
	fn synchronization_saturated_on_start() {
		let (_, core, _) = create_sync(None, None);
		let info = core.lock().information();
		assert!(!info.state.is_synchronizing());
		assert_eq!(info.orphaned_blocks, 0);
		assert_eq!(info.orphaned_transactions, 0);
	}

	#[test]
	fn synchronization_in_order_block_path_nearly_saturated() {
		let (executor, core, sync) = create_sync(None, None);

		let block1: Block = test_data::block_h1();
		let block2: Block = test_data::block_h2();

		sync.on_headers(5, types::Headers::with_headers(vec![block1.block_header.clone()]));
		let tasks = executor.take_tasks();
		assert_eq!(tasks, vec![request_block_headers_genesis_and(5, vec![block1.hash()]), request_blocks(5, vec![block1.hash()])]);
		assert!(core.lock().information().state.is_nearly_saturated());
		assert_eq!(core.lock().information().orphaned_blocks, 0);
		assert_eq!(core.lock().information().chain.scheduled, 0);
		assert_eq!(core.lock().information().chain.requested, 1);
		assert_eq!(core.lock().information().chain.stored, 1);
		assert_eq!(core.lock().information().peers_tasks.idle, 0);
		assert_eq!(core.lock().information().peers_tasks.active, 1);

		// push unknown block => will be queued as orphan
		sync.on_block(5, block2.into());
		assert!(core.lock().information().state.is_nearly_saturated());
		assert_eq!(core.lock().information().orphaned_blocks, 1);
		assert_eq!(core.lock().information().chain.scheduled, 0);
		assert_eq!(core.lock().information().chain.requested, 1);
		assert_eq!(core.lock().information().chain.stored, 1);
		assert_eq!(core.lock().information().peers_tasks.idle, 0);
		assert_eq!(core.lock().information().peers_tasks.active, 1);

		// push requested block => should be moved to the test storage && orphan should be moved
		sync.on_block(5, block1.into());
		assert!(core.lock().information().state.is_saturated());
		assert_eq!(core.lock().information().orphaned_blocks, 0);
		assert_eq!(core.lock().information().chain.scheduled, 0);
		assert_eq!(core.lock().information().chain.requested, 0);
		assert_eq!(core.lock().information().chain.stored, 3);
		// we have just requested new `inventory` from the peer => peer is forgotten
		assert_eq!(core.lock().information().peers_tasks.idle, 0);
		assert_eq!(core.lock().information().peers_tasks.active, 0);
	}

	#[test]
	fn synchronization_out_of_order_block_path() {
		let (_, core, sync) = create_sync(None, None);

		sync.on_headers(5, types::Headers::with_headers(vec![test_data::block_h1().block_header.clone(), test_data::block_h2().block_header.clone()]));
		sync.on_block(5, test_data::block_h169().into());

		// out-of-order block was presented by the peer
		assert!(core.lock().information().state.is_synchronizing());
		assert_eq!(core.lock().information().orphaned_blocks, 0);
		assert_eq!(core.lock().information().chain.scheduled, 0);
		assert_eq!(core.lock().information().chain.requested, 2);
		assert_eq!(core.lock().information().chain.stored, 1);
		// we have just requested new `inventory` from the peer => peer is forgotten
		assert_eq!(core.lock().information().peers_tasks.idle, 0);
		assert_eq!(core.lock().information().peers_tasks.active, 1);
		// TODO: check that peer is penalized
	}

	#[test]
	fn synchronization_parallel_peers() {
		let (executor, core, sync) = create_sync(None, None);

		let block1: Block = test_data::block_h1();
		let block2: Block = test_data::block_h2();

		{
			// not synchronizing after start
			assert!(core.lock().information().state.is_saturated());
			// receive inventory from new peer#1
			sync.on_headers(1, types::Headers::with_headers(vec![block1.block_header.clone()]));
			assert_eq!(core.lock().information().chain.requested, 1);
			// synchronization has started && new blocks have been requested
			let tasks = executor.take_tasks();
			assert!(core.lock().information().state.is_nearly_saturated());
			assert_eq!(tasks, vec![request_block_headers_genesis_and(1, vec![block1.hash()]), request_blocks(1, vec![block1.hash()])]);
		}

		{
			// receive inventory from new peer#2
			sync.on_headers(2, types::Headers::with_headers(vec![block1.block_header.clone(), block2.block_header.clone()]));
			assert_eq!(core.lock().information().chain.requested, 2);
			// synchronization has started && new blocks have been requested
			let tasks = executor.take_tasks();
			assert!(core.lock().information().state.is_synchronizing());
			assert_eq!(tasks, vec![request_block_headers_genesis_and(2, vec![block2.hash(), block1.hash()]), request_blocks(2, vec![block2.hash()])]);
		}

		{
			// receive block from peer#2
			sync.on_block(2, block2.into());
			let information = core.lock().information();
			assert!(information.chain.requested == 2 && information.orphaned_blocks == 1);
			// receive block from peer#1
			sync.on_block(1, block1.into());

			let information = core.lock().information();
			assert!(information.chain.requested == 0
				&& information.orphaned_blocks == 0
				&& information.chain.stored == 3);
		}
	}

	#[test]
	fn synchronization_reset_when_peer_is_disconnected() {
		let (_, core, sync) = create_sync(None, None);

		// request new blocks
		{
			sync.on_headers(1, types::Headers::with_headers(vec![test_data::block_h1().block_header]));
			assert!(core.lock().information().state.is_nearly_saturated());
		}

		// lost connection to peer => synchronization state lost
		{
			sync.on_disconnect(1);
			assert!(core.lock().information().state.is_saturated());
		}
	}

	#[test]
	fn synchronization_not_starting_when_receiving_known_blocks() {
		let (executor, core, sync) = create_sync(None, None);
		// saturated => receive inventory with known blocks only
		sync.on_headers(1, types::Headers::with_headers(vec![test_data::genesis().block_header]));
		// => no need to start synchronization
		assert!(!core.lock().information().state.is_nearly_saturated());
		// => no synchronization tasks are scheduled
		let tasks = executor.take_tasks();
		assert_eq!(tasks, vec![]);
	}

	#[test]
	fn synchronization_asks_for_inventory_after_saturating() {
		let (executor, _, sync) = create_sync(None, None);
		let block = test_data::block_h1();
		sync.on_headers(1, types::Headers::with_headers(vec![block.block_header.clone()]));
		sync.on_headers(2, types::Headers::with_headers(vec![block.block_header.clone()]));
		executor.take_tasks();
		sync.on_block(2, block.clone().into());

		let tasks = executor.take_tasks();
		assert_eq!(tasks.len(), 6);
		// TODO: when saturating, RequestBlocksHeaders is sent twice to the peer who has supplied last block:
		// 1) from on_block_verification_success
		// 2) from switch_to_saturated_state
		assert!(tasks.iter().any(|t| t == &request_block_headers_genesis_and(1, vec![block.hash()])));
		assert!(tasks.iter().any(|t| t == &request_block_headers_genesis_and(2, vec![block.hash()])));
		assert!(tasks.iter().any(|t| t == &Task::MemoryPool(1)));
		assert!(tasks.iter().any(|t| t == &Task::MemoryPool(2)));
		assert!(tasks.iter().any(|t| t == &Task::RelayNewBlock(block.clone().into())));
	}

	#[test]
	fn synchronization_remembers_correct_block_headers_in_order() {
		let (executor, core, sync) = create_sync(None, None);

		let b1 = test_data::block_h1();
		let b2 = test_data::block_h2();
		sync.on_headers(1, types::Headers::with_headers(vec![b1.block_header.clone(), b2.block_header.clone()]));

		let tasks = executor.take_tasks();
		assert_eq!(tasks.len(), 2);
		assert!(tasks.iter().any(|t| t == &request_block_headers_genesis_and(1, vec![b2.hash(), b1.hash()])));
		assert!(tasks.iter().any(|t| t == &request_blocks(1, vec![b1.hash(), b2.hash()])));

		{
			let mut core = core.lock(); let chain = core.chain();
			assert_eq!(chain.information().headers.best, 2);
			assert_eq!(chain.information().headers.total, 2);
		}

		sync.on_block(1, b1.clone().into());

		let tasks = executor.take_tasks();
		assert_eq!(tasks, vec![]);

		{
			let mut core = core.lock(); let chain = core.chain();
			assert_eq!(chain.information().headers.best, 1);
			assert_eq!(chain.information().headers.total, 1);
		}

		sync.on_block(1, b2.clone().into());

		let tasks = executor.take_tasks();
		assert_eq!(tasks, vec![request_block_headers_genesis_and(1, vec![b2.hash(), b1.hash()]), Task::MemoryPool(1)]);

		{
			let mut core = core.lock(); let chain = core.chain();
			assert_eq!(chain.information().headers.best, 0);
			assert_eq!(chain.information().headers.total, 0);
		}
	}

	#[test]
	fn synchronization_remembers_correct_block_headers_out_of_order() {
		let (executor, core, sync) = create_sync(None, None);

		let b1 = test_data::block_h1();
		let b2 = test_data::block_h2();
		sync.on_headers(1, types::Headers::with_headers(vec![b1.block_header.clone(), b2.block_header.clone()]));

		let tasks = executor.take_tasks();
		assert_eq!(tasks.len(), 2);
		assert!(tasks.iter().any(|t| t == &request_block_headers_genesis_and(1, vec![b2.hash(), b1.hash()])));
		assert!(tasks.iter().any(|t| t == &request_blocks(1, vec![b1.hash(), b2.hash()])));

		{
			let mut core = core.lock(); let chain = core.chain();
			assert_eq!(chain.information().headers.best, 2);
			assert_eq!(chain.information().headers.total, 2);
		}

		sync.on_block(1, b2.clone().into());

		let tasks = executor.take_tasks();
		assert_eq!(tasks, vec![]);

		{
			let mut core = core.lock(); let chain = core.chain();
			assert_eq!(chain.information().headers.best, 2);
			assert_eq!(chain.information().headers.total, 2);
		}

		sync.on_block(1, b1.clone().into());

		let tasks = executor.take_tasks();
		assert_eq!(tasks, vec![request_block_headers_genesis_and(1, vec![b2.hash(), b1.hash()]), Task::MemoryPool(1)]);

		{
			let mut core = core.lock(); let chain = core.chain();
			assert_eq!(chain.information().headers.best, 0);
			assert_eq!(chain.information().headers.total, 0);
		}
	}

	#[test]
	fn synchronization_ignores_unknown_block_headers() {
		let (executor, core, sync) = create_sync(None, None);

		let b169 = test_data::block_h169();
		sync.on_headers(1, types::Headers::with_headers(vec![b169.block_header]));

		let tasks = executor.take_tasks();
		assert_eq!(tasks, vec![]);

		let mut core = core.lock(); let chain = core.chain();
		assert_eq!(chain.information().headers.best, 0);
		assert_eq!(chain.information().headers.total, 0);
	}

	#[test]
	fn synchronization_works_for_forks_from_db_best_block() {
		let genesis = test_data::genesis();
		let storage = Arc::new(BlockChainDatabase::init_test_chain(vec![test_data::genesis().into()]));

		let (executor, core, sync) = create_sync(Some(storage), None);
		let genesis_header = &genesis.block_header;
		let fork1 = test_data::build_n_empty_blocks_from(2, 100, &genesis_header);
		let fork2 = test_data::build_n_empty_blocks_from(3, 200, &genesis_header);

		sync.on_headers(1, types::Headers::with_headers(vec![fork1[0].block_header.clone(), fork1[1].block_header.clone()]));
		sync.on_headers(2, types::Headers::with_headers(vec![fork2[0].block_header.clone(), fork2[1].block_header.clone(), fork2[2].block_header.clone()]));
		let tasks = { executor.take_tasks() };
		assert_eq!(tasks, vec![request_block_headers_genesis_and(1, vec![fork1[1].hash(), fork1[0].hash()]),
			request_blocks(1, vec![fork1[0].hash(), fork1[1].hash()]),
			// this is possibly wrong, because we have mixed two forks, but this works because we ask for headers on saturating
			request_block_headers_genesis_and(2, vec![fork2[2].hash(), fork2[1].hash(), fork2[0].hash(), fork1[1].hash(), fork1[0].hash()]),
			request_blocks(2, vec![fork2[0].hash(), fork2[1].hash(), fork2[2].hash()]),
		]);

		sync.on_block(2, fork2[0].clone().into());
		{
			let mut core = core.lock(); let chain = core.chain();
			assert_eq!(chain.best_storage_block().hash, fork2[0].hash());
			assert_eq!(chain.best_storage_block().number, 1);
		}

		sync.on_block(1, fork1[0].clone().into());
		{
			let mut core = core.lock(); let chain = core.chain();
			assert_eq!(chain.best_storage_block().hash, fork2[0].hash());
			assert_eq!(chain.best_storage_block().number, 1);
		}

		sync.on_block(1, fork1[1].clone().into());
		{
			let mut core = core.lock(); let chain = core.chain();
			assert_eq!(chain.best_storage_block().hash, fork1[1].hash());
			assert_eq!(chain.best_storage_block().number, 2);
		}

		sync.on_block(2, fork2[1].clone().into());
		{
			let mut core = core.lock(); let chain = core.chain();
			assert_eq!(chain.best_storage_block().hash, fork1[1].hash());
			assert_eq!(chain.best_storage_block().number, 2);
		}

		sync.on_block(2, fork2[2].clone().into());
		{
			let mut core = core.lock(); let chain = core.chain();
			assert_eq!(chain.best_storage_block().hash, fork2[2].hash());
			assert_eq!(chain.best_storage_block().number, 3);
		}
	}

	#[test]
	fn synchronization_works_for_forks_long_after_short() {
		let genesis = test_data::genesis();
		let storage = Arc::new(BlockChainDatabase::init_test_chain(vec![test_data::genesis().into()]));

		let (executor, core, sync) = create_sync(Some(storage), None);
		let common_block = test_data::block_builder().header().parent(genesis.hash()).build().build();
		let fork1 = test_data::build_n_empty_blocks_from(2, 100, &common_block.block_header);
		let fork2 = test_data::build_n_empty_blocks_from(3, 200, &common_block.block_header);

		sync.on_headers(1, types::Headers::with_headers(vec![common_block.block_header.clone(), fork1[0].block_header.clone(), fork1[1].block_header.clone()]));
		sync.on_headers(2, types::Headers::with_headers(vec![common_block.block_header.clone(), fork2[0].block_header.clone(), fork2[1].block_header.clone(), fork2[2].block_header.clone()]));

		let tasks = { executor.take_tasks() };
		assert_eq!(tasks, vec![request_block_headers_genesis_and(1, vec![fork1[1].hash(), fork1[0].hash(), common_block.hash()]),
			request_blocks(1, vec![common_block.hash(), fork1[0].hash(), fork1[1].hash()]),
			request_block_headers_genesis_and(2, vec![fork2[2].hash(), fork2[1].hash(), fork2[0].hash(), fork1[1].hash(), fork1[0].hash(), common_block.hash()]),
			request_blocks(2, vec![fork2[0].hash(), fork2[1].hash(), fork2[2].hash()]),
		]);

		// TODO: this will change from 3 to 4 after longest fork will be stored in the BestHeadersChain
		// however id doesn't affect sync process, as it is shown below
		{
			let mut core = core.lock(); let chain = core.chain();
			assert_eq!(chain.information().headers.best, 3);
			assert_eq!(chain.information().headers.total, 3);
		}

		sync.on_block(1, common_block.clone().into());
		sync.on_block(1, fork1[0].clone().into());
		sync.on_block(1, fork1[1].clone().into());
		sync.on_block(2, fork2[0].clone().into());
		sync.on_block(2, fork2[1].clone().into());
		sync.on_block(2, fork2[2].clone().into());

		{
			let mut core = core.lock(); let chain = core.chain();
			assert_eq!(chain.best_storage_block().hash, fork2[2].hash());
			assert_eq!(chain.best_storage_block().number, 4);
		}
	}

	#[test]
	fn accept_out_of_order_blocks_when_saturated() {
		let (_, core, sync) = create_sync(None, None);

		sync.on_block(1, test_data::block_h2().into());
		assert_eq!(core.lock().information().orphaned_blocks, 1);

		{
			let mut core = core.lock(); let chain = core.chain();
			assert_eq!(chain.best_storage_block().number, 0);
		}

		sync.on_block(1, test_data::block_h1().into());
		assert_eq!(core.lock().information().orphaned_blocks, 0);

		{
			let mut core = core.lock(); let chain = core.chain();
			assert_eq!(chain.best_storage_block().number, 2);
		}
	}

	#[test]
	fn do_not_rerequest_unknown_block_in_inventory() {
		let (executor, _, sync) = create_sync(None, None);

		sync.on_block(1, test_data::block_h2().into());
		sync.on_inventory(1, types::Inv::with_inventory(vec![
			InventoryVector::witness_block(test_data::block_h1().hash()),
			InventoryVector::witness_block(test_data::block_h2().hash()),
		]));

		let tasks = executor.take_tasks();
		assert_eq!(tasks, vec![Task::GetData(1, types::GetData::with_inventory(vec![
			InventoryVector::witness_block(test_data::block_h1().hash())
		]))]);
	}

	#[test]
	fn blocks_rerequested_on_peer_disconnect() {
		let (executor, _, sync) = create_sync(None, None);

		let block1: Block = test_data::block_h1();
		let block2: Block = test_data::block_h2();

		{
			// receive inventory from new peer#1
			sync.on_headers(1, types::Headers::with_headers(vec![block1.block_header.clone()]));
			// synchronization has started && new blocks have been requested
			let tasks = executor.take_tasks();
			assert_eq!(tasks, vec![
				request_block_headers_genesis_and(1, vec![block1.hash().clone()]),
				request_blocks(1, vec![block1.hash()])
			]);
		}

		{
			// receive inventory from new peer#2
			sync.on_headers(2, types::Headers::with_headers(vec![block1.block_header.clone(), block2.block_header.clone()]));
			// synchronization has started && new blocks have been requested
			let tasks = executor.take_tasks();
			assert_eq!(tasks, vec![
				request_block_headers_genesis_and(2, vec![block2.hash().clone(), block1.hash().clone()]),
				request_blocks(2, vec![block2.hash()])
			]);
		}

		{
			// peer#1 is disconnected && it has pending blocks requests => ask peer#2
			sync.on_disconnect(1);
			// blocks have been requested
			let tasks = executor.take_tasks();
			assert_eq!(tasks, vec![request_blocks(2, vec![block1.hash()])]);
		}
	}

	#[test]
	fn sync_after_db_insert_nonfatal_fail() {
		let block = test_data::block_h2();
		let storage = BlockChainDatabase::init_test_chain(vec![test_data::genesis().into()]);
		assert!(storage.insert(test_data::block_h2().into()).is_err());
		let best_genesis = storage.best_block();

		let (_, core, sync) = create_sync(Some(Arc::new(storage)), None);

		sync.on_block(1, block.into());

		let mut core = core.lock(); let chain = core.chain();
		assert_eq!(chain.best_block(), best_genesis);
	}

	#[test]
	fn peer_removed_from_sync_after_responding_with_requested_block_notfound() {
		let (executor, core, sync) = create_sync(None, None);

		let b1 = test_data::block_h1();
		let b2 = test_data::block_h2();
		sync.on_headers(1, types::Headers::with_headers(vec![b1.block_header.clone(), b2.block_header.clone()]));

		let tasks = executor.take_tasks();
		assert_eq!(tasks, vec![request_block_headers_genesis_and(1, vec![b2.hash().clone(), b1.hash().clone()]), request_blocks(1, vec![b1.hash(), b2.hash()])]);

		assert_eq!(core.lock().information().peers_tasks.idle, 0);
		assert_eq!(core.lock().information().peers_tasks.unuseful, 0);
		assert_eq!(core.lock().information().peers_tasks.active, 1);

		sync.on_notfound(1, types::NotFound::with_inventory(vec![InventoryVector::block(b1.hash())]));

		let tasks = executor.take_tasks();
		assert_eq!(tasks, vec![request_block_headers_genesis(1), Task::MemoryPool(1)]);

		assert_eq!(core.lock().information().peers_tasks.idle, 0);
		assert_eq!(core.lock().information().peers_tasks.unuseful, 1);
		assert_eq!(core.lock().information().peers_tasks.active, 0);
	}

	#[test]
	fn peer_not_removed_from_sync_after_responding_with_non_requested_block_notfound() {
		let (executor, core, sync) = create_sync(None, None);

		let b1 = test_data::block_h1();
		let b2 = test_data::block_h2();
		sync.on_headers(1, types::Headers::with_headers(vec![b1.block_header.clone(), b2.block_header.clone()]));

		let tasks = executor.take_tasks();
		assert_eq!(tasks, vec![request_block_headers_genesis_and(1, vec![b2.hash().clone(), b1.hash().clone()]), request_blocks(1, vec![b1.hash(), b2.hash()])]);

		assert_eq!(core.lock().information().peers_tasks.idle, 0);
		assert_eq!(core.lock().information().peers_tasks.unuseful, 0);
		assert_eq!(core.lock().information().peers_tasks.active, 1);

		sync.on_notfound(1, types::NotFound::with_inventory(vec![InventoryVector::block(test_data::block_h170().hash())]));

		let tasks = executor.take_tasks();
		assert_eq!(tasks, vec![]);

		assert_eq!(core.lock().information().peers_tasks.idle, 0);
		assert_eq!(core.lock().information().peers_tasks.unuseful, 0);
		assert_eq!(core.lock().information().peers_tasks.active, 1);
	}

	#[test]
	fn transaction_is_not_requested_when_synchronizing() {
		let (executor, core, sync) = create_sync(None, None);

		let b1 = test_data::block_h1();
		let b2 = test_data::block_h2();
		sync.on_headers(1, types::Headers::with_headers(vec![b1.block_header.clone(), b2.block_header.clone()]));

		assert!(core.lock().information().state.is_synchronizing());
		{ executor.take_tasks(); } // forget tasks

		sync.on_inventory(0, types::Inv::with_inventory(vec![InventoryVector::tx(H256::from(0))]));

		let tasks = executor.take_tasks();
		assert_eq!(tasks, vec![]);
	}

	#[test]
	fn transaction_is_requested_when_not_synchronizing() {
		let (executor, core, sync) = create_sync(None, None);

		sync.on_inventory(0, types::Inv::with_inventory(vec![InventoryVector::witness_tx(H256::from(0))]));

		{
			let tasks = executor.take_tasks();
			assert_eq!(tasks, vec![Task::GetData(0, types::GetData::with_inventory(vec![InventoryVector::witness_tx(H256::from(0))]))]);
		}

		let b1 = test_data::block_h1();
		sync.on_headers(1, types::Headers::with_headers(vec![b1.block_header.clone()]));

		assert!(core.lock().information().state.is_nearly_saturated());
		{ executor.take_tasks(); } // forget tasks

		sync.on_inventory(0, types::Inv::with_inventory(vec![InventoryVector::witness_tx(H256::from(1))]));

		let tasks = executor.take_tasks();
		assert_eq!(tasks, vec![Task::GetData(0, types::GetData::with_inventory(vec![InventoryVector::witness_tx(H256::from(1))]))]);
	}

	#[test]
	fn same_transaction_can_be_requested_twice() {
		let (executor, _, sync) = create_sync(None, None);

		sync.on_inventory(0, types::Inv::with_inventory(vec![InventoryVector::witness_tx(H256::from(0))]));

		let tasks = executor.take_tasks();
		assert_eq!(tasks, vec![Task::GetData(0, types::GetData::with_inventory(vec![
			InventoryVector::witness_tx(H256::from(0))
		]))]);

		sync.on_inventory(0, types::Inv::with_inventory(vec![InventoryVector::witness_tx(H256::from(0))]));

		let tasks = executor.take_tasks();
		assert_eq!(tasks, vec![Task::GetData(0, types::GetData::with_inventory(vec![
			InventoryVector::witness_tx(H256::from(0))
		]))]);
	}

	#[test]
	fn known_transaction_is_not_requested() {
		let (executor, _, sync) = create_sync(None, None);

		sync.on_inventory(0, types::Inv::with_inventory(vec![
			InventoryVector::witness_tx(test_data::genesis().transactions[0].hash()),
			InventoryVector::witness_tx(H256::from(0)),
		]));
		assert_eq!(executor.take_tasks(), vec![Task::GetData(0, types::GetData::with_inventory(vec![
			InventoryVector::witness_tx(H256::from(0))
		]))]);
	}

	#[test]
	fn transaction_is_not_accepted_when_synchronizing() {
		let (_, core, sync) = create_sync(None, None);

		let b1 = test_data::block_h1();
		let b2 = test_data::block_h2();
		sync.on_headers(1, types::Headers::with_headers(vec![b1.block_header.clone(), b2.block_header.clone()]));

		assert!(core.lock().information().state.is_synchronizing());

		sync.on_transaction(1, Transaction::default().into());

		assert_eq!(core.lock().information().chain.transactions.transactions_count, 0);
	}

	#[test]
	fn transaction_is_accepted_when_not_synchronizing() {
		let (_, core, sync) = create_sync(None, None);

		sync.on_transaction(1, test_data::TransactionBuilder::with_version(1).into());
		assert_eq!(core.lock().information().chain.transactions.transactions_count, 1);

		let b1 = test_data::block_h1();
		sync.on_headers(1, types::Headers::with_headers(vec![b1.block_header.clone()]));

		assert!(core.lock().information().state.is_nearly_saturated());

		sync.on_transaction(1, test_data::TransactionBuilder::with_version(2).into());
		assert_eq!(core.lock().information().chain.transactions.transactions_count, 2);
	}

	#[test]
	fn transaction_is_orphaned_when_input_is_unknown() {
		let (_, core, sync) = create_sync(None, None);

		sync.on_transaction(1, test_data::TransactionBuilder::with_default_input(0).into());
		assert_eq!(core.lock().information().chain.transactions.transactions_count, 0);
		assert_eq!(core.lock().information().orphaned_transactions, 1);
	}

	#[test]
	fn orphaned_transaction_is_verified_when_input_is_received() {
		let chain = &mut test_data::ChainBuilder::new();
		test_data::TransactionBuilder::with_output(10).store(chain)		// t0
			.set_input(&chain.at(0), 0).set_output(20).store(chain);	// t0 -> t1

		let (_, core, sync) = create_sync(None, None);

		sync.on_transaction(1, chain.at(1).into());
		assert_eq!(core.lock().information().chain.transactions.transactions_count, 0);
		assert_eq!(core.lock().information().orphaned_transactions, 1);

		sync.on_transaction(1, chain.at(0).into());
		assert_eq!(core.lock().information().chain.transactions.transactions_count, 2);
		assert_eq!(core.lock().information().orphaned_transactions, 0);
	}

	#[test]
	// https://github.com/ethcore/parity-bitcoin/issues/121
	fn when_previous_block_verification_failed_fork_is_not_requested() {
		// got headers [b10, b11, b12] - some fork
		// got headers [b10, b21, b22] - main branch
		// got b10, b11, b12, b21. b22 is requested
		//
		// verifying: [b10, b11, b12, b21]
		// headers_chain: [b10, b11, b12]
		//
		// b21 verification failed => b22 is not removed (since it is not in headers_chain)
		// got new headers [b10, b21, b22, b23] => intersection point is b10 => scheduling [b21, b22, b23]
		//
		// block queue is empty => new tasks => requesting [b21, b22] => panic in hash_queue
		//
		// => do not trust first intersection point - check each hash when scheduling hashes.
		// If at least one hash is known => previous verification failed => drop all headers.

		let genesis = test_data::genesis();
		let b10 = test_data::block_builder().header().parent(genesis.hash()).build().build();

		let b11 = test_data::block_builder().header().nonce(1).parent(b10.hash()).build().build();
		let b12 = test_data::block_builder().header().parent(b11.hash()).build().build();

		let b21 = test_data::block_builder().header().nonce(2).parent(b10.hash()).build().build();
		let b22 = test_data::block_builder().header().parent(b21.hash()).build().build();
		let b23 = test_data::block_builder().header().parent(b22.hash()).build().build();

		// simulate verification during b21 verification
		let mut dummy_verifier = DummyVerifier::default();
		dummy_verifier.error_when_verifying(b21.hash(), "simulated");

		let (_, _, sync) = create_sync(None, Some(dummy_verifier));

		sync.on_headers(1, types::Headers::with_headers(vec![b10.block_header.clone(), b11.block_header.clone(), b12.block_header.clone()]));
		sync.on_headers(2, types::Headers::with_headers(vec![b10.block_header.clone(), b21.block_header.clone(), b22.block_header.clone()]));

		sync.on_block(1, b10.clone().into());
		sync.on_block(1, b11.into());
		sync.on_block(1, b12.into());

		sync.on_block(2, b21.clone().into());

		// should not panic here
		sync.on_headers(2, types::Headers::with_headers(vec![b10.block_header.clone(), b21.block_header.clone(),
			b22.block_header.clone(), b23.block_header.clone()]));
	}

	#[test]
	fn relay_new_block_when_in_saturated_state() {
		let (executor, _, sync) = create_sync(None, None);
		let genesis = test_data::genesis();
		let b0 = test_data::block_builder().header().parent(genesis.hash()).build().build();
		let b1 = test_data::block_builder().header().parent(b0.hash()).build().build();
		let b2 = test_data::block_builder().header().parent(b1.hash()).build().build();
		let b3 = test_data::block_builder().header().parent(b2.hash()).build().build();

		sync.on_headers(1, types::Headers::with_headers(vec![b0.block_header.clone(), b1.block_header.clone()]));
		sync.on_block(1, b0.clone().into());
		sync.on_block(1, b1.clone().into());

		// we were in synchronization state => block is not relayed
		{

			let tasks = executor.take_tasks();
			assert_eq!(tasks, vec![
				request_block_headers_genesis_and(1, vec![b1.hash(), b0.hash()]),
				request_blocks(1, vec![b0.hash(), b1.hash()]),
				request_block_headers_genesis_and(1, vec![b1.hash(), b0.hash()]),
				Task::MemoryPool(1)
			]);
		}

		sync.on_block(2, b2.clone().into());

		// we were in saturated state => block is relayed
		{
			let tasks = executor.take_tasks();
			assert_eq!(tasks, vec![
				request_block_headers_genesis_and(2, vec![b2.hash(), b1.hash(), b0.hash()]),
				Task::RelayNewBlock(b2.clone().into())
			]);
		}

		sync.on_headers(1, types::Headers::with_headers(vec![b3.block_header.clone()]));
		sync.on_block(1, b3.clone().into());

		// we were in nearly saturated state => block is relayed
		{
			let tasks = executor.take_tasks();
			assert!(tasks.iter().any(|t| t == &Task::RelayNewBlock(b3.clone().into())));
		}
	}

	#[test]
	fn relay_new_transaction_when_in_saturated_state() {
		let (executor, _, sync) = create_sync(None, None);

		let tx: Transaction = test_data::TransactionBuilder::with_output(20).into();

		sync.on_connect(1);
		executor.take_tasks();

		sync.on_transaction(2, tx.clone().into());

		let tasks = executor.take_tasks();
		assert_eq!(tasks, vec![Task::RelayNewTransaction(tx.into(), 0)]);
	}

	#[test]
	fn receive_same_unknown_block_twice() {
		let (_, _, sync) = create_sync(None, None);

		sync.on_block(1, test_data::block_h2().into());
		// should not panic here
		sync.on_block(2, test_data::block_h2().into());
	}

	#[test]
	fn collection_closed_on_block_verification_error() {
		let genesis = test_data::genesis();
		let b0 = test_data::block_builder().header().parent(genesis.hash()).build().build();

		// simulate verification error during b0 verification
		let mut dummy_verifier = DummyVerifier::default();
		dummy_verifier.error_when_verifying(b0.hash(), "simulated");

		let (_, core, sync) = create_sync(None, Some(dummy_verifier));

		core.lock().peers.insert(0, Services::default(), DummyOutboundSyncConnection::new());
		assert!(core.lock().peers.enumerate().contains(&0));

		sync.on_block(0, b0.into());

		assert!(!core.lock().peers.enumerate().contains(&0));
	}

	#[test]
	fn collection_closed_on_begin_dead_end_block_header() {
		let genesis = test_data::genesis();
		let b0 = test_data::block_builder().header().parent(genesis.hash()).build().build();
		let b1 = test_data::block_builder().header().parent(b0.hash()).build().build();
		let b2 = test_data::block_builder().header().parent(b1.hash()).build().build();

		let (_, core, sync) = create_sync(None, None);
		{
			let mut core = core.lock(); let chain = core.chain();
			chain.mark_dead_end_block(&b0.hash());
		}

		core.lock().peers.insert(0, Services::default(), DummyOutboundSyncConnection::new());
		assert!(core.lock().peers.enumerate().contains(&0));

		sync.on_headers(0, types::Headers::with_headers(vec![b0.block_header.clone(), b1.block_header.clone(), b2.block_header.clone()]));

		assert!(!core.lock().peers.enumerate().contains(&0));
	}

	#[test]
	fn collection_closed_on_in_middle_dead_end_block_header() {
		let genesis = test_data::genesis();
		let b0 = test_data::block_builder().header().parent(genesis.hash()).build().build();
		let b1 = test_data::block_builder().header().parent(b0.hash()).build().build();
		let b2 = test_data::block_builder().header().parent(b1.hash()).build().build();

		let (_, core, sync) = create_sync(None, None);
		{
			let mut core = core.lock(); let chain = core.chain();
			chain.mark_dead_end_block(&b1.hash());
		}

		core.lock().set_verify_headers(true);
		core.lock().peers.insert(0, Services::default(), DummyOutboundSyncConnection::new());
		assert!(core.lock().peers.enumerate().contains(&0));

		sync.on_headers(0, types::Headers::with_headers(vec![b0.block_header.clone(), b1.block_header.clone(), b2.block_header.clone()]));

		assert!(!core.lock().peers.enumerate().contains(&0));
	}

	#[test]
	fn collection_closed_on_providing_dead_end_block() {
		let genesis = test_data::genesis();
		let b0 = test_data::block_builder().header().parent(genesis.hash()).build().build();

		let (_, core, sync) = create_sync(None, None);
		{
			let mut core = core.lock(); let chain = core.chain();
			chain.mark_dead_end_block(&b0.hash());
		}

		core.lock().peers.insert(0, Services::default(), DummyOutboundSyncConnection::new());
		assert!(core.lock().peers.enumerate().contains(&0));

		sync.on_block(0, b0.into());

		assert!(!core.lock().peers.enumerate().contains(&0));
	}

	#[test]
	fn collection_closed_on_providing_child_dead_end_block() {
		let genesis = test_data::genesis();
		let b0 = test_data::block_builder().header().parent(genesis.hash()).build().build();
		let b1 = test_data::block_builder().header().parent(b0.hash()).build().build();

		let (_, core, sync) = create_sync(None, None);
		{
			let mut core = core.lock(); let chain = core.chain();
			chain.mark_dead_end_block(&b0.hash());
		}

		core.lock().peers.insert(0, Services::default(), DummyOutboundSyncConnection::new());
		assert!(core.lock().peers.enumerate().contains(&0));

		sync.on_block(0, b1.into());

		assert!(!core.lock().peers.enumerate().contains(&0));
	}

	#[test]
	fn when_peer_does_not_respond_to_block_requests() {
		let genesis = test_data::genesis();
		let b0 = test_data::block_builder().header().parent(genesis.hash()).build().build(); // block we will stuck with
		let b1 = test_data::block_builder().header().parent(genesis.hash()).build().build(); // another branch
		let b2 = test_data::block_builder().header().parent(b1.hash()).build().build();

		let (executor, core, sync) = create_sync(None, None);

		// when peer1 announces 'false' b0
		sync.on_headers(1, types::Headers::with_headers(vec![b0.block_header.clone()]));
		// and peer2 announces 'true' b1
		sync.on_headers(2, types::Headers::with_headers(vec![b1.block_header.clone(), b2.block_header.clone()]));

		// check that all blocks are requested
		assert_eq!(core.lock().information().chain.requested, 3);

		// forget tasks
		{ executor.take_tasks(); }

		// and then peer2 responds with with b1 while b0 is still left in queue
		sync.on_block(2, b1.into());

		// now simulate some time has passed && number of b0 failures is @max level
		{
			let mut core = core.lock();
			core.forget_failed_blocks(&vec![b0.hash()]);
			core.execute_synchronization_tasks(None, Some(vec![b0.hash()]));
		}

		// check that only one block (b2) is requested
		assert_eq!(core.lock().information().chain.requested, 1);
	}

	#[test]
	fn when_got_same_orphan_transaction_twice() {
		let (_, core, sync) = create_sync(None, None);

		sync.on_transaction(1, test_data::TransactionBuilder::with_default_input(0).into());
		assert_eq!(core.lock().information().chain.transactions.transactions_count, 0);
		assert_eq!(core.lock().information().orphaned_transactions, 1);

		// should not panic
		sync.on_transaction(1, test_data::TransactionBuilder::with_default_input(0).into());
	}

	#[test]
	fn when_transaction_replaces_locked_transaction() {
		// TODO
	}

	#[test]
	fn when_transaction_double_spends_during_reorg() {
		let b0 = test_data::block_builder().header().build()
			.transaction().coinbase()
				.output().value(10).build()
				.build()
			.transaction()
				.output().value(20).build()
				.build()
			.transaction()
				.output().value(30).build()
				.build()
			.transaction()
				.output().value(40).build()
				.build()
			.transaction()
				.output().value(50).build()
				.build()
			.build();

		// in-storage spends b0[1] && b0[2]
		let b1 = test_data::block_builder()
			.transaction().coinbase()
				.output().value(50).build()
				.build()
			.transaction().version(10)
				.input().hash(b0.transactions[1].hash()).index(0).build()
				.output().value(10).build()
				.build()
			.transaction().version(40)
				.input().hash(b0.transactions[2].hash()).index(0).build()
				.output().value(10).build()
				.build()
			.merkled_header().parent(b0.hash()).build()
			.build();
		// in-memory spends b0[3]
		// in-memory spends b0[4]
		let future_block = test_data::block_builder().header().parent(b1.hash()).build()
			.transaction().version(40)
				.input().hash(b0.transactions[3].hash()).index(0).build()
				.output().value(10).build()
				.build()
			.transaction().version(50)
				.input().hash(b0.transactions[4].hash()).index(0).build()
				.output().value(10).build()
				.build()
			.build();
		let tx2: Transaction = future_block.transactions[0].clone();
		let tx3: Transaction = future_block.transactions[1].clone();

		// in-storage [side] spends b0[3]
		let b2 = test_data::block_builder().header().parent(b0.hash()).build()
			.transaction().coinbase()
				.output().value(5555).build()
				.build()
			.transaction().version(20)
				.input().hash(b0.transactions[3].hash()).index(0).build()
				.build()
			.merkled_header().parent(b0.hash()).build()
			.build();
		// in-storage [causes reorg to b2 + b3] spends b0[1]
		let b3 = test_data::block_builder()
			.transaction().coinbase().version(40)
				.output().value(50).build()
				.build()
			.transaction().version(30)
				.input().hash(b0.transactions[1].hash()).index(0).build()
				.output().value(10).build()
				.build()
			.merkled_header().parent(b2.hash()).build()
			.build();

		let mut dummy_verifier = DummyVerifier::default();
		dummy_verifier.actual_check_when_verifying(b3.hash());

		let storage = Arc::new(BlockChainDatabase::init_test_chain(vec![b0.into()]));

		let (_, core, sync) = create_sync(Some(storage), Some(dummy_verifier));
		sync.on_block(0, b1.clone().into());
		sync.on_transaction(0, tx2.clone().into());
		sync.on_transaction(0, tx3.clone().into());
		assert_eq!(core.lock().information().chain.stored, 2); // b0 + b1
		assert_eq!(core.lock().information().chain.transactions.transactions_count, 2); // tx2 + tx3

		// insert b2, which will make tx2 invalid, but not yet
		sync.on_block(0, b2.clone().into());
		assert_eq!(core.lock().information().chain.stored, 2); // b0 + b1
		assert_eq!(core.lock().information().chain.transactions.transactions_count, 2); // tx2 + tx3

		// insert b3 => best chain is b0 + b2 + b3
		// + transaction from b0 is reverified => ok
		// + tx2 will be reverified => fail
		// + tx3 will be reverified => ok
		sync.on_block(0, b3.clone().into());
		assert_eq!(core.lock().information().chain.stored, 3); // b0 + b2 + b3
		assert_eq!(core.lock().information().chain.transactions.transactions_count, 2); // b1[0] + tx3

		let mempool = core.lock().chain().memory_pool();
		assert!(mempool.write().remove_by_hash(&b1.transactions[2].hash()).is_some());
		assert!(mempool.write().remove_by_hash(&tx3.hash()).is_some());
	}

	#[test]
	fn sync_listener_calls() {
		let (_, _, sync) = create_sync(None, None);

		// install sync listener
		let data = Arc::new(Mutex::new(DummySyncListenerData::default()));
		sync.install_sync_listener(Box::new(DummySyncListener::new(data.clone())));

		// at the beginning, is_synchronizing must be equal to false
		assert_eq!(data.lock().is_synchronizing, false);
		assert_eq!(data.lock().best_blocks.len(), 0);

		// supply with new block header => is_synchronizing is still false
		sync.on_headers(0, types::Headers::with_headers(vec![test_data::block_h1().block_header]));
		assert_eq!(data.lock().is_synchronizing, false);
		assert_eq!(data.lock().best_blocks.len(), 0);

		// supply with 2 new blocks headers => is_synchronizing is true
		sync.on_headers(0, types::Headers::with_headers(vec![test_data::block_h2().block_header, test_data::block_h3().block_header]));
		assert_eq!(data.lock().is_synchronizing, true);
		assert_eq!(data.lock().best_blocks.len(), 0);

		// supply with block 3 => no new best block is informed
		sync.on_block(0, test_data::block_h3().into());
		assert_eq!(data.lock().is_synchronizing, true);
		assert_eq!(data.lock().best_blocks.len(), 0);

		// supply with block 1 => new best block is informed
		sync.on_block(0, test_data::block_h1().into());
		assert_eq!(data.lock().is_synchronizing, true);
		assert_eq!(data.lock().best_blocks.len(), 1);

		// supply with block 2 => 2 new best block is informed
		sync.on_block(0, test_data::block_h2().into());
		assert_eq!(data.lock().is_synchronizing, false);
		assert_eq!(data.lock().best_blocks.len(), 3);
	}
}