diff --git a/README.md b/README.md
index 57e1094..049eb9f 100644
--- a/README.md
+++ b/README.md
@@ -5,7 +5,7 @@
 Bloom filters are used to quickly check whether an element is part of a set.
 Xor and binary fuse filters are a faster and more concise alternative to Bloom filters.
 Furthermore, unlike Bloom filters, xor and binary fuse filters are naturally compressible using standard techniques (gzip, zstd, etc.).
-They are also smaller than cuckoo filters. They are used in [production systems](https://github.com/datafuselabs/databend).
+They are also smaller than cuckoo filters. They are used in [production systems](https://github.com/datafuselabs/databend). The Go xorfilter library is part of [Pebble](https://github.com/cockroachdb/pebble) (Cockroach Labs).
 
 * Thomas Mueller Graf, Daniel Lemire, [Binary Fuse Filters: Fast and Smaller Than Xor Filters](http://arxiv.org/abs/2201.01174), Journal of Experimental Algorithmics (to appear). DOI: 10.1145/3510449   
 * Thomas Mueller Graf,  Daniel Lemire, [Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters](https://arxiv.org/abs/1912.08258), Journal of Experimental Algorithmics 25 (1), 2020. DOI: 10.1145/3376122