aboutsummaryrefslogtreecommitdiff
path: root/src/blocks (follow)
AgeCommit message (Collapse)AuthorFilesLines
2022-07-13build: prepare v0.18.0.0selsta1-0/+0
2022-03-04Copyright: Update to 2022mj-xmr1-1/+1
2021-07-28blocks: fix cmake syntaxselsta1-1/+1
2021-04-28cmake: fix non portable codeselsta1-9/+21
2020-10-28Add RELINK_TARGETS, monero_add_target_no_relink and use ↵mj-xmr1-1/+1
monero_add_executable/monero_add_library where possible (mj-xmr) Add monero_add_minimal_executable and use in tests This is done in order not to have to relink targets, when just an .so changed, but not its interface.
2020-09-14build: prepare v0.17selsta1-0/+0
2020-07-19Merge pull request #6512Alexander Blair1-1/+1
5ef0607da Update copyright year to 2020 (SomaticFanatic)
2020-05-13build: prepare v0.16.0.0 releaseselsta1-0/+0
2020-05-06Update copyright year to 2020SomaticFanatic1-1/+1
Update copyright year to 2020
2019-11-020.15.0.0 release engineeringRiccardo Spagni1-0/+0
2019-09-27monerod can now sync from pruned blocksmoneromooo-monero1-0/+0
If the peer (whether pruned or not itself) supports sending pruned blocks to syncing nodes, the pruned version will be sent along with the hash of the pruned data and the block weight. The original tx hashes can be reconstructed from the pruned txes and theur prunable data hash. Those hashes and the block weights are hashes and checked against the set of precompiled hashes, ensuring the data we received is the original data. It is currently not possible to use this system when not using the set of precompiled hashes, since block weights can not otherwise be checked for validity. This is off by default for now, and is enabled by --sync-pruned-blocks
2019-07-17prep for 0.14.1.1Riccardo Spagni1-0/+0
2019-06-14prep for 0.14.1 releaseRiccardo Spagni1-0/+0
2019-03-17Merge pull request #5061Riccardo Spagni1-1/+1
1f2930ce Update 2019 copyright (binaryFate)
2019-03-05Update 2019 copyrightbinaryFate1-1/+1
2019-03-05update checkpoints hashRiccardo Spagni1-0/+0
2018-12-25blocks: fix checkpoint code generation on OpenBSDmoneromooo-monero1-1/+1
Its od outputs small decimals with leading 0, which means octal in C
2018-10-22blocks: use auto-generated .c files instead of 'LD -r -b binary'xiphon5-112/+55
2018-10-08Revert "Merge pull request #4472"Riccardo Spagni5-55/+112
This reverts commit 79d46c4d551a9b1261801960095bf4d24967211a, reversing changes made to c9fc61dbb56cca442c775faa2554a7460879b637.
2018-10-04blocks: use auto-generated .c files instead of 'LD -r -b binary'xiphon5-112/+55
2018-09-29Fix 32bit depends buildsTheCharlatan1-3/+9
Add architecture flags when cmake invokes gcc manually. Add 32bit to Travis.
2018-09-23update checkpoints.datRiccardo Spagni1-0/+0
2018-06-02update checkpoints.dat for point releaseRiccardo Spagni1-0/+0
2018-05-23update checkpointsRiccardo Spagni1-0/+0
2018-03-18update checkpoints.dat to block 1532400Riccardo Spagni1-0/+0
2018-03-05Stagenetstoffu4-7/+22
2018-01-26Update 2018 copyrightxmr-eric1-1/+1
2017-12-31Add misc hardening flags to the cmake machinerymoneromooo-monero1-2/+2
See https://wiki.debian.org/Hardening#User_Space
2017-09-18precomputed block hashes are now in blocks of N (currently 256)moneromooo-monero1-0/+0
This shaves a lot of space off binaries
2017-09-06update checkpoints.datRiccardo Spagni1-0/+0
2017-03-04Add dependency for blocksdat.oHoward Chu1-2/+2
To make sure it gets regenerated whenever checkpoints.dat changes Likewise for blocks.o and testnet_blocks.o
2017-02-22fix broken checkpoints.datRiccardo Spagni1-0/+0
2017-02-21update checkpoints.datRiccardo Spagni1-0/+0
2017-02-21update copyright year, fix occasional lack of newline at line endRiccardo Spagni2-1/+1
2017-02-08extract some basic code from libcryptonote_core into libcryptonote_basickenshi841-1/+8
2016-12-13update checkpointsRiccardo Spagni1-0/+0
2016-09-18update block headersRiccardo Spagni1-0/+0
2016-03-16baked-in block headers now go all the way up to 1 million. 1 MILLIONRiccardo Spagni1-0/+0
2016-03-12switch default utilities DB to lmdb, update checkpoints.datRiccardo Spagni1-0/+0
2016-01-03Use CMAKE_LINKER, not hardcoded "ld"Howard Chu1-2/+2
2015-12-31updated copyright yearRiccardo Spagni2-1/+1
2015-12-15Replace tabs with two spaces for consistency with rest of codebasewarptangent1-8/+8
Remove trailing whitespace in same files.
2015-11-21checkpoints updateRiccardo Spagni1-0/+0
2015-10-17blockchain_export can now export to a blocks.dat formatmoneromooo-monero4-13/+31
Also make the number of blocks endian independant, and add support for testnet
2015-07-15Fixed binary size issue due to embedded checkpoint data.NoodleDoodleNoodleDoodleNoodleDoodleNoo3-0/+1
Fixed OSX compilation issues due to random lmdb resize points. Fixed infinite loop bug when calling core::get_block_template(..).
2015-07-15** CHANGES ARE EXPERIMENTAL (FOR TESTING ONLY)NoodleDoodleNoodleDoodleNoodleDoodleNoo4-0/+101
Bockchain: 1. Optim: Multi-thread long-hash computation when encountering groups of blocks. 2. Optim: Cache verified txs and return result from cache instead of re-checking whenever possible. 3. Optim: Preload output-keys when encoutering groups of blocks. Sort by amount and global-index before bulk querying database and multi-thread when possible. 4. Optim: Disable double spend check on block verification, double spend is already detected when trying to add blocks. 5. Optim: Multi-thread signature computation whenever possible. 6. Patch: Disable locking (recursive mutex) on called functions from check_tx_inputs which causes slowdowns (only seems to happen on ubuntu/VMs??? Reason: TBD) 7. Optim: Removed looped full-tx hash computation when retrieving transactions from pool (???). 8. Optim: Cache difficulty/timestamps (735 blocks) for next-difficulty calculations so that only 2 db reads per new block is needed when a new block arrives (instead of 1470 reads). Berkeley-DB: 1. Fix: 32-bit data errors causing wrong output global indices and failure to send blocks to peers (etc). 2. Fix: Unable to pop blocks on reorganize due to transaction errors. 3. Patch: Large number of transaction aborts when running multi-threaded bulk queries. 4. Patch: Insufficient locks error when running full sync. 5. Patch: Incorrect db stats when returning from an immediate exit from "pop block" operation. 6. Optim: Add bulk queries to get output global indices. 7. Optim: Modified output_keys table to store public_key+unlock_time+height for single transaction lookup (vs 3) 8. Optim: Used output_keys table retrieve public_keys instead of going through output_amounts->output_txs+output_indices->txs->output:public_key 9. Optim: Added thread-safe buffers used when multi-threading bulk queries. 10. Optim: Added support for nosync/write_nosync options for improved performance (*see --db-sync-mode option for details) 11. Mod: Added checkpoint thread and auto-remove-logs option. 12. *Now usable on 32-bit systems like RPI2. LMDB: 1. Optim: Added custom comparison for 256-bit key tables (minor speed-up, TBD: get actual effect) 2. Optim: Modified output_keys table to store public_key+unlock_time+height for single transaction lookup (vs 3) 3. Optim: Used output_keys table retrieve public_keys instead of going through output_amounts->output_txs+output_indices->txs->output:public_key 4. Optim: Added support for sync/writemap options for improved performance (*see --db-sync-mode option for details) 5. Mod: Auto resize to +1GB instead of multiplier x1.5 ETC: 1. Minor optimizations for slow-hash for ARM (RPI2). Incomplete. 2. Fix: 32-bit saturation bug when computing next difficulty on large blocks. [PENDING ISSUES] 1. Berkely db has a very slow "pop-block" operation. This is very noticeable on the RPI2 as it sometimes takes > 10 MINUTES to pop a block during reorganization. This does not happen very often however, most reorgs seem to take a few seconds but it possibly depends on the number of outputs present. TBD. 2. Berkeley db, possible bug "unable to allocate memory". TBD. [NEW OPTIONS] (*Currently all enabled for testing purposes) 1. --fast-block-sync arg=[0:1] (default: 1) a. 0 = Compute long hash per block (may take a while depending on CPU) b. 1 = Skip long-hash and verify blocks based on embedded known good block hashes (faster, minimal CPU dependence) 2. --db-sync-mode arg=[[safe|fast|fastest]:[sync|async]:[nblocks_per_sync]] (default: fastest:async:1000) a. safe = fdatasync/fsync (or equivalent) per stored block. Very slow, but safest option to protect against power-out/crash conditions. b. fast/fastest = Enables asynchronous fdatasync/fsync (or equivalent). Useful for battery operated devices or STABLE systems with UPS and/or systems with battery backed write cache/solid state cache. Fast - Write meta-data but defer data flush. Fastest - Defer meta-data and data flush. Sync - Flush data after nblocks_per_sync and wait. Async - Flush data after nblocks_per_sync but do not wait for the operation to finish. 3. --prep-blocks-threads arg=[n] (default: 4 or system max threads, whichever is lower) Max number of threads to use when computing long-hash in groups. 4. --show-time-stats arg=[0:1] (default: 1) Show benchmark related time stats. 5. --db-auto-remove-logs arg=[0:1] (default: 1) For berkeley-db only. Auto remove logs if enabled. **Note: lmdb and berkeley-db have changes to the tables and are not compatible with official git head version. At the moment, you need a full resync to use this optimized version. [PERFORMANCE COMPARISON] **Some figures are approximations only. Using a baseline machine of an i7-2600K+SSD+(with full pow computation): 1. The optimized lmdb/blockhain core can process blocks up to 585K for ~1.25 hours + download time, so it usually takes 2.5 hours to sync the full chain. 2. The current head with memory can process blocks up to 585K for ~4.2 hours + download time, so it usually takes 5.5 hours to sync the full chain. 3. The current head with lmdb can process blocks up to 585K for ~32 hours + download time and usually takes 36 hours to sync the full chain. Averate procesing times (with full pow computation): lmdb-optimized: 1. tx_ave = 2.5 ms / tx 2. block_ave = 5.87 ms / block memory-official-repo: 1. tx_ave = 8.85 ms / tx 2. block_ave = 19.68 ms / block lmdb-official-repo (0f4a036437fd41a5498ee5e74e2422ea6177aa3e) 1. tx_ave = 47.8 ms / tx 2. block_ave = 64.2 ms / block **Note: The following data denotes processing times only (does not include p2p download time) lmdb-optimized processing times (with full pow computation): 1. Desktop, Quad-core / 8-threads 2600k (8Mb) - 1.25 hours processing time (--db-sync-mode=fastest:async:1000). 2. Laptop, Dual-core / 4-threads U4200 (3Mb) - 4.90 hours processing time (--db-sync-mode=fastest:async:1000). 3. Embedded, Quad-core / 4-threads Z3735F (2x1Mb) - 12.0 hours processing time (--db-sync-mode=fastest:async:1000). lmdb-optimized processing times (with per-block-checkpoint) 1. Desktop, Quad-core / 8-threads 2600k (8Mb) - 10 minutes processing time (--db-sync-mode=fastest:async:1000). berkeley-db optimized processing times (with full pow computation) 1. Desktop, Quad-core / 8-threads 2600k (8Mb) - 1.8 hours processing time (--db-sync-mode=fastest:async:1000). 2. RPI2. Improved from estimated 3 months(???) into 2.5 days (*Need 2AMP supply + Clock:1Ghz + [usb+ssd] to achieve this speed) (--db-sync-mode=fastest:async:1000). berkeley-db optimized processing times (with per-block-checkpoint) 1. RPI2. 12-15 hours (*Need 2AMP supply + Clock:1Ghz + [usb+ssd] to achieve this speed) (--db-sync-mode=fastest:async:1000).
generated by cgit v1.2.3 (git 2.25.1) at 2024-12-26 17:35:59 +0000