summaryrefslogtreecommitdiff
path: root/src/crypto
Commit message (Collapse)AuthorAgeFilesLines
* Fix arm asmHoward Chu2016-01-111-23/+63
| | | | About 10% faster than plain C mul128 on raspi1B
* updated copyright yearRiccardo Spagni2015-12-3130-30/+30
|
* Replace tabs with two spaces for consistency with rest of codebasewarptangent2015-12-152-161/+161
| | | | Remove trailing whitespace in same files.
* renamed folderRiccardo Spagni2015-10-26174-4830/+0
|
* Re-enable optimized slow-hash if someone is trying to compile w/MSVC ↵Javier Smooth2015-08-261-1/+1
| | | | (disabling it was unintentional)
* Merge pull request #385Riccardo Spagni2015-08-24174-0/+23117
|\ | | | | | | | | | | 0a4bc84 Added ref10 shen_ed25519_ref code, which includes code that can replace crypto-ops with a version straight from Bernstein's ref 10 (ShenNoether) 0d70fdc revert to 776b4fc91a821be152f0f23e6873aabb78a72029 (ShenNoether) b01f286 Added shen_ed25519_ref to crypto ops subfolder, the point is to directly have bitmonero's crypto code come from bernstein et al's ref 10 code (ShenNoether)
| * Added ref10 shen_ed25519_ref code, which includes code that can replace ↵ShenNoether2015-08-23174-0/+23117
| | | | | | | | crypto-ops with a version straight from Bernstein's ref 10
| * revert to 776b4fc91a821be152f0f23e6873aabb78a72029ShenNoether2015-08-231-0/+0
| |
| * Added shen_ed25519_ref to crypto ops subfolder, the point is to directly ↵ShenNoether2015-08-231-0/+0
| | | | | | | | have bitmonero's crypto code come from bernstein et al's ref 10 code
* | Merge pull request #383Riccardo Spagni2015-08-242-3/+2
|\ \ | | | | | | | | | | | | 3b5330e use correct unsigned type (roman) 59cc92b removed some gcc warnings. mainly unused variables. (roman)
| * | use correct unsigned typeroman2015-08-231-1/+2
| | |
| * | removed some gcc warnings. mainly unused variables.roman2015-08-232-3/+1
| |/
* / chacha8: add a key generation variant that take a pointer and sizemoneromooo-monero2015-08-221-2/+6
|/
* encrypted payment ids are now 64 bit, instead of 256 bitmoneromooo-monero2015-08-091-0/+5
| | | | | | | | | | | | | | Pros: - smaller on the blockchain - shorter integrated addresses Cons: - less sparseness - less ability to embed actual information The boolean argument to encrypt payment ids is now gone from the RPC calls, since the decision is made based on the length of the payment id passed.
* ** CHANGES ARE EXPERIMENTAL (FOR TESTING ONLY)NoodleDoodleNoodleDoodleNoodleDoodleNoo2015-07-152-2/+200
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 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).
* disable non-working optimized slow_hash on 32 bit intelJavier Smooth2015-04-131-1/+1
|
* no newline at end of fileRiccardo Spagni2015-04-051-1/+1
|
* make fallback compatible with newer slow-hashRiccardo Spagni2015-01-281-0/+12
|
* added portable slow-hash, updated makefile targets, fixed readmeRiccardo Spagni2015-01-271-2/+152
|
* fixed sse2 ifdefRiccardo Spagni2015-01-271-2/+2
|
* remove aes flag, detect no sse2Riccardo Spagni2015-01-271-0/+2
|
* year updated in licenseRiccardo Spagni2015-01-0226-26/+26
|
* cmake: handle private vs. public headersBen Boeckel2014-10-231-2/+7
|
* cmake: refactor common code with librariesBen Boeckel2014-10-231-9/+1
|
* cmake: put each library into its own directoryBen Boeckel2014-10-231-0/+79
| | | | | This cleans up the CMake code and shows patterns more easily (to be refactored in the next commit).
* capitalize Keccak everywhereDavid G. Andersen2014-10-061-1/+1
|
* typo fix - cryptonight, not cryptonoteDavid G. Andersen2014-10-061-1/+1
|
* Fix comment start for two functionsDavid G. Andersen2014-10-061-2/+2
|
* another typo fixDavid G. Andersen2014-10-051-1/+1
|
* fix typoDavid G. Andersen2014-10-051-1/+1
|
* More documentationDavid G. Andersen2014-10-051-10/+63
|
* initial doxygen commenting of the CryptoNight proof-of-work codeDavid G. Andersen2014-10-051-1/+85
|
* Merge with origin/masterOran Juice2014-09-281-4/+12
|\
| * More preprocessor fixes for slow-hashZachary Michaels2014-09-151-3/+3
| |
| * Correct includes for mingw in slow-hashZachary Michaels2014-09-151-0/+8
| | | | | | | | This needs testing
| * Change Windows include to windowsZachary Michaels2014-09-151-1/+1
| | | | | | | | mingw is case sensitive
* | Moved mnemonics code to src/mnemonicsOran Juice2014-09-232-3446/+0
|/
* mmap on FreeBSD doesn't have MAP_HUGETLBfluffypony2014-09-101-1/+1
|
* Include sys/time.h on BSDfluffypony2014-09-101-0/+2
|
* replace ftime with gettimeofday on FreeBSD because lcompat is stupidfluffypony2014-09-101-0/+28
|
* more FreeBSD fixesfluffypony2014-09-091-2/+7
|
* malloc.h reference fixed for FreeBSDfluffypony2014-09-091-2/+2
|
* FreeBSD alloca.h reference fixedfluffypony2014-09-092-2/+12
|
* Fix tree-hash cnt n^2. Asserts, comment. Squash2rfree2monero2014-09-061-6/+48
|
* fixed OS X malloc.h referencefluffypony2014-09-021-1/+4
|
* License updated to BSD 3-clausefluffypony2014-07-2326-57/+750
|
* Remove unused array in cn_slow_hashZachary Michaels2014-07-011-1/+0
|
* Update slow-hash.cNoodleDoodleNoodleDoodleNoodleDoodleNoo2014-06-191-0/+5
| | | 1. Fix for Mac OSX compilation errors.
* Update slow-hash.cNoodleDoodleNoodleDoodleNoodleDoodleNoo2014-06-161-1/+8
| | | 1. Added multiplication support in 32-bit mode
* Update slow-hash.cNoodleDoodleNoodleDoodleNoodleDoodleNoo2014-06-161-110/+288
| | | | | 1. Added huge pages support and optimized scratchpad twiddling. (credits to dga). 2. Added aes-ni key expansion support. 3. Minor speedup to scratchpad initialization/finalization.