kevacoin/doc/release-notes.md

(note: this is a temporary file, to be added-to by anybody, and moved to
release-notes at release time)

Notable changes
===============

Example item
----------------


0.13.0 Change log
=================

Detailed release notes follow. This overview includes changes that affect
behavior, not code moves, refactors and string updates. For convenience in locating
the code changes and accompanying discussion, both the pull request and
git merge commit are mentioned.

### RPC and REST

### Configuration and command-line options

### Block and transaction handling

### P2P protocol and network code

### Validation

### Build system

### Wallet

### GUI

### Tests

### Miscellaneous
doc: Empty release notes for next release Now that 0.9 is branched off, the new release notes for 0.10 or 0.11 or 1.0 should be added here. Edits to preliminary 0.9.0 release notes should be made in the 0.9.0 branch. 11 years ago			`(note: this is a temporary file, to be added-to by anybody, and moved to`
			`release-notes at release time)`
estimatefee / estimatepriority RPC methods New RPC methods: return an estimate of the fee (or priority) a transaction needs to be likely to confirm in a given number of blocks. Mike Hearn created the first version of this method for estimating fees. It works as follows: For transactions that took 1 to N (I picked N=25) blocks to confirm, keep N buckets with at most 100 entries in each recording the fees-per-kilobyte paid by those transactions. (separate buckets are kept for transactions that confirmed because they are high-priority) The buckets are filled as blocks are found, and are saved/restored in a new fee_estiamtes.dat file in the data directory. A few variations on Mike's initial scheme: To estimate the fee needed for a transaction to confirm in X buckets, all of the samples in all of the buckets are used and a median of all of the data is used to make the estimate. For example, imagine 25 buckets each containing the full 100 entries. Those 2,500 samples are sorted, and the estimate of the fee needed to confirm in the very next block is the 50'th-highest-fee-entry in that sorted list; the estimate of the fee needed to confirm in the next two blocks is the 150'th-highest-fee-entry, etc. That algorithm has the nice property that estimates of how much fee you need to pay to get confirmed in block N will always be greater than or equal to the estimate for block N+1. It would clearly be wrong to say "pay 11 uBTC and you'll get confirmed in 3 blocks, but pay 12 uBTC and it will take LONGER". A single block will not contribute more than 10 entries to any one bucket, so a single miner and a large block cannot overwhelm the estimates. 11 years ago
Autoprune release notes included 10 years ago			`Notable changes`
			`===============`

Now that 0.12 has been branched, master is 0.12.99 ... in preparation for 0.13 9 years ago			`Example item`
			`----------------`
doc: mention SSL support dropped for RPC in release notes 9 years ago

Now that 0.12 has been branched, master is 0.12.99 ... in preparation for 0.13 9 years ago			`0.13.0 Change log`
doc: Add preliminary changelog for 0.11 to release notes 10 years ago			`=================`

			`Detailed release notes follow. This overview includes changes that affect`
doc: Add to 0.11 release notes Add information about further notable changes: - Big endian support - Memory usage optimization - Disable wallet transaction broadcast - Stream isolation for Tor 10 years ago			`behavior, not code moves, refactors and string updates. For convenience in locating`
			`the code changes and accompanying discussion, both the pull request and`
			`git merge commit are mentioned.`
doc: Add preliminary changelog for 0.11 to release notes 10 years ago
			`### RPC and REST`

			`### Configuration and command-line options`

			`### Block and transaction handling`

			`### P2P protocol and network code`

			`### Validation`

			`### Build system`

			`### Wallet`

			`### GUI`

			`### Tests`

			`### Miscellaneous`