mirror of
https://github.com/monero-project/monero.git
synced 2025-11-28 10:40:42 -05:00
59a66e209a
Since these are needed at the same time as the output pubkeys, this is a whole lot faster, and takes less space. Only outputs of 0 amount store the commitment. When reading other outputs, a fake commitment is regenerated on the fly. This avoids having to rewrite the database to add space for fake commitments for existing outputs. This code relies on two things: - LMDB must support fixed size records per key, rather than per database (ie, all records on key 0 are the same size, all records for non 0 keys are same size, but records from key 0 and non 0 keys do have different sizes). - the commitment must be directly after the rest of the data in outkey and output_data_t. |
||
|---|---|---|
| .. | ||
| address_from_url.cpp | ||
| ban.cpp | ||
| base58.cpp | ||
| block_reward.cpp | ||
| blockchain_db.cpp | ||
| canonical_amounts.cpp | ||
| chacha8.cpp | ||
| checkpoints.cpp | ||
| CMakeLists.txt | ||
| decompose_amount_into_digits.cpp | ||
| dns_resolver.cpp | ||
| epee_boosted_tcp_server.cpp | ||
| epee_levin_protocol_handler_async.cpp | ||
| get_xtype_from_string.cpp | ||
| hardfork.cpp | ||
| main.cpp | ||
| mnemonics.cpp | ||
| mul_div.cpp | ||
| parse_amount.cpp | ||
| ringct.cpp | ||
| serialization.cpp | ||
| slow_memmem.cpp | ||
| test_format_utils.cpp | ||
| test_peerlist.cpp | ||
| test_protocol_pack.cpp | ||
| unbound.cpp | ||
| unit_tests_utils.h | ||
| varint.cpp | ||