diff --git a/README.md b/README.md
index 614b5a7c..31448e2c 100644
--- a/README.md
+++ b/README.md
@@ -25,6 +25,10 @@ deviate from the standard in exchange for top performance.
High performance for multithreaded scenarios. Introducing a new non-standard, iterator-free API.
+**`boost::concurrent_node_set` `boost::concurrent_node_map`**
+
+Variations of boost::concurrent_flat_(set|map)
providing pointer stability.
+
## Learn about Boost.Unordered
* [Online documentation](https://boost.org/libs/unordered)
@@ -34,16 +38,18 @@ deviate from the standard in exchange for top performance.
* [Inside `boost::unordered_flat_map`](https://bannalia.blogspot.com/2022/11/inside-boostunorderedflatmap.html)
* [Inside `boost::concurrent_flat_map`](https://bannalia.blogspot.com/2023/07/inside-boostconcurrentflatmap.html)
* [Bulk visitation in `boost::concurrent_flat_map`](https://bannalia.blogspot.com/2023/10/bulk-visitation-in-boostconcurrentflatm.html)
-
-## Get the library
+* Debugging visualizers for Boost.Unordered:
+ * [Natvis for boost::unordered_map, and how to use <Intrinsic> elements](https://blog.ganets.ky/NatvisForUnordered/)
+ * [Natvis for boost::concurrent_flat_map, and why fancy pointers are hard](https://blog.ganets.ky/NatvisForUnordered2/)
+ * [Visualizing boost::unordered_map in GDB, with pretty-printer customization points](https://blog.ganets.ky/PrettyPrinter/)
Boost.Unordered can be installed in a number of ways:
* [Download Boost](https://www.boost.org/users/download/) and you're ready to go (this is a header-only library requiring no building).
-* Using Conan 2: In case you don't have it yet, add an entry for Boost in your `conanfile.txt` (the example requires at least Boost 1.83):
+* Using Conan 2: In case you don't have it yet, add an entry for Boost in your `conanfile.txt` (the example requires at least Boost 1.86):
```
[requires]
-boost/[>=1.83.0]
+boost/[>=1.86.0]
```
If you're not using any compiled Boost library, the following will skip building altogether: