diff --git a/.release-please-manifest.json b/.release-please-manifest.json
index 969d3db..d4f6f29 100644
--- a/.release-please-manifest.json
+++ b/.release-please-manifest.json
@@ -1,3 +1,3 @@
 {
-  ".": "2.1.0"
+  ".": "3.0.0"
 }
diff --git a/CHANGELOG.md b/CHANGELOG.md
index 696ed2a..a658935 100644
--- a/CHANGELOG.md
+++ b/CHANGELOG.md
@@ -1,5 +1,16 @@
 # Changelog
 
+## [3.0.0](https://github.com/hexsprite/intervaltree/compare/v2.1.0...v3.0.0) (2026-10-04)
+
+
+### ⚠ BREAKING CHANGES
+
+* findOneByLengthStartingAt now selects by clipped start, then end, matching searchByLengthStartingAt; previously it selected by original start. ArrayIntervalCollection also returns canonical arrays and rejects nonpositive length queries.
+
+### Bug Fixes
+
+* resolve pending intervaltree work and guard releases ([#13](https://github.com/hexsprite/intervaltree/issues/13)) ([8caad30](https://github.com/hexsprite/intervaltree/commit/8caad309ed9667dedb6ca50a36db5ef3b646d02c))
+
 ## [2.1.0](https://github.com/hexsprite/intervaltree/compare/v2.0.0...v2.1.0) (2026-10-04)
 
 
diff --git a/package.json b/package.json
index c876d84..bb01030 100644
--- a/package.json
+++ b/package.json
@@ -1,7 +1,7 @@
 {
   "name": "intervaltree",
   "type": "module",
-  "version": "2.1.0",
+  "version": "3.0.0",
   "description": "Interval tree for JavaScript",
   "author": "Jordan Baker",
   "license": "MIT",