Page MenuHomePhabricator

[WIP] Use mempool for fee estimates, not blocks.
Needs ReviewPublic

Authored by schancel on Mon, Dec 3, 07:01.

Details

Reviewers
deadalnix
Group Reviewers
Restricted Project
Summary

Implement a class that returns the median of the feerates in the mempool
currently. Complexity should be O(nlogn) for inserts and constant time for
obtaining the median.

Depends on D2172

Test Plan
make check

Diff Detail

Repository
rABC Bitcoin ABC
Branch
fee-estimation (branched from master)
Lint
Lint OK
Unit
No Unit Test Coverage
Build Status
Buildable 4253
Build 6571: Bitcoin ABC Teamcity Staging
Build 6570: arc lint + arc unit

Event Timeline

schancel created this revision.Mon, Dec 3, 07:01
Herald added a reviewer: Restricted Project. · View Herald TranscriptMon, Dec 3, 07:01
schancel updated this revision to Diff 6254.Mon, Dec 3, 07:09

Rebase

schancel updated this revision to Diff 6256.Mon, Dec 3, 08:54
schancel marked an inline comment as done.
This comment was removed by schancel.
schancel marked an inline comment as done.Mon, Dec 3, 08:55
schancel added inline comments.
src/policy/fees.cpp
68 ↗(On Diff #6256)

Tests fail without this. However, I can't find any mistake above with respect to the comparator and heap operations.

24 ↗(On Diff #6254)

Just looking for a concept ACK. Right now I've got something mixed up in the running median logic.

schancel updated this revision to Diff 6257.Mon, Dec 3, 09:01

Fix median calculation

schancel updated this revision to Diff 6259.Mon, Dec 3, 09:04

Rebase on updated D2172