Skip to content

Releases: stacks-network/stacks-core

Release 2.05.0.2.2

12 Jun 21:09
Compare
Choose a tag to compare
New release for 2.05.0.2.2

Release 2.05.0.2.2-rc1

12 Jun 15:26
Compare
Choose a tag to compare
Pre-release
replace unwrap with error

Release 2.05.0.2.1

03 Jun 15:25
38aa968
Compare
Choose a tag to compare

Fixed

  • Fixed a security bug in the SPV client whereby the chain work was not being
    considered at all when determining the canonical Bitcoin fork. The SPV client
    now only accepts a new Bitcoin fork if it has a higher chain work than any other
    previously-seen chain (#3152).

Release 2.05.0.2.1-rc1

01 Jun 16:28
Compare
Choose a tag to compare
Pre-release

[2.05.0.2.1]

Fixed

  • Fixed a security bug in the SPV client whereby the chain work was not being
    considered at all when determining the canonical Bitcoin fork. The SPV client
    now only accepts a new Bitcoin fork if it has a higher chain work than any other
    previously-seen chain (#3152).

Release 2.05.0.2.0

03 May 16:11
4641001
Compare
Choose a tag to compare

IMPORTANT! READ THIS FIRST

Please read the following WARNINGs in their entirety before upgrading.

WARNING: Please be aware that using this node on chainstate prior to this release will cause
the node to spend up to 30 minutes migrating the data to a new schema.
Depending on the storage medium, this may take even longer.

WARNING: This migration process cannot be interrupted. If it is, the chainstate
will be irrecovarably corrupted and require a sync from genesis.

WARNING: You will need at least 2x the disk space for the migration to work.
This is because a copy of the chainstate will be made in the same directory in
order to apply the new schema.

It is highly recommended that you back up your chainstate before running
this version of the software on it.

Changed

  • The MARF implementation will now defer calculating the root hash of a new trie
    until the moment the trie is committed to disk. This avoids gratuitous hash
    calculations, and yields a performance improvement of anywhere between 10x and
    200x (#3041).
  • The MARF implementation will now store tries to an external file for instances
    where the tries are expected to exceed the SQLite page size (namely, the
    Clarity database). This improves read performance by a factor of 10x to 14x
    (#3059).
  • The MARF implementation may now cache trie nodes in RAM if directed to do so
    by an environment variable (#3042).
  • Sortition processing performance has been improved by about an order of
    magnitude, by avoiding a slew of expensive database reads (#3045).
  • Updated chains coordinator so that before a Stacks block or a burn block is processed,
    an event is sent through the event dispatcher. This fixes #3015.
  • Expose a node's public key and public key hash160 (i.e. what appears in
    /v2/neighbors) via the /v2/info API endpoint (#3046)
  • Reduced the default subsequent block attempt timeout from 180 seconds to 30
    seconds, based on benchmarking the new MARF performance data during a period
    of network congestion (#3098)
  • The blockstack-core binary has been renamed to stacks-inspect.
    This binary provides CLI tools for chain and mempool inspection.

Release 2.05.0.2.0-rc3

29 Apr 19:34
258a3bd
Compare
Choose a tag to compare
Pre-release
Merge pull request #3120 from stacks-network/fix/mocknet-events

Fix mocknet events in RC

Release 2.05.0.2.0-rc2

25 Apr 16:44
118187d
Compare
Choose a tag to compare
Pre-release

[2.05.0.2.0]

WARNING: Please be aware that using this node on chainstate prior to this release will cause
the node to spend up to 30 minutes migrating the data to a new schema.

Changed

  • The MARF implementation will now defer calculating the root hash of a new trie
    until the moment the trie is committed to disk. This avoids gratuitous hash
    calculations, and yields a performance improvement of anywhere between 10x and
    200x (#3041).
  • The MARF implementation will now store tries to an external file for instances
    where the tries are expected to exceed the SQLite page size (namely, the
    Clarity database). This improves read performance by a factor of 10x to 14x
    (#3059).
  • The MARF implementation may now cache trie nodes in RAM if directed to do so
    by an environment variable (#3042).
  • Sortition processing performance has been improved by about an order of
    magnitude, by avoiding a slew of expensive database reads (#3045). WARNING:
    applying this change to an existing chainstate directory will take a few
    minutes when the node starts up.
  • Updated chains coordinator so that before a Stacks block or a burn block is processed,
    an event is sent through the event dispatcher. This fixes #3015.
  • Expose a node's public key and public key hash160 (i.e. what appears in
    /v2/neighbors) via the /v2/info API endpoint (#3046)
  • Reduced the default subsequent block attempt timeout from 180 seconds to 30
    seconds, based on benchmarking the new MARF performance data during a period
    of network congestion (#3098)

Release 2.05.0.2.0-rc1

20 Apr 20:56
d2f31ca
Compare
Choose a tag to compare
Pre-release

WARNING: Please be aware that using this node on chainstate prior to this release will cause
the node to spend up to 30 minutes migrating the data to a new schema.

Changed

  • The MARF implementation will now defer calculating the root hash of a new trie
    until the moment the trie is committed to disk. This avoids gratuitous hash
    calculations, and yields a performance improvement of anywhere between 10x and
    200x (#3041).
  • The MARF implementation will now store tries to an external file for instances
    where the tries are expected to exceed the SQLite page size (namely, the
    Clarity database). This improves read performance by a factor of 10x to 14x
    (#3059).
  • The MARF implementation may now cache trie nodes in RAM if directed to do so
    by an environment variable (#3042).
  • Sortition processing performance has been improved by about an order of
    magnitude, by avoiding a slew of expensive database reads (#3045). WARNING:
    applying this change to an existing chainstate directory will take a few
    minutes when the node starts up.
  • Updated chains coordinator so that before a Stacks block or a burn block is processed,
    an event is sent through the event dispatcher. This fixes #3015.
  • Expose a node's public key and public key hash160 (i.e. what appears in
    /v2/neighbors) via the /v2/info API endpoint (#3046)
  • Reduced the default subsequent block attempt timeout from 180 seconds to 30
    seconds, based on benchmarking the new MARF performance data during a period
    of network congestion (#3098)

Release 2.05.0.1.0

07 Feb 19:19
de541f9
Compare
Choose a tag to compare

This software update is a point-release with a large set of changes. This release's chainstate directory is compatible with chainstate directories from 2.05.0.0.0.

Added

  • A new fee estimator intended to produce fewer over-estimates, by having less
    sensitivity to outliers. Its characteristic features are: 1) use a window to
    forget past estimates instead of exponential averaging, 2) use weighted
    percentiles, so that bigger transactions influence the estimates more, 3)
    assess empty space in blocks as having paid the "minimum fee", so that empty
    space is accounted for, 4) use random "fuzz" so that in busy times the fees can
    change dynamically. (#2972)
  • Implements anti-entropy protocol for querying transactions from other
    nodes' mempools. Before, nodes wouldn't sync mempool contents with one another.
    (#2884)
  • Structured logging in the mining code paths. This will shine light
    on what happens to transactions (successfully added, skipped or errored) that the
    miner considers while buildings blocks. (#2975)
  • Added the mined microblock event, which includes information on transaction
    events that occurred in the course of mining (will provide insight
    on whether a transaction was successfully added to the block,
    skipped, or had a processing error). (#2975)
  • For v2 endpoints, can now specify the tip parameter to latest. If
    tip=latest, the node will try to run the query off of the latest tip. (#2778)
  • Adds the /v2/headers endpoint, which returns a sequence of SIP-003-encoded
    block headers and consensus hashes (see the ExtendedStacksHeader struct that
    this PR adds to represent this data). (#2862)
  • Adds the /v2/data_var endpoint, which returns a contract's data variable
    value and a MARF proof of its existence. (#2862)
  • Fixed a bug in the unconfirmed state processing logic that could lead to a
    denial of service (node crash) for nodes that mine microblocks (#2970)
  • Added prometheus metric that tracks block fullness by logging the percentage of each
    cost dimension that is consumed in a given block (#3025).

Changed

  • Updated the mined block event. It now includes information on transaction
    events that occurred in the course of mining (will provide insight
    on whether a transaction was successfully added to the block,
    skipped, or had a processing error). (#2975)
  • Updated some of the logic in the block assembly for the miner and the follower
    to consolidate similar logic. Added functions setup_block and finish_block.
    (#2946)
  • Makes the p2p state machine more reactive to newly-arrived
    BlocksAvailable and MicroblocksAvailable messages for block and microblock
    streams that this node does not have. If such messages arrive during an inventory
    sync, the p2p state machine will immediately transition from the inventory sync
    work state to the block downloader work state, and immediately proceed to fetch
    the available block or microblock stream. (#2862)
  • Nodes will push recently-obtained blocks and microblock streams to outbound
    neighbors if their cached inventories indicate that they do not yet have them
    (#2986).
  • Nodes will no longer perform full inventory scans on their peers, except
    during boot-up, in a bid to minimize block-download stalls (#2986).
  • Nodes will process sortitions in parallel to downloading the Stacks blocks for
    a reward cycle, instead of doing these tasks sequentially (#2986).
  • The node's runloop will coalesce and expire stale requests to mine blocks on
    top of parent blocks that are no longer the chain tip (#2969).
  • Several database indexes have been updated to avoid table scans, which
    significantly improves most RPC endpoint speed and cuts node spin-up time in
    half (#2989, #3005).
  • Fixed a rare denial-of-service bug whereby a node that processes a very deep
    burnchain reorg can get stuck, and be rendered unable to process further
    sortitions. This has never happened in production, but it can be replicated in
    tests (#2989).
  • Updated what indices are created, and ensures that indices are created even
    after the database is initialized (#3029).

Fixed

  • Updates the lookup key for contracts in the pessimistic cost estimator. Before, contracts
    published by different principals with the same name would have had the same
    key in the cost estimator. (#2984)
  • Fixed a few prometheus metrics to be more accurate compared to /v2 endpoints
    when polling data (#2987)

Release 2.05.0.1.0-rc4

02 Feb 15:47
8c7dc19
Compare
Choose a tag to compare
Pre-release
Merge pull request #3029 from stacks-network/feat/add-all-indexes

Feat/add all indexes