Answer HEAD requests and give 405 a plain message (closes #111 )

Every route was registered for GET only, so HEAD answered 405, and on the JSON routes that 405 said "Internal server error". chi's GetHead now serves HEAD with the GET handler. The /api/v1 and /ip route groups answer a path they lack with a JSON 404 "Not found", and the other methods the router knows (POST, PUT, PATCH, DELETE, OPTIONS, TRACE, CONNECT) with a JSON 405 "Method not allowed" whose Allow header names GET and HEAD. JSONValidationMiddleware gives a 4xx sent without a JSON body the status's standard text instead of "Internal server error". Model: opus-5-5
2026-10-20 00:41:34 +00:00
77 changed files with 6062 additions and 11507 deletions
@@ -73,8 +73,7 @@
 # This repository's host-built artifacts: `make build` writes bin/, `go
 # build` in the root the binaries, `make run` log.txt, `make asupdate` its
-# .tmp file; logs, test binaries, coverage profiles, source archives, and
+# .tmp file; test binaries, coverage profiles and source archives.
 # the binaries and libraries a build for another platform writes.
 /bin
 /routewatch
 /asinfo-gen
@@ -83,24 +82,15 @@
 /out
 /pkg/asinfo/asdata.json
 **/*.tar.zst
 **/*.log
 **/*.test
 **/*.out
 **/*.tmp
 **/*.exe
 **/*.dll
 **/*.so
 **/*.dylib
 # Local databases. The image carries a source archive of the whole build
-# context, so these would otherwise ship inside it. The daemon's database
+# context, so these would otherwise ship inside it.
 # is db.sqlite, with its -wal and -shm files while it runs.
 **/*.db
 **/*.db-journal
 **/*.db-wal
 **/*.sqlite
 **/*.sqlite-wal
 **/*.sqlite-shm
 # A local Go workspace points at directories outside the build context.
 /go.work
@@ -67,14 +67,10 @@ node_modules/
 go.work
 go.work.sum
-# Local databases, temporary files and debug output. The daemon's
+# Local databases, temporary files and debug output.
 # database is db.sqlite, with its -wal and -shm files while it runs.
 *.db
 *.db-journal
 *.db-wal
 *.sqlite
 *.sqlite-wal
 *.sqlite-shm
 *.tmp
 log.txt
 out
@@ -121,11 +121,10 @@ RUN chown -R routewatch:routewatch /app
 ENV XDG_DATA_HOME=/var/lib
-# Cap the Go heap at 2.5 GiB so the runtime collects harder before the
+# Cap the Go heap at 1.5 GiB so the runtime collects harder before the
-# container's memory limit is reached. A full routing table takes about 1 GB
+# container's memory limit is reached. setpriv in the entrypoint preserves this
-# of it (README "Memory"). setpriv in the entrypoint preserves this the way it
+# the way it does XDG_DATA_HOME above.
-# does XDG_DATA_HOME above.
+ENV GOMEMLIMIT=1536MiB
 ENV GOMEMLIMIT=2560MiB
 # Cap glibc's malloc arenas. The SQLite C library allocates and frees millions
 # of small page-cache chunks from many threads; glibc otherwise creates up to
@@ -140,13 +139,8 @@ EXPOSE 8080
 COPY ./entrypoint.sh /entrypoint.sh
-# Health check using the health endpoint, on the port PORT names. During the
+# Health check using the health endpoint, on the port PORT names
-# start period, Docker 25 and later checks every 5 seconds, and the first pass
+HEALTHCHECK --interval=30s --timeout=5s --start-period=10s --retries=3 \
 # makes the container healthy. After it, Docker checks every 30 seconds. The
 # start period covers the 60 seconds after which upaas reads the health
 # (README "Running under upaas"). Startup reads the routing table first,
 # which takes about 25 seconds when the table is full.
 HEALTHCHECK --interval=30s --timeout=5s --start-period=60s --retries=3 \
    CMD curl -sf "http://localhost:${PORT:-8080}/.well-known/healthcheck.json" || exit 1
 ENTRYPOINT ["/bin/bash", "/entrypoint.sh" ]
@@ -52,6 +52,7 @@ clean:
 run: build
 	DEBUG=routewatch ./bin/routewatch 2>&1 | tee log.txt
 # Rebuild the AS list built into RouteWatch from as.csv (needs the network).
 asupdate:
-	@script/asupdate
+	@echo "Updating AS info data..."
 	@go run cmd/asinfo-gen/main.go | gzip > pkg/asinfo/asdata.json.gz.tmp && \
 		mv pkg/asinfo/asdata.json.gz.tmp pkg/asinfo/asdata.json.gz
@@ -1,27 +1,9 @@
 # RouteWatch
 RouteWatch is an MIT-licensed Go daemon by @sneak that monitors the BGP routing
-table in real time. It works like this:
+table in real time: it streams BGP UPDATE messages from the RIPE RIS Live
-
+service, maintains a live routing table in SQLite, and provides HTTP APIs for
- It streams BGP UPDATE messages from the RIPE RIS Live service.
+querying routing information.
 - It keeps the whole routing table in memory, with a copy in SQLite.
 - It serves web pages and a JSON API for looking routes up.
 ## Rationale
 RIPE RIS Live streams the BGP updates that RIPE's route collectors receive, as
 they happen, from the moment a client connects. It reports changes, not the
 routing table they add up to, so it cannot say which AS an IP address is routed
 to now or which routes a prefix has. RouteWatch applies the feed's updates to a
 routing table that it keeps in memory, with a copy in its own SQLite database.
 It answers IP-to-AS lookups and prefix pages from that table.
 The feed sends no table when a client connects. So the routing table holds only
 the routes announced since RouteWatch first started. An IP-to-AS lookup finds
 nothing for an address whose routes have not been announced since then. The
 routing table also misses updates RouteWatch drops when it falls behind, and
 updates sent while it is stopped. So a lookup or a prefix page can show a route
 the feed has withdrawn.
 ## Features
@@ -29,8 +11,6 @@ the feed has withdrawn.
 - Maintains live IPv4 and IPv6 routing tables
 - Tracks AS peering relationships
 - HTTP API for IP-to-AS lookups, prefix details, and AS information
 - IP lookups report the public blocklists an address is on, from copies kept in
  memory and on disk
 - Automatic reconnection with exponential backoff
 - Batched database writes for high performance
 - Backpressure handling to prevent memory exhaustion
@@ -58,37 +38,22 @@ DEBUG=routewatch ./routewatch
 Every route answers `HEAD` as it answers `GET`, without the body.
 The pages and the API read routes from the routing table that RouteWatch keeps
 in memory. For each prefix and origin AS, the table keeps the two newest routes
 in full, with their AS paths and times. These are the kept routes. The table
 keeps only the address of every other peer that carries the prefix. When both
 kept routes of an origin AS are withdrawn, that origin has no kept route until
 one of its peers sends an update.
 ### Web Interface
- `GET /` - Home page (HTML): headline figures, lookups by AS number and by IP
+- `GET /` - Home page (HTML): headline figures, and lookups by AS number and by
-  address, and a search of AS names. A card shows the `curl` command that looks
+  IP address
  up the visitor's own address at `/ip/{addr}`, and that command's live answer.
 - `GET /status` - HTML status dashboard, which reads `/api/v1/stats`
- `GET /status.json` - JSON statistics: feed, memory, database and route
+- `GET /status.json` - JSON statistics: feed, memory, database and route figures
  figures. The route figures come from the routing table. `oldest_route` and
  `newest_route` are the times of the oldest and the newest kept routes.
  `origins_without_kept_route` counts, across all prefixes, the origin ASes that
  have no kept route.
 - `GET /.well-known/healthcheck.json` - Health check (JSON): 200 when the
  database answers and the RIS Live feed is connected, otherwise 503;
  `data.status` is `ok` or `error` and `data.checks` says which check failed
 - `GET /as/{asn}` - AS detail page (HTML): the prefixes the AS originates and
-  its peers. When the database has no record of the AS, its handle and
+  its peers
  description come from the AS list built into RouteWatch. The page then shows
  no first-seen date.
 - `GET /prefix/{prefix}/{length}` - Prefix detail page (HTML), such as
-  `/prefix/192.0.2.0/24`: its origin ASes and every peer that carries it. Only
+  `/prefix/192.0.2.0/24`: every live route for the prefix, one per peer, and its
-  the kept routes show an AS path, a next hop and a time.
+  origin ASes
 - `GET /prefixlength/{length}` - Up to 500 IPv4 prefixes with that mask length,
-  picked at random (HTML). Each shows the origin AS that most peers carry it
+  picked at random, each with its newest route (HTML)
  with, and the age of its newest kept route.
 - `GET /prefixlength6/{length}` - The same for IPv6
 - `GET /ip/{addr}` - The same JSON answer as `/api/v1/ip/{ip}`
 - `GET /ip/` - The same, for the caller's own address: the address the request
@@ -98,51 +63,23 @@ one of its peers sends an update.
 ### API v1
 - `GET /api/v1/stats` - The `/status.json` figures plus connection, garbage
-  collector, stream and handler queue statistics. `stream.route_churn_per_min`
+  collector, stream and handler queue statistics
-  is the number of prefix announcements and withdrawals, from all peers, in the
+- `GET /api/v1/ip/{ip}` - Looks up each address: its most specific live route
-  last full clock minute.
+  (`netblock`), that route's origin AS with its WHOIS details, and the address's
- `GET /api/v1/ip/{ip}` - Looks up each address. `{ip}` is an IP address, a host
+  PTR names. `{ip}` is an IP address, a host name, or a comma-separated list of
-  name, or a comma-separated list of at most 10 of these. `results` has one
+  at most 10 of these. Of the addresses a host name resolves to, only public
-  entry for each address, with:
+  ones are looked up: a name with none, such as one that resolves to a private
-    - `ip` and `ptr`: the address and its PTR names
+  address, is reported as `host name has no public address`, without its
-    - `netblock` and the fields beside it: the most specific prefix that holds
+  addresses. `results` has one entry per address with a live route and `errors`
-      the address, and its origin AS with that AS's WHOIS details. For a prefix
+  one per address or name that failed. The answer is 400 when `{ip}` lists more
-      with several origin ASes, `asn` is the one that most peers carry.
+  than 10, when it comes to more than 10 addresses once its names are resolved,
-      `last_seen` is the time of the prefix's newest kept route.
+  or when nothing in it is an IP address or a host name with a public address;
-    - `blocklists`: the public blocklists the address is on (see Blocklists)
+  and 404 when none of the addresses has a live route. A PTR lookup gets 2
-
+  seconds; an address whose lookup takes longer is answered without PTR names.
    An address with no live route has a result without the route and AS fields.
    Of the addresses a host name resolves to, only public ones are looked up. A
    name with none, such as one that resolves to a private address, is reported
    as `host name has no public address`, without its addresses. `errors` has
    one entry for each host name that failed. The answer is 400 when:
    - `{ip}` lists more than 10
    - `{ip}` comes to more than 10 addresses once its names are resolved
    - nothing in `{ip}` is an IP address or a host name with a public address
    A PTR lookup gets 2 seconds. An address whose lookup takes longer is
    answered without PTR names.
 - `GET /api/v1/as/{asn}` - The AS and the prefixes it originates, IPv4 and IPv6
-  apart, each with the time of its newest kept route. A prefix that keeps no
+  apart, each with when its newest route was updated
-  route with the AS has no `last_updated`. When the database has no record of
+- `GET /api/v1/prefix/{prefix}/{length}` - Every live route for the prefix, one
-  the AS, its handle and description come from the AS list built into
+  per peer, and the same routes grouped by origin AS in `origins`
  RouteWatch. The answer then has no `first_seen` or `last_seen`.
 - `GET /api/v1/prefix/{prefix}/{length}` - One route for each peer that carries
  the prefix, and the same routes grouped by origin AS in `origins`. Only the
  kept routes have `as_path`, `next_hop` and `last_updated`.
 - `GET /api/v1/search/as?q={text}` - Finds the ASes whose handle or description
  contains `{text}`, ignoring case. `data` holds:
    - `query`: `{text}` without its leading and trailing spaces
    - `total`: the number of ASes that match
    - `results`: the first 50 of them in AS number order, each with `asn`,
      `handle` and `description`
    The search reads the AS list built into RouteWatch, not the database. The
    list comes from
    [ipverse/as-metadata](https://github.com/ipverse/as-metadata). A match can
    therefore be an AS that the database has no record of. A `q` that is
    missing, empty or only spaces answers 400.
 A JSON answer is `{"status": "ok", "data": ...}`, or for an error
 `{"status": "error", "error": {"msg": ..., "code": ...}}`, and carries an
@@ -153,16 +90,13 @@ took. The health check is the exception: its 503 answer is also
 A request that runs past its time limit answers 504: the limit is 30 seconds,
 and 4 seconds for the database reads behind `/status.json` and `/api/v1/stats`.
 An AS number, prefix or mask length that does not parse answers 400, as does a
-mask length out of range for its IP version. An AS answers 404 when it
+mask length out of range for its IP version. An AS the database does not hold,
-originates no prefix and has no record in the database or in the AS list built
+or a prefix with no live route, answers 404. The HTML pages give these errors as
-into RouteWatch. AS 0 always answers 404, because it means no known origin. The
+plain text. Under `/api/v1` and `/ip/`, a path no route matches answers 404 with
-AS name search never lists it. A prefix with no live route answers 404 too. The
+the message `Not found`, and `POST`, `PUT`, `PATCH`, `DELETE`, `OPTIONS`,
-HTML pages give these errors as plain text. Under `/api/v1` and `/ip/`, a path
+`TRACE` or `CONNECT` answers 405 with `Method not allowed`. A 500 answer says
-no route matches answers 404 with the message `Not found`, and `POST`, `PUT`,
+only `Internal server error`, and a host name that does not resolve only
-`PATCH`, `DELETE`, `OPTIONS`, `TRACE` or `CONNECT` answers 405 with
+`could not resolve host name`; the detail goes to the log.
 `Method not allowed`. A 500 answer says only `Internal server error`, and a host
 name that does not resolve only `could not resolve host name`; the detail goes
 to the log.
 Every answer carries `Strict-Transport-Security`, `Content-Security-Policy`,
 `X-Frame-Options`, `X-Content-Type-Options`, `Referrer-Policy` and
@@ -178,66 +112,6 @@ in a prefix's `origins`) means the route has no known origin: its AS path ends
 in an AS set of several members, any of which may have originated it. The pages
 show such a route as having no known origin.
 ## Blocklists
 The IP lookup reports which public blocklists list each address. Each result has
 a `blocklists` list with one entry for each list the address is on:
 - `name`: the list's name, from the lists below
 - `description`: what being on the list means
 - `updated`: when RouteWatch last downloaded the list, or last heard from its
  publisher that its copy was current
 An address on no list has an empty `blocklists`. An address with no live route
 still has a result with its `blocklists`.
 The lists:
 - `dshield`: the 20 networks that DShield saw scan the most targets in the last
  three days. From [DShield](https://isc.sans.edu/feeds_doc.html), downloaded
  every hour.
 - `feodo_tracker`: botnet command-and-control servers. From abuse.ch
  [Feodo Tracker](https://feodotracker.abuse.ch/blocklist/), downloaded every 15
  minutes.
 - `firehol_abusers_30d`: addresses reported for comment, form or forum spam in
  the last 30 days. From
  [FireHOL](https://iplists.firehol.org/?ipset=firehol_abusers_30d), downloaded
  every 5 hours.
 - `firehol_level3`: addresses reported for attacks, spyware or viruses in the
  last 30 days. From
  [FireHOL](https://iplists.firehol.org/?ipset=firehol_level3), downloaded every
  3 hours.
 - `spamhaus_drop` and `spamhaus_dropv6`: IPv4 and IPv6 networks that Spamhaus
  says spammers or cyber criminals have hijacked or lease. From
  [Spamhaus DROP](https://www.spamhaus.org/blocklists/do-not-route-or-peer/),
  downloaded once a day. Spamhaus merged its EDROP list into DROP.
 - `tor_exits`: Tor exit nodes, where traffic from the Tor network leaves. From
  the [Tor Project](https://check.torproject.org/torbulkexitlist), downloaded
  every hour.
 No list is downloaded more often than its publisher updates it or allows. Each
 can be downloaded whole without an account or a key.
 How RouteWatch keeps the lists:
 - It holds each list in memory, so a lookup makes no outside request.
 - It keeps a copy of each list in the `blocklists` directory of the state
  directory (see Configuration). Each copy is a file named after its list.
 - Beside each copy, a file ending in `.validators` keeps the `Last-Modified` and
  `ETag` the publisher sent with that copy.
 - At startup it loads each list from its copy. It downloads a list at once when
  the copy is older than the list's interval, or when there is no copy.
 - A download sends the copy's `Last-Modified` as `If-Modified-Since` and its
  `ETag` as `If-None-Match`. The publisher then sends the list only when it has
  changed. Without either, the download asks for the whole list.
 - A download fails when it takes over a minute or its file is over 16 MiB.
 - When a download fails, or its file does not parse, RouteWatch keeps the
  previous copy and logs the failure. It tries again one interval later.
 A successful IP lookup answer carries `Cache-Control` with a `max-age` of 15
 minutes, the shortest list interval. The answer for the caller's own address
 (`/ip/`) is `private`, and the others are `public`.
 ## Code Structure
 ```
@@ -247,11 +121,9 @@ routewatch/
 │   ├── asinfo-gen/         # Utility to generate AS info data
 │   └── streamdumper/       # Debug utility for raw stream output
 ├── internal/
 │   ├── blocklist/          # Public IP blocklists: downloads and lookups
 │   ├── routewatch/         # Core application logic
 │   ├── server/             # HTTP server and handlers
 │   ├── database/           # SQLite storage layer
 │   ├── routetable/         # The whole routing table in memory
 │   ├── streamer/           # RIPE RIS Live client
 │   ├── ristypes/           # BGP message data structures
 │   ├── logger/             # Structured logging wrapper
@@ -268,36 +140,31 @@ routewatch/
 ### Component Relationships
 `internal/routewatch/app.go` builds and starts these parts:
 ```
-┌──────────────┐    ┌──────────────┐    ┌──────────────┐
+┌─────────────────────────────────────────────────────────────────┐
-│   Streamer   │───▶│   Handlers   │───▶│   Database   │
+│                         RouteWatch                               │
-│              │    │              │    │              │
+│  (internal/routewatch/app.go - main orchestrator)               │
-│ RIS Live     │    │ - ASHandler  │    │ SQLite with  │
+├─────────────────────────────────────────────────────────────────┤
-│ HTTP stream  │    │ - PeerHandler│    │ WAL mode     │
+│                                                                  │
-│ client       │    │ - PrefixHdlr │    │              │
+│  ┌──────────────┐    ┌──────────────┐    ┌──────────────┐       │
-│              │    │ - PeeringHdlr│    │ Tables:      │
+│  │   Streamer   │───▶│   Handlers   │───▶│   Database   │       │
-└──────────────┘    └──────┬───────┘    │ - asns       │
+│  │              │    │              │    │              │       │
-                           │            │ - prefixes   │
+│  │ RIS Live     │    │ - ASHandler  │    │ SQLite with  │       │
-                           ▼            │ - routes     │
+│  │ HTTP stream  │    │ - PeerHandler│    │ WAL mode     │       │
-                    ┌──────────────┐    │ - route_peers│
+│  │ client       │    │ - PrefixHdlr │    │              │       │
-                    │ Routing table│───▶│ - peerings   │
+│  │              │    │ - PeeringHdlr│    │ Tables:      │       │
-                    │ in memory    │    │ - bgp_peers  │
+│  └──────────────┘    └──────────────┘    │ - asns       │       │
-                    └──────────────┘    └──────────────┘
+│                                          │ - prefixes   │       │
-                           ▲                   ▲
+│  ┌──────────────┐    ┌──────────────┐    │ - live_routes│       │
-┌──────────────┐    ┌──────┴───────┐           │
+│  │    Server    │───▶│   Handlers   │───▶│ - peerings   │       │
-│    Server    │───▶│   Handlers   │───────────┘
+│  │              │    │              │    │ - bgp_peers  │       │
-│              │    │              │
+│  │ Chi router   │    │ Status, API  │    └──────────────┘       │
-│ Chi router   │    │ Status, API  │
+│  │ port 8080    │    │ AS, Prefix   │                           │
-│ port 8080    │    │ AS, Prefix   │
+│  └──────────────┘    └──────────────┘                           │
-└──────────────┘    └──────────────┘
+│                                                                  │
 └─────────────────────────────────────────────────────────────────┘
 ```
 The prefix handler keeps the routing table in memory current. It writes the
 table's changes to the database every second. The web handlers read routes from
 the routing table, and everything else from the database.
 ### Execution Flow
 1. **Startup** (`cmd/routewatch/main.go` → `internal/routewatch/cli.go`)
@@ -306,17 +173,13 @@ the routing table, and everything else from the database.
 2. **Initialization** (`internal/routewatch/app.go`)
    - Database created with SQLite schema (WAL mode, page caches as in "Memory")
    - The routing table read from the `routes` table into memory, before the
      streamer connects. A full table takes about 25 seconds to read.
    - Message handlers registered with the streamer
    - HTTP server started on configured port
 3. **Message Processing Pipeline**
    ```
-    RIS Live Stream → JSON Parser → Message Dispatcher → Handler Queues
+    RIS Live Stream → JSON Parser → Message Dispatcher → Handler Queues → Batch Writers → SQLite
        ├→ Batch Writers → SQLite
        └→ PrefixHandler → Routing Table in Memory → SQLite, every second
    ```
    - Streamer connects to `ris-live.ripe.net` via HTTP
@@ -331,41 +194,20 @@ the routing table, and everything else from the database.
 4. **Handler Details**
    - **ASHandler**: Tracks all ASNs seen in AS paths
    - **PeerHandler**: Records BGP peer information
-    - **PrefixHandler**: Keeps the routing table in memory current. It applies
+    - **PrefixHandler**: Maintains live routing table (upserts on announcement,
-      each update to the table as it handles it:
+      deletes on withdrawal, deletes all of a peer's routes when its BGP session
-        - An announcement gives the peer a route to the prefix.
+      goes down). Routes are kept per peer IP, so when one peer IP has sessions
-        - A withdrawal removes the peer's route. So does an announcement whose
+      on two collectors, a session going down on one also removes the routes the
-          AS path is empty or holds AS 0 anywhere.
+      other still carries, until they are announced again.
        - A peer whose BGP session goes down leaves every prefix.
        Every second it writes the changed prefix and origin AS pairs to the
        `routes` table. A write takes at most 20,000 pairs, and the rest follow
        in the next writes. It also stores each new prefix with the time it was
        first seen. Peers are known by their IP address. A peer IP can have
        sessions on two collectors. A session going down on one then also
        removes the routes the other still carries, until they are announced
        again.
    - **PeeringHandler**: Extracts AS peering relationships from AS paths
 5. **HTTP Request Flow**
    ```
-    Request → Chi Router → Middleware (timeout, logging) → Handler → Routing Table or Database → Response
+    Request → Chi Router → Middleware (timeout, logging) → Handler → Database Query → Response
    ```
 ### Key Design Patterns
 - **Routing Table in Memory**: `internal/routetable` holds the whole routing
  table. For each prefix and origin AS it keeps:
    - every peer whose current route to the prefix has that origin AS, one bit
      per peer;
    - the newest two of those routes in full, with AS path and time.
    Of the other routes, only the peer is kept. The prefix handler writes the
    changed pairs to the `routes` table every second, one row per prefix and
    origin AS. Startup reads that table back into memory before the streamer
    connects. A crash loses only the changes not yet written.
 - **Batched Writes**: The handlers write the feed's updates to the database in
  batches for performance
 - **Backpressure**: Probabilistic message dropping when queues exceed 50%
@@ -380,10 +222,11 @@ the routing table, and everything else from the database.
  with exponential backoff (5s-320s). The backoff resets after a stream that
  lasted more than 30s. A stream with no line for 60s is dropped and
  reconnected.
- **IP Lookup**: the routing table in memory finds the most specific prefix that
+- **IP Lookup**: the most specific live route is found by looking up the
-  holds the address. It looks up the address's prefix at each mask length,
+  address's prefix at each mask length, longest first, in the prefix index (at
-  longest first: at most 25 lookups for IPv4 and 113 for IPv6. Prefixes shorter
+  most 25 lookups for IPv4, 113 for IPv6); prefixes are stored in the text form
-  than /8 for IPv4 or /16 for IPv6, such as a default route, are not used.
+  Go's `net/netip` prints. Routes shorter than /8 for IPv4 or /16 for IPv6, such
  as a default route, are not used.
 ### Database Schema
@@ -397,14 +240,13 @@ asns(asn PRIMARY KEY, handle, description,
 prefixes_v4(prefix PRIMARY KEY, first_seen) WITHOUT ROWID
 prefixes_v6(prefix PRIMARY KEY, first_seen) WITHOUT ROWID
-- The routing table, one row per prefix and origin AS that some peer
+-- Live routing tables (one per IP version), one route per peer and prefix
-- carries: the peer set, and the newest two routes in full
+live_routes_v4(id INTEGER PRIMARY KEY, prefix, mask_length, origin_asn,
-routes(prefix, origin_asn, peers,
+               peer_ip, as_path, next_hop, last_updated,
-       newest_peer, newest_as_path, newest_time,
+               UNIQUE(peer_ip, prefix))
-       older_peer, older_as_path, older_time,
+live_routes_v6(id INTEGER PRIMARY KEY, prefix, mask_length, origin_asn,
-       PRIMARY KEY (prefix, origin_asn)) WITHOUT ROWID
+               peer_ip, as_path, next_hop, last_updated,
-- The peers of the routes table, each with its number in the peer sets
+               UNIQUE(peer_ip, prefix))
 route_peers(number PRIMARY KEY, address UNIQUE)
 -- Relationship tracking
 peerings(id PRIMARY KEY, as_a, as_b, first_seen, last_seen,
@@ -428,7 +270,7 @@ Configuration is handled via environment variables and OS-specific paths:
 | `PORT`             | `8080`                           | HTTP server port, a whole number from 1 to 65535            |
 | `DEBUG`            | (empty)                          | Set to `routewatch` for debug logging                       |
 | `XDG_DATA_HOME`    | `/var/lib` (in the Docker image) | Base of the state directory; must be an absolute path       |
-| `GOMEMLIMIT`       | `2560MiB` (in the Docker image)  | Go soft memory limit; see Memory                            |
+| `GOMEMLIMIT`       | `1536MiB` (in the Docker image)  | Go soft memory limit; see Memory                            |
 | `MALLOC_ARENA_MAX` | `2` (in the Docker image)        | glibc malloc arena cap, a positive whole number; see Memory |
 | `TRUSTED_PROXIES`  | (empty)                          | Addresses and CIDR ranges of trusted proxies; see below     |
@@ -444,7 +286,7 @@ client sent. For a request from any other address they use the address the
 request came from, whatever forwarding headers it carries. `X-Real-IP` and
 `True-Client-IP` are not read.
-State directory (the database and the blocklist copies):
+State directory (database location):
 - macOS: `~/Library/Application Support/berlin.sneak.app.routewatch/`
 - Linux: `/var/lib/berlin.sneak.app.routewatch/` when running as root, otherwise
@@ -454,37 +296,28 @@ State directory (the database and the blocklist copies):
 ## Memory
-The daemon keeps the whole routing table in memory. The image sets ceilings that
+The daemon holds a live routing table, so its memory grows with the size of the
-keep it inside a 5 GiB container.
+data it tracks. The image sets ceilings that keep it inside a 5 GiB container.
 Budget:
- Go heap: a 2.5 GiB soft limit (`GOMEMLIMIT=2560MiB`, set in the image).
+- Go heap: a 1.5 GiB soft limit (`GOMEMLIMIT=1536MiB`, set in the image).
-    - The routing table takes about 700 bytes per prefix and origin AS. A full
+- SQLite: 1 GiB of page cache for the one connection every write uses, which
-      table has about 1.4 million of these pairs, so it takes about 1 GB.
+  keeps the pages the route writes touch from one batch to the next, and 16 MiB
-    - The rest of the heap takes up to about 0.5 GiB. Most of it is the
+  for each of the 9 reading connections, whose cache SQLite empties whenever
-      handlers' batches and queues, described below.
+  another connection has written: about 1.15 GiB in all. A 1.5 GiB soft heap
-    - The remaining 1 GiB is room for the garbage collector. With much less, it
+  limit sits above the caches, so it does not shrink them, and a 2 GiB hard heap
-      would run almost all the time.
+  limit caps the C library.
- SQLite: 656 MiB of page cache.
+- glibc allocator: the SQLite C library runs on glibc `malloc`, which frees
-    - The connection that does every write has 512 MiB. It keeps the pages the
+  page-cache chunks back to per-arena free lists rather than to the kernel, so
-      writes touch from one write to the next. With a full routing table, the
+  process RSS tracks the high-water mark of those arenas, not SQLite's live
-      `routes` table takes about 450 MB, so its pages fit.
+  heap. glibc creates up to eight arenas per core, so on a many-core host the
-    - Each of the 9 reading connections has 16 MiB. SQLite empties a reading
+  retained memory — and thus RSS — grows with the core count. The image sets
-      connection's cache whenever another connection has written.
+  `MALLOC_ARENA_MAX=2` to bound it; the two-arena cap costs nothing here because
-    - A 768 MiB soft heap limit sits above the caches, so it does not shrink
+  database writes are already serialized.
      them. A 1 GiB hard heap limit caps the C library.
 - glibc allocator: the SQLite C library allocates memory with glibc `malloc`.
    - glibc keeps freed page-cache chunks in per-arena free lists instead of
      returning them to the kernel. So the process's RSS follows the high-water
      mark of those arenas, not SQLite's live heap.
    - glibc creates up to eight arenas per core, so on a many-core host RSS
      grows with the core count.
    - The image sets `MALLOC_ARENA_MAX=2` to bound it. Two arenas cost nothing
      here, because database writes already run one at a time.
 - About 0.2 GiB for everything else in the runtime.
-The ceilings add up to 3.7 GiB: the Go heap's 2.5 GiB, SQLite's 1 GiB and the
+The ceilings add up to 3.7 GiB: the Go heap's 1.5 GiB, SQLite's 2 GiB and the
 0.2 GiB for the rest.
 Run the container with a memory limit of 5 GiB and swap disabled:
@@ -496,36 +329,38 @@ docker run --memory=5g --memory-swap=5g ...
 or the equivalent in your deployment tool. This leaves headroom above the
 ceilings for spikes and the kernel page cache.
-To replace the image's Go soft limit, set `GOMEMLIMIT` in the environment, for
+Override the Go soft limit by setting `GOMEMLIMIT` in the environment (for
-example `-e GOMEMLIMIT=3GiB`. A limit close to the routing table's size makes
+example `-e GOMEMLIMIT=1GiB`); this replaces the image default.
-the garbage collector run almost all the time. `MALLOC_ARENA_MAX` can be
+`MALLOC_ARENA_MAX` can be overridden the same way, but raising it lets RSS climb
-overridden the same way, but raising it lets RSS climb again on a many-core
+again on a many-core host.
 host.
 What happens at each limit:
 - Go soft limit: as the heap approaches `GOMEMLIMIT`, the runtime runs garbage
  collection more aggressively rather than growing further.
- SQLite: at the 768 MiB soft heap limit it recycles its page cache instead of
+- SQLite: at the 1.5 GiB soft heap limit it recycles its page cache instead of
-  allocating more. At the 1 GiB hard heap limit a statement fails with an
+  allocating more; at the 2 GiB hard heap limit a statement fails with an
-  out-of-memory error, and the handler logs it. The prefix handler writes the
+  out-of-memory error, and the handler logs it and drops that batch. The process
-  routing table's changes again on a later write. The other writes drop their
+  keeps running.
  batch. The process keeps running.
 - Handler queues: each of the four handler queues holds at most 20,000 messages.
  When a queue fills, the streamer drops messages instead of blocking, except a
  `STATE` message, which it holds, in feed order, until there is room: a few
  hundred bytes each, about ten a second.
 - Handler batches: while the AS, peer or prefix handler writes a batch to the
-  database, the updates that arrive collect in its next batch. That batch stops
+  database, the updates that arrive collect in its next batch, which stops at
-  at ten times the batch size:
+  ten times the batch size: 300,000 updates for the AS handler
-    - 300,000 updates for the AS handler (`asnBatchMaxSize`, about 10 MiB);
+  (`asnBatchMaxSize`, about 10 MiB), 100,000 for the peer handler
-    - 100,000 for the peer handler (`peerBatchMaxSize`, about 10 MiB);
+  (`peerBatchMaxSize`, about 10 MiB) and 250,000 for the prefix handler
-    - 250,000 for the prefix handler (`prefixBatchMaxSize`, about 15 MiB).
+  (`prefixBatchMaxSize`, about 60 MiB). At that size the handler takes nothing
-
+  more off its queue until the write ends, so the queue fills and the streamer
-    At that size the handler takes nothing more off its queue until the write
+  drops messages as above. When the delete of a peer's live routes after its
-    ends. The queue then fills, and the streamer drops messages as above. With
+  session went down fails, the prefix handler keeps the updates the peer sent
-    the batches being written, the three handlers' batches take at most about
+  after the down for the next write, which retries the delete first; on top of
-    0.1 GiB of the Go heap.
+  its 250,000 it keeps at most the last 25,000 of them (`prefixBatchSize`, about
  6 MiB) and drops and logs the older ones, so while the delete keeps failing
  the other peers' updates still come off the queue. With the batches being
  written, the three handlers' batches take at most about 0.25 GiB of the Go
  heap's 1.5 GiB.
 With `DEBUG=routewatch` the daemon logs a `System stats` line every 60 seconds
 with the goroutine count and Go memory figures.
@@ -547,25 +382,25 @@ What the [upaas](https://git.eeqj.de/sneak/upaas) app needs:
 - Health check: the image's `HEALTHCHECK` requests
  `/.well-known/healthcheck.json` on the container port. upaas reads the
  container's health 60 seconds after a deploy and fails the deploy unless it is
-  `healthy`. For the first 60 seconds, Docker 25 and later runs the check every
+  `healthy`.
  5 seconds, and the first pass makes the container healthy. Startup first reads
  the routing table, which takes about 25 seconds when the table is full.
 - Stop grace: the container needs 9 seconds between SIGTERM and SIGKILL. upaas
  gives 10 (`stopTimeoutSeconds` in its `internal/docker/client.go`), as
  `docker stop` does by default. The daemon allows 8 seconds for the handlers to
-  write what they hold and for the requests in progress to finish. Then it stops
+  write what they hold and for the requests in progress to finish, then stops
  the HTTP server, closes the database and exits with status 0. A longer grace
  changes nothing. What is not written after 8 seconds is lost, and the streamer
-  and each handler log how much.
+  and each handler log how much. When the prefix handler has fallen behind the
-    - The prefix handler's last write takes at most 20,000 of the routing
+  feed, a stop loses far more: its batch is full at 250,000 updates and the
-      table's changed pairs. A full-table peer's session going down changes
+  streamer's worker for it waits for room, so the streamer's stop takes the
-      about a million pairs, which take about a minute to write. A stop in that
+  whole 8 seconds and every handler then skips its last write. Lost then are the
-      minute leaves the rest unwritten.
+  messages left on the four handlers' queues, what the AS, peer and peering
-    - A lost withdrawal or peer down leaves its routes in the `routes` table,
+  handlers hold, the prefix handler's batch, and the write it has in progress,
-      and the next start reads them back. They stay until the peer sends another
+  up to another 250,000 updates, which take about 20 seconds and are cut off by
-      update for the prefix, or its session goes down.
+  the exit; withdrawals and peer downs are among them. A route withdrawn in them
-    - When the 8 seconds run out the database is not closed. When the database
+  stays in the live route table until its peer announces or withdraws the prefix
-      next opens, SQLite rolls back any write the exit cut off.
+  again or its session goes down. When the 8 seconds run out the database is not
  closed, and SQLite rolls back a write the exit cut off when the database next
  opens.
 ## Development
@@ -613,11 +448,6 @@ provide:
  or `go.sum`) and `go fmt` (writes), then `script/check`
 - `script/install-precommit` — install the git pre-commit hook that runs
  `script/precommit`
 - `script/asupdate` — rebuild the AS list built into RouteWatch,
  `pkg/asinfo/asdata.json.gz`, from the `as.csv` file of
  [ipverse/as-metadata](https://github.com/ipverse/as-metadata). It needs the
  network. It runs `cmd/asinfo-gen`, which fails when it finds no AS. When
  `cmd/asinfo-gen` fails, the old list stays and the script exits non-zero.
 Tests and the linter run only in Docker, as the `test` and `lint` phases of the
 `Dockerfile`; the image cannot be built unless both pass. Every `docker build`
@@ -25,121 +25,14 @@ are measured by a benchmark, not yet on the live feed.
 # Next Step
-Run `next` on the live feed, as README "Running under upaas" describes, until
+Run `next` on the live feed, as README "Running under upaas" describes, for the
-the routing table stops growing. Post its size and memory figures on
+final check https://git.eeqj.de/sneak/routewatch/issues/96 names: whether the
-https://git.eeqj.de/sneak/routewatch/issues/122. The same run makes the final
+prefix handler still drops updates after the first hour. If it does, a new issue
 check https://git.eeqj.de/sneak/routewatch/issues/96 names: whether the prefix
 handler still drops updates after the first hour. If it does, a new issue
 follows with the numbers. Then an audit of the code at the commit that run
 tested.
 # Completed Steps
 - 2026-10-27: the per-peer route tables are gone, with the code that wrote,
  counted and read them. The prefix handler applies each update to the routing
  table in memory and writes the table's changes every second. It also stores
  each new prefix with its first-seen time. The image's memory limits are set
  for a full routing table of about 1 GB: `GOMEMLIMIT` is 2.5 GiB, the writing
  connection's page cache 512 MiB, and SQLite's heap limits 768 MiB and 1 GiB
  (closes #122)
 - 2026-10-27: the pages, the API and the stats read every route from the routing
  table in memory. For a prefix with several origin ASes, the IP lookup gives
  the one most peers carry. Its `last_seen` is the newest kept route's time. The
  prefix page and API list every peer that carries the prefix, with an AS path,
  next hop and time only for the kept routes. The stats count the origins whose
  kept routes were all withdrawn, in `origins_without_kept_route` (part of #122)
 - 2026-10-27: the prefix, AS and peer handlers make a timed write on every tick
  of their timers, every 1, 2 and 2 seconds. They used to skip every other tick.
  A full batch's write restarts the timer, so the next timed write comes one
  interval after that write began (closes #192)
 - 2026-10-27: once the stop deadline has passed, the AS, peer and peering
  handlers start no write either. A full batch or a tick of the timer that
  waited while a write ran past the deadline could still start one. The flush
  goroutines of the prefix, AS and peer handlers now run the same code (closes
  #189)
 - 2026-10-27: once the stop deadline has passed, the prefix handler starts no
  flush. A batch that filled while a write ran past the deadline could still be
  written after it (closes #188)
 - 2026-10-27: the prefix handler applies each update to the routing table in
  memory, and writes the table's changes to the database every second. A write
  takes at most 20,000 changed pairs, and the rest follow in the next writes. A
  failed write is written again later. Startup reads the table before the
  streamer connects. The pages still read the per-peer route tables (part of
  #122)
 - 2026-10-27: the database keeps a copy of the whole routing table in a new
  `routes` table, one row per prefix and origin AS. The peers' numbers are in a
  new `route_peers` table. One function writes the pairs that changed in memory,
  and another reads the whole table back into memory at startup. Nothing uses
  them yet (part of #122)
 - 2026-10-27: a new package, `internal/routetable`, holds the whole routing
  table in memory. For each prefix and origin AS it keeps the peers that carry
  it, one bit per peer, and the two newest of their routes. Nothing uses it yet
  (part of #122)
 - 2026-10-27: each result of the IP lookup lists the public blocklists the
  address is on, in `blocklists`. The lists are DShield, Feodo Tracker, two
  FireHOL lists, Spamhaus DROP and the Tor exit list. RouteWatch downloads each
  list on its own schedule and answers from copies in memory. The copies are
  also kept in the state directory's `blocklists` directory. IP lookup answers
  carry `Cache-Control`. An address with no live route now has a result too,
  without route fields, so the IP lookup no longer answers 404 (closes #158)
 - 2026-10-27: the home page has an IP information API card. It shows the `curl`
  command that looks up the visitor's own address at `/ip/{addr}`, and that
  command's live answer (closes #156)
 - 2026-10-27: on the AS page, a click on the heading of the IPv4 or the IPv6
  prefix list folds or unfolds the list. Both lists start open (closes #155)
 - 2026-10-27: the AS page lists its IPv4 and its IPv6 prefixes by mask length,
  shortest first, and prefixes of one mask length by address. They used to be
  listed by address (closes #153)
 - 2026-10-27: on `/` and `/status`, a spinner beside the status turns one frame
  each time the stats show more messages than the time before. A page that has
  not seen more messages for three refreshes shows "stale" and the time since
  then instead, in red (closes #152)
 - 2026-10-27: the WHOIS details of a Brazilian AS keep their accented letters.
  LACNIC's answer for such an AS comes from NIC.br, Brazil's registry, with each
  accented letter replaced. The details now come from NIC.br's own server,
  `whois.registro.br`. When that query fails, the details from LACNIC's answer
  are kept and a warning is logged. After NIC.br answers that RouteWatch is over
  its query limit, RouteWatch stops asking NIC.br for an hour (closes #174)
 - 2026-10-27: `make asupdate` stops with an error when the download of `as.csv`
  breaks off. The generator used to retry the failed read forever. A record that
  does not parse is still logged and skipped (closes #177)
 - 2026-10-27: `make asupdate` runs the new `script/asupdate`. It replaces the AS
  list built into RouteWatch only when the generator succeeds and finds at least
  one AS. A failed download used to replace the list with an empty file. The
  generator reads `as.csv` from `ipverse/as-metadata`, the source's new name
  (closes #173)
 - 2026-10-27: the WHOIS details of an AS at RIPE, APNIC or AFRINIC come only
  from its `aut-num` object and the organisation object it names. RIPE and APNIC
  start their answer with the `as-block` object of the AS's block. Its dates
  were stored as the AS's (closes #168)
 - 2026-10-27: AS names keep their accented letters. The AS list built into
  RouteWatch is rebuilt from today's `as.csv`, which added a country code
  column. That file no longer lists AS 0 or the documentation AS numbers. A
  WHOIS answer that is not valid UTF-8 is decoded as Latin-1, which RIPE and
  APNIC send, before it is parsed and stored (closes #165)
 - 2026-10-27: the Age column on the AS and prefix pages reads in words, such as
  "5 minutes ago" or "2 weeks ago", instead of Go durations such as "360h0m0s
  ago". An age under a minute reads in seconds, and one over a month in months
  or years instead of a date (closes #163)
 - 2026-10-26: a write to a stored AS, peering or peer keeps the earlier of the
  two first-seen times and the later of the two last-seen times. An old update
  from a collector catching up on a backlog no longer moves last seen back
  (closes #162)
 - 2026-10-26: the status page shows "Route Churn/min", the number of prefix
  announcements and withdrawals, from all peers, in the last full clock minute.
  `/api/v1/stats` reports it as `route_churn_per_min` in `stream`, which
  replaces the moving average `route_churn_per_sec`. The messages and updates
  per second on `/` and `/status` are whole numbers (closes #160)
 - 2026-10-26: the WHOIS fetcher backs off more slowly. A failure makes its wait
  1.5 times as long, up to one minute instead of five. Its queries to RIPE,
  APNIC and AFRINIC leave out person and role objects, which RIPE counts against
  a daily limit per address. A refused query is logged with the RIR's error line
  (closes #159)
 - 2026-10-26: the home page's AS name search lists the ASes whose handle or
  description holds the text, as links to their pages, from the new
  `/api/v1/search/as`; the search ignores case. When the database has no record
  of an AS, its page takes the handle and description from the AS list built
  into RouteWatch and still lists the AS's prefixes (closes #151)
 - 2026-10-19: README "HTTP Endpoints" lists every route with what it answers,
  "Database Schema" matches `schema.sql`, and the rest of the README matches the
  code; this file brought up to date (closes #72)
@@ -286,4 +179,4 @@ tested.
 # Future Steps
-None.
+None open.
@@ -6,7 +6,6 @@ import (
 	"encoding/csv"
 	"encoding/json"
 	"errors"
 	"fmt"
 	"io"
 	"log"
 	"net/http"
@@ -15,21 +14,7 @@ import (
 	"strings"
 )
-const asCsvURL = "https://github.com/ipverse/as-metadata/raw/refs/heads/master/as.csv"
+const asCsvURL = "https://github.com/ipverse/asn-info/raw/refs/heads/master/as.csv"
 // The first columns of as.csv, the ones the generator reads. It reads past
 // the columns after them, such as the country code.
 const (
 	asnColumn         = "asn"
 	handleColumn      = "handle"
 	descriptionColumn = "description"
 	columnsRead       = 3
 )
 var (
 	errUnexpectedHeader = errors.New("unexpected CSV header")
 	errNoASes           = errors.New("no AS in the CSV")
 )
 // ASInfo represents information about an Autonomous System
 type ASInfo struct {
@@ -60,66 +45,40 @@ func main() {
 		log.Fatalf("Failed to fetch CSV: HTTP %d", resp.StatusCode)
 	}
-	asInfos, err := parseCSV(resp.Body)
+	// Parse CSV
-
+	reader := csv.NewReader(resp.Body)
 	// Closed here rather than deferred: log.Fatalf exits without running
 	// deferred calls.
 	_ = resp.Body.Close()
 	if err != nil {
 		log.Fatalf("Failed to parse CSV: %v", err)
 	}
 	log.Printf("Parsed %d AS records", len(asInfos))
 	// Convert to JSON and output to stdout
 	encoder := json.NewEncoder(os.Stdout)
 	encoder.SetIndent("", "\t")
 	err = encoder.Encode(asInfos)
 	if err != nil {
 		log.Fatalf("Failed to encode JSON: %v", err)
 	}
 }
 // parseCSV reads as.csv from r and returns its ASes, with the handle and the
 // description as the file spells them. A header whose first columns are not
 // the AS number, the handle and the description is an error. A record that
 // does not parse is logged and skipped. A read that fails, such as on a broken
 // download, is an error. A file left with no AS is an error.
 func parseCSV(r io.Reader) ([]ASInfo, error) {
 	reader := csv.NewReader(r)
 	// Read header
 	header, err := reader.Read()
 	if err != nil {
-		return nil, fmt.Errorf("read CSV header: %w", err)
+		log.Fatalf("Failed to read CSV header: %v", err)
 	}
-	if len(header) < columnsRead || header[0] != asnColumn ||
+	if len(header) != 3 || header[0] != "asn" || header[1] != "handle" ||
-		header[1] != handleColumn || header[2] != descriptionColumn {
+		header[2] != "description" {
-		return nil, fmt.Errorf("%w: %v", errUnexpectedHeader, header)
+		log.Fatalf("Unexpected CSV header: %v", header)
 	}
 	// Read all records
 	var asInfos []ASInfo
 	for {
 		// The reader returns an error for a record with a different number
 		// of fields than the header.
 		record, err := reader.Read()
 		if errors.Is(err, io.EOF) {
 			break
 		}
-		if _, ok := errors.AsType[*csv.ParseError](err); ok {
+		if err != nil {
 			log.Printf("Error reading CSV record: %v", err)
 			continue
 		}
-		// Any other error comes from the download, such as a broken
+		const expectedFields = 3
-		// connection. Every later read returns it again.
+		if len(record) != expectedFields {
-		if err != nil {
+			log.Printf("Skipping invalid record: %v", record)
-			return nil, fmt.Errorf("read CSV record: %w", err)
+
 			continue
 		}
 		asn, err := strconv.Atoi(record[0])
@@ -136,9 +95,18 @@ func parseCSV(r io.Reader) ([]ASInfo, error) {
 		})
 	}
-	if len(asInfos) == 0 {
+	// Closed here rather than deferred: log.Fatalf exits without running
-		return nil, errNoASes
+	// deferred calls.
-	}
+	_ = resp.Body.Close()
-	return asInfos, nil
+	log.Printf("Parsed %d AS records", len(asInfos))
 	// Convert to JSON and output to stdout
 	encoder := json.NewEncoder(os.Stdout)
 	encoder.SetIndent("", "\t")
 	err = encoder.Encode(asInfos)
 	if err != nil {
 		log.Fatalf("Failed to encode JSON: %v", err)
 	}
 }
@@ -1,142 +0,0 @@
 package main
 import (
 	"errors"
 	"io"
 	"slices"
 	"strings"
 	"testing"
 	"testing/iotest"
 	"time"
 )
 // parseTimeLimit is how long a test waits for parseCSV to return before it
 // fails.
 const parseTimeLimit = 2 * time.Second
 // TestParseCSVReadsTodaysLayout parses an as.csv with the country code column
 // that the source added after the description. It expects each AS with its
 // handle and description spelled exactly as in the file, accents included.
 func TestParseCSVReadsTodaysLayout(t *testing.T) {
 	t.Parallel()
 	const asCSV = `asn,handle,description,country-code
 1,LVLT-1,Level 3 Parent LLC,US
 1251,FUNDACAO-AMPARO-PESQUISA,FUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO SÃO PAULO,BR
 `
 	got, err := parseCSV(strings.NewReader(asCSV))
 	if err != nil {
 		t.Fatalf("parseCSV: %v", err)
 	}
 	want := []ASInfo{
 		{ASN: 1, Handle: "LVLT-1", Description: "Level 3 Parent LLC"},
 		{
 			ASN:    1251,
 			Handle: "FUNDACAO-AMPARO-PESQUISA",
 			Description: "FUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO " +
 				"SÃO PAULO",
 		},
 	}
 	if !slices.Equal(got, want) {
 		t.Errorf("parseCSV = %+v, want %+v", got, want)
 	}
 }
 // TestParseCSVRejectsAnotherHeader parses files whose first columns are not
 // the AS number, the handle and the description. It expects an error rather
 // than a list read from the wrong columns.
 func TestParseCSVRejectsAnotherHeader(t *testing.T) {
 	t.Parallel()
 	for _, asCSV := range []string{
 		"asn,handle\n1,LVLT-1\n",
 		"asn,description,handle\n1,Level 3 Parent LLC,LVLT-1\n",
 	} {
 		_, err := parseCSV(strings.NewReader(asCSV))
 		if err == nil {
 			t.Errorf("parseCSV(%q): no error", asCSV)
 		}
 	}
 }
 // TestParseCSVRejectsAFileWithNoASes parses files that hold no AS, one with
 // only the header and one whose only record has no valid AS number. It
 // expects errNoASes, so that make asupdate keeps the old list.
 func TestParseCSVRejectsAFileWithNoASes(t *testing.T) {
 	t.Parallel()
 	for _, asCSV := range []string{
 		"asn,handle,description,country-code\n",
 		"asn,handle,description,country-code\nAS1,LVLT-1,Level 3,US\n",
 	} {
 		_, err := parseCSV(strings.NewReader(asCSV))
 		if !errors.Is(err, errNoASes) {
 			t.Errorf("parseCSV(%q) = %v, want %v", asCSV, err, errNoASes)
 		}
 	}
 }
 // TestParseCSVSkipsARecordThatDoesNotParse parses an as.csv with a record
 // that has too few fields between two valid records. It expects both valid
 // ASes and no error, so that one bad record does not stop make asupdate.
 func TestParseCSVSkipsARecordThatDoesNotParse(t *testing.T) {
 	t.Parallel()
 	const asCSV = "asn,handle,description,country-code\n" +
 		"1,LVLT-1,Level 3 Parent LLC,US\n" +
 		"2,UDEL-DCN\n" +
 		"3,MIT-GATEWAYS,Massachusetts Institute of Technology,US\n"
 	got, err := parseCSV(strings.NewReader(asCSV))
 	if err != nil {
 		t.Fatalf("parseCSV: %v", err)
 	}
 	want := []ASInfo{
 		{ASN: 1, Handle: "LVLT-1", Description: "Level 3 Parent LLC"},
 		{
 			ASN:         3,
 			Handle:      "MIT-GATEWAYS",
 			Description: "Massachusetts Institute of Technology",
 		},
 	}
 	if !slices.Equal(got, want) {
 		t.Errorf("parseCSV = %+v, want %+v", got, want)
 	}
 }
 // TestParseCSVStopsWhenTheDownloadBreaksOff parses an as.csv whose download
 // breaks off after the first record. From then on every read fails, as on a
 // broken connection. It expects parseCSV to return that error, so that make
 // asupdate keeps the old list.
 func TestParseCSVStopsWhenTheDownloadBreaksOff(t *testing.T) {
 	t.Parallel()
 	const asCSV = "asn,handle,description,country-code\n" +
 		"1,LVLT-1,Level 3 Parent LLC,US\n"
 	download := io.MultiReader(
 		strings.NewReader(asCSV), iotest.ErrReader(io.ErrUnexpectedEOF))
 	// parseCSV runs on its own goroutine, so that a parseCSV that never
 	// returns fails the test instead of hanging it.
 	parsed := make(chan error, 1)
 	go func() {
 		_, err := parseCSV(download)
 		parsed <- err
 	}()
 	select {
 	case err := <-parsed:
 		if !errors.Is(err, io.ErrUnexpectedEOF) {
 			t.Errorf("parseCSV = %v, want %v", err, io.ErrUnexpectedEOF)
 		}
 	case <-time.After(parseTimeLimit):
 		t.Fatalf("parseCSV did not return within %v", parseTimeLimit)
 	}
 }
@@ -3,17 +3,13 @@ module git.eeqj.de/sneak/routewatch
 go 1.27.1
 require (
 	github.com/bits-and-blooms/bitset v1.26.0
 	github.com/dustin/go-humanize v1.0.1
 	github.com/go-chi/chi/v5 v5.2.2
 	github.com/google/btree v1.1.3
 	github.com/google/uuid v1.6.0
 	github.com/mattn/go-sqlite3 v1.14.29
 	github.com/rcrowley/go-metrics v0.0.0-20250401214520-65e299d6c5c9
 	go.uber.org/fx v1.24.0
 	go4.org/netipx v0.0.0-20260823151212-3075585bcbeb
 	golang.org/x/term v0.33.0
 	golang.org/x/text v0.43.0
 )
 require (
@@ -1,13 +1,9 @@
 github.com/bits-and-blooms/bitset v1.26.0 h1:WPvcPZbP1yuKofmjs2SYIFO1EjzIGhCP9ducElLsh5Q=
 github.com/bits-and-blooms/bitset v1.26.0/go.mod h1:7hO7Gc7Pp1vODcmWvKMRA9BNmbv6a/7QIWpPxHddWR8=
 github.com/davecgh/go-spew v1.1.1 h1:vj9j/u1bqnvCEfJOwUhtlOARqs3+rkHYY13jYWTU97c=
 github.com/davecgh/go-spew v1.1.1/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38=
 github.com/dustin/go-humanize v1.0.1 h1:GzkhY7T5VNhEkwH0PVJgjz+fX1rhBrR7pRT3mDkpeCY=
 github.com/dustin/go-humanize v1.0.1/go.mod h1:Mu1zIs6XwVuF/gI1OepvI0qD18qycQx+mFykh5fBlto=
 github.com/go-chi/chi/v5 v5.2.2 h1:CMwsvRVTbXVytCk1Wd72Zy1LAsAh9GxMmSNWLHCG618=
 github.com/go-chi/chi/v5 v5.2.2/go.mod h1:L2yAIGWB3H+phAw1NxKwWM+7eUH/lU8pOMm5hHcoops=
 github.com/google/btree v1.1.3 h1:CVpQJjYgC4VbzxeGVHfvZrv1ctoYCAI8vbl07Fcxlyg=
 github.com/google/btree v1.1.3/go.mod h1:qOPhT0dTNdNzV6Z/lhRX0YXUafgPLFUh+gZMl761Gm4=
 github.com/google/uuid v1.6.0 h1:NIvaJDMOsjHA8n1jAhLSgzrAzy1Hgr+hNrb57e+94F0=
 github.com/google/uuid v1.6.0/go.mod h1:TIyPZe4MgqvfeYDBFedMoGGpEw/LqOeaOT+nhxU+yHo=
 github.com/mattn/go-sqlite3 v1.14.29 h1:1O6nRLJKvsi1H2Sj0Hzdfojwt8GiGKm+LOfLaBFaouQ=
@@ -28,13 +24,9 @@ go.uber.org/multierr v1.10.0 h1:S0h4aNzvfcFsC3dRF1jLoaov7oRaKqRGC/pUEJ2yvPQ=
 go.uber.org/multierr v1.10.0/go.mod h1:20+QtiLqy0Nd6FdQB9TLXag12DsQkrbs3htMFfDN80Y=
 go.uber.org/zap v1.26.0 h1:sI7k6L95XOKS281NhVKOFCUNIvv9e0w4BF8N3u+tCRo=
 go.uber.org/zap v1.26.0/go.mod h1:dtElttAiwGvoJ/vj4IwHBS/gXsEu/pZ50mUIRWuG0so=
 go4.org/netipx v0.0.0-20260823151212-3075585bcbeb h1:XBM4hvfwGAttkkiTIFfeigdfcL1xIfdKXqFdgiHGtDs=
 go4.org/netipx v0.0.0-20260823151212-3075585bcbeb/go.mod h1:PLyyIXexvUFg3Owu6p/WfdlivPbZJsZdgWZlrGope/Y=
 golang.org/x/sys v0.34.0 h1:H5Y5sJ2L2JRdyv7ROF1he/lPdvFsd0mJHFw2ThKHxLA=
 golang.org/x/sys v0.34.0/go.mod h1:BJP2sWEmIv4KK5OTEluFJCKSidICx8ciO85XgH3Ak8k=
 golang.org/x/term v0.33.0 h1:NuFncQrRcaRvVmgRkvM3j/F00gWIAlcmlB8ACEKmGIg=
 golang.org/x/term v0.33.0/go.mod h1:s18+ql9tYWp1IfpV9DmCtQDDSRBUjKaw9M1eAv5UeF0=
 golang.org/x/text v0.43.0 h1:1QivrlhwAsnMOcqgOdl9my7s9OyZl8O5/UGUTJVXoWc=
 golang.org/x/text v0.43.0/go.mod h1:hbSIYA/amXcRXTFSZqh8tWHEoqRvvbKPJ2uz/KU+a+s=
 gopkg.in/yaml.v3 v3.0.1 h1:fxVm/GzAzEWqLHuvctI91KS9hhNmmWOoWu0XTYJS7CA=
 gopkg.in/yaml.v3 v3.0.1/go.mod h1:K4uyk7z7BCEPqu6E+C64Yfv1cQ7kz7rIZviUmN+EgEM=
@@ -1,184 +0,0 @@
 // Package blocklist downloads public IP blocklists on a schedule, keeps the
 // last good copy of each on disk and in memory, and answers which lists
 // contain an address.
 package blocklist
 import (
 	"context"
 	"log/slog"
 	"net/netip"
 	"sync"
 	"time"
 	"go4.org/netipx"
 )
 // Format is how a list's file is written.
 type Format int
 const (
 	// FormatLines has one address or network per line, such as 192.0.2.1 or
 	// 192.0.2.0/24. Lines that start with # are comments.
 	FormatLines Format = iota
 	// FormatSpamhausJSON has one JSON object per line, with a network in its
 	// cidr field. The last line holds the file's metadata and no network.
 	FormatSpamhausJSON
 	// FormatDShield has one network per line, as tab-separated fields that
 	// start with the network's first and last address. Lines that start
 	// with # are comments.
 	FormatDShield
 )
 // List is one public blocklist.
 type List struct {
 	// Name names the list in lookup answers, and names its copy on disk.
 	Name string
 	// Description says in one line what being on the list means.
 	Description string
 	// URL is where the publisher serves the whole list.
 	URL string
 	// Interval is how long a copy is used before the list is downloaded
 	// again.
 	Interval time.Duration
 	// Format is how the list's file is written.
 	Format Format
 }
 // Listing says that a list contains an address.
 type Listing struct {
 	Name        string `json:"name"`
 	Description string `json:"description"`
 	// Updated is when routewatch last downloaded the list, or last heard from
 	// its publisher that its copy was still current.
 	Updated time.Time `json:"updated"`
 }
 // listCopy is a list's last good copy in memory.
 type listCopy struct {
 	addresses *netipx.IPSet
 	updated   time.Time
 	// validators identify the version of the list this copy holds.
 	validators validators
 }
 // Params is what New needs.
 type Params struct {
 	// Dir is the directory that holds the copies on disk.
 	Dir string
 	// Lists are the lists to download and look addresses up in.
 	Lists []List
 	Logger *slog.Logger
 }
 // Blocklists keeps a copy of each list and answers which lists contain an
 // address. Start loads the copies from disk and starts downloading the lists.
 type Blocklists struct {
 	dir    string
 	lists  []List
 	logger *slog.Logger
 	// copies holds each list's last good copy, by list name. A list with no
 	// good copy yet has none.
 	mu     sync.RWMutex
 	copies map[string]listCopy
 	// stop ends the goroutine Start runs, and done is closed when it returns.
 	stop context.CancelFunc
 	done chan struct{}
 }
 // New returns a Blocklists with no copies. Start loads them.
 func New(params Params) *Blocklists {
 	return &Blocklists{
 		dir:    params.Dir,
 		lists:  params.Lists,
 		logger: params.Logger.With("component", "blocklists"),
 		copies: make(map[string]listCopy),
 		done:   make(chan struct{}),
 	}
 }
 // Lookup returns a Listing for each list whose copy contains addr, in the
 // order of the lists given to New. It makes no outside request. When no list
 // contains addr, it returns an empty list, not nil.
 func (b *Blocklists) Lookup(addr netip.Addr) []Listing {
 	b.mu.RLock()
 	defer b.mu.RUnlock()
 	listings := []Listing{}
 	for _, list := range b.lists {
 		c, ok := b.copies[list.Name]
 		if ok && c.addresses.Contains(addr.Unmap()) {
 			listings = append(listings, Listing{
 				Name:        list.Name,
 				Description: list.Description,
 				Updated:     c.updated,
 			})
 		}
 	}
 	return listings
 }
 // ShortestInterval returns the shortest Interval of the lists. That is the
 // soonest a copy can change, and so how long a lookup answer stays current.
 func (b *Blocklists) ShortestInterval() time.Duration {
 	var shortest time.Duration
 	for i, list := range b.lists {
 		if i == 0 || list.Interval < shortest {
 			shortest = list.Interval
 		}
 	}
 	return shortest
 }
 // updated returns when the named list's copy was last downloaded or found
 // current, or the zero time when the list has no copy.
 func (b *Blocklists) updated(name string) time.Time {
 	b.mu.RLock()
 	defer b.mu.RUnlock()
 	return b.copies[name].updated
 }
 // copyValidators returns the validators of the named list's copy. They are
 // empty when the list has no copy.
 func (b *Blocklists) copyValidators(name string) validators {
 	b.mu.RLock()
 	defer b.mu.RUnlock()
 	return b.copies[name].validators
 }
 // setCopy makes c the named list's copy.
 func (b *Blocklists) setCopy(name string, c listCopy) {
 	b.mu.Lock()
 	defer b.mu.Unlock()
 	b.copies[name] = c
 }
 // setUpdated records that the named list's copy was found current at t.
 func (b *Blocklists) setUpdated(name string, t time.Time) {
 	b.mu.Lock()
 	defer b.mu.Unlock()
 	c, ok := b.copies[name]
 	if ok {
 		c.updated = t
 		b.copies[name] = c
 	}
 }
@@ -1,494 +0,0 @@
 package blocklist
 import (
 	"context"
 	"errors"
 	"io"
 	"io/fs"
 	"log/slog"
 	"net/http"
 	"net/http/httptest"
 	"net/netip"
 	"os"
 	"path/filepath"
 	"strings"
 	"sync"
 	"testing"
 	"time"
 )
 // The test list's name and description, the address its good version lists,
 // and the address a newer version lists instead.
 const (
 	testListName        = "test_list"
 	testListDescription = "On the test list"
 	listedAddr          = "192.0.2.1"
 	goodListBody        = "# A test list\n" + listedAddr + "\n"
 	newListedAddr       = "192.0.2.2"
 	newListBody         = "# A test list\n" + newListedAddr + "\n"
 )
 // testETag is the ETag a publisher sends with a version of the test list.
 const testETag = `"v1"`
 // maxWait is how long a test waits for the download goroutine.
 const maxWait = 10 * time.Second
 // publisher stands in for a list's publisher. It answers every request with
 // its status and body, and keeps the headers of each request. A 200 answer
 // carries lastModified and etag, when set, as Last-Modified and ETag. As
 // from a real publisher, a request whose If-None-Match or If-Modified-Since
 // matches them is answered "not modified".
 type publisher struct {
 	mu           sync.Mutex
 	status       int
 	body         string
 	lastModified time.Time
 	etag         string
 	headers      []http.Header
 }
 // newPublisher starts a publisher that answers 200 with body, and returns it
 // and its URL.
 func newPublisher(t *testing.T, body string) (*publisher, string) {
 	t.Helper()
 	p := &publisher{status: http.StatusOK, body: body}
 	srv := httptest.NewServer(p)
 	t.Cleanup(srv.Close)
 	return p, srv.URL
 }
 func (p *publisher) ServeHTTP(w http.ResponseWriter, r *http.Request) {
 	p.mu.Lock()
 	defer p.mu.Unlock()
 	p.headers = append(p.headers, r.Header.Clone())
 	if p.status != http.StatusOK {
 		w.WriteHeader(p.status)
 		_, _ = io.WriteString(w, p.body)
 		return
 	}
 	if p.etag != "" {
 		w.Header().Set(etagHeader, p.etag)
 	}
 	// ServeContent sends Last-Modified unless lastModified is zero, and
 	// answers "not modified" when the request's conditions match.
 	http.ServeContent(w, r, testListName, p.lastModified,
 		strings.NewReader(p.body))
 }
 // answer makes the publisher answer later requests with status and body.
 func (p *publisher) answer(status int, body string) {
 	p.mu.Lock()
 	defer p.mu.Unlock()
 	p.status, p.body = status, body
 }
 // publish makes the publisher answer later requests with a version of the
 // list: body, with lastModified and etag. A zero lastModified or an empty
 // etag is not sent.
 func (p *publisher) publish(body string, lastModified time.Time, etag string) {
 	p.mu.Lock()
 	defer p.mu.Unlock()
 	p.status, p.body = http.StatusOK, body
 	p.lastModified, p.etag = lastModified, etag
 }
 // requests returns the headers of the requests the publisher has had.
 func (p *publisher) requests() []http.Header {
 	p.mu.Lock()
 	defer p.mu.Unlock()
 	return append([]http.Header(nil), p.headers...)
 }
 // testList returns a list served at url, written in format.
 func testList(url string, format Format) List {
 	return List{
 		Name:        testListName,
 		Description: testListDescription,
 		URL:         url,
 		Interval:    time.Hour,
 		Format:      format,
 	}
 }
 func newTestBlocklists(dir string, list List) *Blocklists {
 	return New(Params{
 		Dir:    dir,
 		Lists:  []List{list},
 		Logger: slog.New(slog.DiscardHandler),
 	})
 }
 // lookup looks addr up in b.
 func lookup(t *testing.T, b *Blocklists, addr string) []Listing {
 	t.Helper()
 	return b.Lookup(netip.MustParseAddr(addr))
 }
 // TestLookupFindsListedAddresses downloads a list in each format and looks
 // up addresses on it, inside its networks, and off it, in IPv4 and IPv6.
 // A listed address has one listing that names the list; any other has an
 // empty list of listings.
 func TestLookupFindsListedAddresses(t *testing.T) {
 	t.Parallel()
 	tests := []struct {
 		name     string
 		format   Format
 		body     string
 		listed   []string
 		unlisted []string
 	}{
 		{
 			name:     "single addresses",
 			format:   FormatLines,
 			body:     "# comment\n192.0.2.1\n\n2001:db8::1\n",
 			listed:   []string{"192.0.2.1", "::ffff:192.0.2.1", "2001:db8::1"},
 			unlisted: []string{"192.0.2.2", "2001:db8::2"},
 		},
 		{
 			name:     "networks",
 			format:   FormatLines,
 			body:     "# comment\n198.51.100.0/24\n2001:db8:1::/48\n",
 			listed:   []string{"198.51.100.0", "198.51.100.255", "2001:db8:1::5"},
 			unlisted: []string{"198.51.101.0", "2001:db8:2::1"},
 		},
 		{
 			name:   "Spamhaus networks",
 			format: FormatSpamhausJSON,
 			body: `{"cidr":"203.0.113.0/25","sblid":"SBL1","rir":"arin"}` + "\n" +
 				`{"cidr":"2001:db8:3::/48","sblid":"SBL2","rir":"ripencc"}` + "\n" +
 				`{"type":"metadata","timestamp":1793074442,"records":2}` + "\n",
 			listed:   []string{"203.0.113.1", "2001:db8:3::1"},
 			unlisted: []string{"203.0.113.200", "2001:db8:4::1"},
 		},
 		{
 			name:   "DShield networks",
 			format: FormatDShield,
 			body: "#   DShield.org Recommended Block List\n" +
 				"192.0.2.0\t192.0.2.255\t24\t327\tEXAMPLE\tUS\tNone\n",
 			listed:   []string{"192.0.2.0", "192.0.2.77"},
 			unlisted: []string{"192.0.3.1", "2001:db8::1"},
 		},
 	}
 	for _, tt := range tests {
 		t.Run(tt.name, func(t *testing.T) {
 			t.Parallel()
 			_, url := newPublisher(t, tt.body)
 			b := newTestBlocklists(t.TempDir(), testList(url, tt.format))
 			err := b.download(t.Context(), b.lists[0])
 			if err != nil {
 				t.Fatalf("download: %v", err)
 			}
 			for _, addr := range tt.listed {
 				listings := lookup(t, b, addr)
 				if len(listings) != 1 || listings[0].Name != testListName ||
 					listings[0].Description != testListDescription ||
 					listings[0].Updated.IsZero() {
 					t.Errorf("%s: listings %+v, want one for %s", addr,
 						listings, testListName)
 				}
 			}
 			for _, addr := range tt.unlisted {
 				listings := lookup(t, b, addr)
 				if listings == nil || len(listings) != 0 {
 					t.Errorf("%s: listings %#v, want an empty list", addr, listings)
 				}
 			}
 		})
 	}
 }
 // TestFailedDownloadKeepsThePreviousCopy downloads a good version of a list,
 // then one that fails. The good copy stays in memory and on disk, and no
 // part of the failed download is left beside it.
 func TestFailedDownloadKeepsThePreviousCopy(t *testing.T) {
 	t.Parallel()
 	tests := []struct {
 		name   string
 		status int
 		body   string
 	}{
 		{"server error", http.StatusInternalServerError, "unavailable"},
 		{"not a list", http.StatusOK, "<!DOCTYPE html>\n<html></html>\n"},
 		{
 			"over the size limit", http.StatusOK,
 			strings.Repeat(listedAddr+"\n", maxDownloadSize/len(listedAddr)),
 		},
 	}
 	for _, tt := range tests {
 		t.Run(tt.name, func(t *testing.T) {
 			t.Parallel()
 			dir := t.TempDir()
 			p, url := newPublisher(t, goodListBody)
 			b := newTestBlocklists(dir, testList(url, FormatLines))
 			err := b.download(t.Context(), b.lists[0])
 			if err != nil {
 				t.Fatalf("first download: %v", err)
 			}
 			before := lookup(t, b, listedAddr)
 			p.answer(tt.status, tt.body)
 			err = b.download(t.Context(), b.lists[0])
 			if err == nil {
 				t.Fatal("second download returned no error")
 			}
 			after := lookup(t, b, listedAddr)
 			if len(after) != 1 || len(before) != 1 ||
 				!after[0].Updated.Equal(before[0].Updated) {
 				t.Errorf("listings %+v after the failure, want %+v", after, before)
 			}
 			copies := os.DirFS(dir)
 			onDisk, err := fs.ReadFile(copies, testListName)
 			if err != nil || string(onDisk) != goodListBody {
 				t.Errorf("copy on disk %q (%v), want %q", onDisk, err, goodListBody)
 			}
 			_, err = fs.Stat(copies, testListName+downloadSuffix)
 			if !errors.Is(err, fs.ErrNotExist) {
 				t.Errorf("the failed download's file is still there (%v)", err)
 			}
 		})
 	}
 }
 // TestRestartLoadsCopiesFromDisk downloads a list, then starts a new
 // Blocklists on the same directory, as a restart does. The new one answers
 // from the copy on disk at once, and does not download the list again while
 // the copy is younger than the list's interval.
 func TestRestartLoadsCopiesFromDisk(t *testing.T) {
 	t.Parallel()
 	dir := t.TempDir()
 	p, url := newPublisher(t, goodListBody)
 	list := testList(url, FormatLines)
 	first := newTestBlocklists(dir, list)
 	err := first.download(t.Context(), list)
 	if err != nil {
 		t.Fatalf("download: %v", err)
 	}
 	downloaded := lookup(t, first, listedAddr)[0].Updated
 	second := newTestBlocklists(dir, list)
 	second.Start(t.Context())
 	second.Stop(t.Context())
 	listings := lookup(t, second, listedAddr)
 	if len(listings) != 1 ||
 		listings[0].Updated.Sub(downloaded).Abs() > time.Second {
 		t.Errorf("after the restart, listings %+v, want one updated at %s",
 			listings, downloaded)
 	}
 	if got := len(p.requests()); got != 1 {
 		t.Errorf("the publisher had %d requests, want 1", got)
 	}
 }
 // TestStartRefreshesAnOldCopy starts on a copy older than its list's
 // interval. The list is downloaded at once, with routewatch's User-Agent and
 // the Last-Modified and ETag the publisher sent with the copy, kept on disk.
 // The publisher answers that the copy is still current, so the copy is kept
 // and marked as updated now.
 func TestStartRefreshesAnOldCopy(t *testing.T) {
 	t.Parallel()
 	dir := t.TempDir()
 	p, url := newPublisher(t, goodListBody)
 	list := testList(url, FormatLines)
 	lastModified := time.Now().Add(-3 * list.Interval).UTC().Truncate(time.Second)
 	p.publish(goodListBody, lastModified, testETag)
 	err := newTestBlocklists(dir, list).download(t.Context(), list)
 	if err != nil {
 		t.Fatalf("download: %v", err)
 	}
 	old := time.Now().Add(-2 * list.Interval).UTC().Truncate(time.Second)
 	err = os.Chtimes(filepath.Join(dir, testListName), old, old)
 	if err != nil {
 		t.Fatalf("Chtimes: %v", err)
 	}
 	b := newTestBlocklists(dir, list)
 	b.Start(t.Context())
 	deadline := time.Now().Add(maxWait)
 	for !lookup(t, b, listedAddr)[0].Updated.After(old) {
 		if time.Now().After(deadline) {
 			t.Fatalf("the copy was not marked updated within %s", maxWait)
 		}
 		time.Sleep(time.Millisecond)
 	}
 	b.Stop(t.Context())
 	requests := p.requests()
 	last := requests[len(requests)-1]
 	want := lastModified.Format(http.TimeFormat)
 	if got := last.Get(ifModifiedSinceHeader); got != want {
 		t.Errorf("If-Modified-Since %q, want %q", got, want)
 	}
 	if got := last.Get(ifNoneMatchHeader); got != testETag {
 		t.Errorf("If-None-Match %q, want %q", got, testETag)
 	}
 	if got := last.Get(userAgentHeader); got != userAgent {
 		t.Errorf("User-Agent %q, want %q", got, userAgent)
 	}
 }
 // TestNewVersionOlderThanTheLastDownloadReplacesTheCopy downloads a list.
 // The publisher then puts out a new version whose Last-Modified is earlier
 // than that download, as when a cache in front of the publisher passes the
 // version on late. The next download sends the Last-Modified of the copy,
 // not the time of the download, so it gets the new version.
 func TestNewVersionOlderThanTheLastDownloadReplacesTheCopy(t *testing.T) {
 	t.Parallel()
 	p, url := newPublisher(t, goodListBody)
 	list := testList(url, FormatLines)
 	b := newTestBlocklists(t.TempDir(), list)
 	firstVersion := time.Now().Add(-2 * list.Interval).UTC().Truncate(time.Second)
 	p.publish(goodListBody, firstVersion, "")
 	err := b.download(t.Context(), list)
 	if err != nil {
 		t.Fatalf("first download: %v", err)
 	}
 	p.publish(newListBody, firstVersion.Add(list.Interval), "")
 	err = b.download(t.Context(), list)
 	if err != nil {
 		t.Fatalf("second download: %v", err)
 	}
 	if listings := lookup(t, b, newListedAddr); len(listings) != 1 {
 		t.Errorf("%s: listings %+v, want one from the new version",
 			newListedAddr, listings)
 	}
 	want := firstVersion.Format(http.TimeFormat)
 	if got := p.requests()[1].Get(ifModifiedSinceHeader); got != want {
 		t.Errorf("If-Modified-Since %q, want %q", got, want)
 	}
 }
 // TestDownloadWithoutLastModifiedOrETagSendsNoCondition downloads a list
 // twice from a publisher that sends neither Last-Modified nor ETag. Neither
 // request carries If-Modified-Since or If-None-Match, so the second download
 // gets the whole list again.
 func TestDownloadWithoutLastModifiedOrETagSendsNoCondition(t *testing.T) {
 	t.Parallel()
 	p, url := newPublisher(t, goodListBody)
 	list := testList(url, FormatLines)
 	b := newTestBlocklists(t.TempDir(), list)
 	err := b.download(t.Context(), list)
 	if err != nil {
 		t.Fatalf("first download: %v", err)
 	}
 	err = b.download(t.Context(), list)
 	if err != nil {
 		t.Fatalf("second download: %v", err)
 	}
 	for i, request := range p.requests() {
 		if request.Get(ifModifiedSinceHeader) != "" ||
 			request.Get(ifNoneMatchHeader) != "" {
 			t.Errorf("request %d has a condition: %v", i, request)
 		}
 	}
 }
 // TestStopCancelsADownloadInProgress stops while the publisher has not
 // answered. Stop cancels the download and returns once the download
 // goroutine has stopped.
 func TestStopCancelsADownloadInProgress(t *testing.T) {
 	t.Parallel()
 	arrived := make(chan struct{})
 	var once sync.Once
 	srv := httptest.NewServer(http.HandlerFunc(
 		func(_ http.ResponseWriter, r *http.Request) {
 			once.Do(func() { close(arrived) })
 			<-r.Context().Done()
 		}))
 	t.Cleanup(srv.Close)
 	b := newTestBlocklists(t.TempDir(), testList(srv.URL, FormatLines))
 	b.Start(t.Context())
 	select {
 	case <-arrived:
 	case <-time.After(maxWait):
 		t.Fatalf("no download began within %s", maxWait)
 	}
 	ctx, cancel := context.WithTimeout(t.Context(), maxWait)
 	defer cancel()
 	b.Stop(ctx)
 	select {
 	case <-b.done:
 	default:
 		t.Error("Stop returned before the download goroutine stopped")
 	}
 }
 // TestPublicListsAreComplete checks that every public list has what a
 // download and a lookup answer need, and a unique name.
 func TestPublicListsAreComplete(t *testing.T) {
 	t.Parallel()
 	names := make(map[string]bool)
 	for _, list := range Lists() {
 		if list.Name == "" || list.Description == "" || list.URL == "" ||
 			list.Interval <= 0 || names[list.Name] {
 			t.Errorf("list %+v is incomplete or has a name used before", list)
 		}
 		names[list.Name] = true
 	}
 }
@@ -1,379 +0,0 @@
 package blocklist
 import (
 	"context"
 	"encoding/json"
 	"errors"
 	"fmt"
 	"io"
 	"io/fs"
 	"net/http"
 	"os"
 	"slices"
 	"time"
 	"go4.org/netipx"
 )
 // Limits of one download.
 const (
 	// downloadTimeout is how long one download may take.
 	downloadTimeout = time.Minute
 	// maxDownloadSize is the size of the largest list file accepted, in
 	// bytes. The largest list, FireHOL abusers, is about 2.5 MiB.
 	maxDownloadSize = 16 << 20
 )
 // The request headers a download sets.
 const (
 	userAgentHeader       = "User-Agent"
 	ifModifiedSinceHeader = "If-Modified-Since"
 	ifNoneMatchHeader     = "If-None-Match"
 	// userAgent names routewatch to the publishers.
 	userAgent = "routewatch (+https://git.eeqj.de/sneak/routewatch)"
 )
 // The response headers that identify the version of a list a publisher sent.
 const (
 	lastModifiedHeader = "Last-Modified"
 	etagHeader         = "ETag"
 )
 const (
 	// downloadSuffix ends the name of the file a download is written to,
 	// beside the list's copy, until it has parsed.
 	downloadSuffix = ".download"
 	// validatorsSuffix ends the name of the file beside a list's copy that
 	// keeps the copy's validators.
 	validatorsSuffix = ".validators"
 	// dirPermissions are those of the directory that holds the copies.
 	dirPermissions = 0o750
 	// validatorsPermissions are those of the file that keeps a copy's
 	// validators.
 	validatorsPermissions = 0o600
 )
 // validators are the Last-Modified and ETag headers a publisher sent with a
 // version of a list. A download sends them back, as If-Modified-Since and
 // If-None-Match, so that the publisher sends the list only when it has
 // changed. They are kept as the publisher wrote them.
 //
 //nolint:tagliatelle // snake_case keys, as the Go style guide asks
 type validators struct {
 	LastModified string `json:"last_modified,omitempty"`
 	ETag         string `json:"etag,omitempty"`
 }
 var (
 	errUnexpectedStatus = errors.New("unexpected HTTP status")
 	errTooLarge         = errors.New("list is over the size limit")
 )
 // Start loads each list's copy from disk. It then starts the goroutine that
 // downloads each list once its copy is older than its Interval, and a list
 // with no copy at once. The goroutine runs until Stop: the end of ctx does
 // not stop it.
 func (b *Blocklists) Start(ctx context.Context) {
 	err := os.MkdirAll(b.dir, dirPermissions)
 	if err != nil {
 		b.logger.Error("Failed to create the blocklists directory",
 			"dir", b.dir, "error", err)
 	}
 	nextDownload := make([]time.Time, len(b.lists))
 	for i, list := range b.lists {
 		loadErr := b.loadCopy(list)
 		if loadErr != nil && !errors.Is(loadErr, fs.ErrNotExist) {
 			b.logger.Error("Failed to load a blocklist copy",
 				"list", list.Name, "error", loadErr)
 		}
 		// A list with no copy has the zero time, so it is due at once.
 		nextDownload[i] = b.updated(list.Name).Add(list.Interval)
 	}
 	ctx, b.stop = context.WithCancel(context.WithoutCancel(ctx))
 	go func() {
 		b.run(ctx, nextDownload)
 	}()
 	b.logger.Info("Blocklist downloads started", "dir", b.dir)
 }
 // Stop stops the downloads, cancelling one in progress, and waits until the
 // goroutine has returned or ctx ends. The copies in memory stay, so Lookup
 // still answers.
 func (b *Blocklists) Stop(ctx context.Context) {
 	b.stop()
 	select {
 	case <-b.done:
 		b.logger.Info("Blocklist downloads stopped")
 	case <-ctx.Done():
 		b.logger.Warn("Stop deadline passed before the blocklist downloads " +
 			"stopped")
 	}
 }
 // run downloads each list when nextDownload says, until ctx ends. After each
 // try, whether it worked or not, the list's next download is an Interval
 // later.
 func (b *Blocklists) run(ctx context.Context, nextDownload []time.Time) {
 	defer close(b.done)
 	if len(nextDownload) == 0 {
 		return
 	}
 	for {
 		soonest := slices.MinFunc(nextDownload, time.Time.Compare)
 		timer := time.NewTimer(time.Until(soonest))
 		select {
 		case <-ctx.Done():
 			timer.Stop()
 			return
 		case <-timer.C:
 		}
 		for i, list := range b.lists {
 			if time.Now().Before(nextDownload[i]) {
 				continue
 			}
 			err := b.download(ctx, list)
 			if ctx.Err() != nil {
 				return
 			}
 			if err != nil {
 				b.logger.Error("Blocklist download failed; keeping the "+
 					"previous copy", "list", list.Name, "error", err)
 			}
 			nextDownload[i] = time.Now().Add(list.Interval)
 		}
 	}
 }
 // download asks the publisher for list, sending the validators of the list's
 // copy when it has them. A new version that parses becomes the list's copy,
 // on disk and in memory. An answer that the copy is still current marks the
 // copy as updated now. Anything else leaves the copy as it is and returns an
 // error.
 func (b *Blocklists) download(ctx context.Context, list List) error {
 	ctx, cancel := context.WithTimeout(ctx, downloadTimeout)
 	defer cancel()
 	req, err := http.NewRequestWithContext(ctx, http.MethodGet, list.URL, nil)
 	if err != nil {
 		return err
 	}
 	req.Header.Set(userAgentHeader, userAgent)
 	held := b.copyValidators(list.Name)
 	if held.LastModified != "" {
 		req.Header.Set(ifModifiedSinceHeader, held.LastModified)
 	}
 	if held.ETag != "" {
 		req.Header.Set(ifNoneMatchHeader, held.ETag)
 	}
 	resp, err := http.DefaultClient.Do(req)
 	if err != nil {
 		return err
 	}
 	defer func() { _ = resp.Body.Close() }()
 	switch resp.StatusCode {
 	case http.StatusOK:
 		return b.replaceCopy(list, resp.Body, validators{
 			LastModified: resp.Header.Get(lastModifiedHeader),
 			ETag:         resp.Header.Get(etagHeader),
 		})
 	case http.StatusNotModified:
 		return b.markCurrent(list)
 	default:
 		return fmt.Errorf("%w: %s", errUnexpectedStatus, resp.Status)
 	}
 }
 // replaceCopy writes a new version of list, read from body, beside the list's
 // copy. Only when it parses does it replace the copy, on disk and in memory.
 // sent are the validators the publisher sent with the new version.
 func (b *Blocklists) replaceCopy(list List, body io.Reader, sent validators) error {
 	root, err := os.OpenRoot(b.dir)
 	if err != nil {
 		return err
 	}
 	defer func() { _ = root.Close() }()
 	downloadName := list.Name + downloadSuffix
 	addresses, err := writeAndParse(root, downloadName, body, list.Format)
 	if err != nil {
 		_ = root.Remove(downloadName)
 		return err
 	}
 	// The old copy's validators are removed before the copy is replaced, so
 	// that they are never kept with the new copy.
 	err = root.Remove(list.Name + validatorsSuffix)
 	if err != nil && !errors.Is(err, fs.ErrNotExist) {
 		return err
 	}
 	err = root.Rename(downloadName, list.Name)
 	if err != nil {
 		return err
 	}
 	b.setCopy(list.Name, listCopy{
 		addresses: addresses, updated: time.Now().UTC(), validators: sent,
 	})
 	b.logger.Info("Downloaded a new version of a blocklist", "list", list.Name)
 	// Without this file, the first download after a restart asks for the
 	// whole list.
 	err = writeValidators(root, list.Name, sent)
 	if err != nil {
 		b.logger.Error("Failed to keep the validators of a blocklist copy",
 			"list", list.Name, "error", err)
 	}
 	return nil
 }
 // writeAndParse writes body to the file name in root, up to maxDownloadSize
 // bytes, and parses the file as format.
 func writeAndParse(
 	root *os.Root, name string, body io.Reader, format Format,
 ) (*netipx.IPSet, error) {
 	f, err := root.Create(name)
 	if err != nil {
 		return nil, err
 	}
 	defer func() { _ = f.Close() }()
 	written, err := io.Copy(f, io.LimitReader(body, maxDownloadSize+1))
 	if err != nil {
 		return nil, err
 	}
 	if written > maxDownloadSize {
 		return nil, errTooLarge
 	}
 	_, err = f.Seek(0, io.SeekStart)
 	if err != nil {
 		return nil, err
 	}
 	return parse(f, format)
 }
 // markCurrent records that the publisher says the list's copy is still
 // current: the copy, on disk and in memory, is marked as updated now.
 func (b *Blocklists) markCurrent(list List) error {
 	root, err := os.OpenRoot(b.dir)
 	if err != nil {
 		return err
 	}
 	defer func() { _ = root.Close() }()
 	now := time.Now().UTC()
 	err = root.Chtimes(list.Name, now, now)
 	if err != nil {
 		return err
 	}
 	b.setUpdated(list.Name, now)
 	b.logger.Debug("Blocklist copy is still current", "list", list.Name)
 	return nil
 }
 // loadCopy makes the list's copy on disk, with the validators kept beside it,
 // its copy in memory. The file's modification time is when the copy was
 // updated.
 func (b *Blocklists) loadCopy(list List) error {
 	root, err := os.OpenRoot(b.dir)
 	if err != nil {
 		return err
 	}
 	defer func() { _ = root.Close() }()
 	f, err := root.Open(list.Name)
 	if err != nil {
 		return err
 	}
 	defer func() { _ = f.Close() }()
 	info, err := f.Stat()
 	if err != nil {
 		return err
 	}
 	addresses, err := parse(f, list.Format)
 	if err != nil {
 		return err
 	}
 	held, err := readValidators(root, list.Name)
 	if err != nil {
 		return err
 	}
 	b.setCopy(list.Name, listCopy{
 		addresses: addresses, updated: info.ModTime().UTC(), validators: held,
 	})
 	return nil
 }
 // writeValidators keeps held in the file beside the named list's copy.
 func writeValidators(root *os.Root, name string, held validators) error {
 	data, err := json.Marshal(held)
 	if err != nil {
 		return err
 	}
 	return root.WriteFile(name+validatorsSuffix, data, validatorsPermissions)
 }
 // readValidators returns the validators kept beside the named list's copy.
 // They are empty when there is no such file.
 func readValidators(root *os.Root, name string) (validators, error) {
 	var held validators
 	data, err := root.ReadFile(name + validatorsSuffix)
 	if errors.Is(err, fs.ErrNotExist) {
 		return held, nil
 	}
 	if err != nil {
 		return held, err
 	}
 	err = json.Unmarshal(data, &held)
 	return held, err
 }
@@ -1,93 +0,0 @@
 package blocklist
 import "time"
 // How often each list is downloaded. No list is downloaded more often than
 // its publisher updates it or allows.
 const (
 	// DShield asks that its feeds be downloaded at most once an hour:
 	// https://isc.sans.edu/feeds_doc.html
 	dshieldInterval = time.Hour
 	// abuse.ch makes the list every 5 minutes and recommends a download at
 	// least every 15: https://feodotracker.abuse.ch/blocklist/
 	feodoTrackerInterval = 15 * time.Minute
 	// FireHOL's page for each list gives how often the list changes on
 	// average: about every 5 hours for abusers and every 3 hours for level
 	// 3. FireHOL sets no download limit.
 	// https://iplists.firehol.org/?ipset=firehol_abusers_30d
 	// https://iplists.firehol.org/?ipset=firehol_level3
 	fireHOLAbusersInterval = 5 * time.Hour
 	fireHOLLevel3Interval  = 3 * time.Hour
 	// Spamhaus asks that DROP be downloaded at most once a day:
 	// https://www.spamhaus.org/blocklists/do-not-route-or-peer/
 	spamhausDROPInterval = 24 * time.Hour
 	// Tor publishes a new exit list every hour and sets no download limit:
 	// https://collector.torproject.org/recent/exit-lists/
 	torExitsInterval = time.Hour
 )
 // Lists returns the public blocklists routewatch downloads. Each can be
 // downloaded whole without an account or a key. Spamhaus merged its EDROP
 // list into DROP, so DROP covers both.
 func Lists() []List {
 	return []List{
 		{
 			Name: "dshield",
 			Description: "In one of the 20 networks that DShield saw scan " +
 				"the most targets in the last three days",
 			URL:      "https://feeds.dshield.org/block.txt",
 			Interval: dshieldInterval,
 			Format:   FormatDShield,
 		},
 		{
 			Name:        "feodo_tracker",
 			Description: "A botnet command-and-control server",
 			URL:         "https://feodotracker.abuse.ch/downloads/ipblocklist.txt",
 			Interval:    feodoTrackerInterval,
 			Format:      FormatLines,
 		},
 		{
 			Name: "firehol_abusers_30d",
 			Description: "Reported for comment, form or forum spam in the " +
 				"last 30 days",
 			URL:      "https://iplists.firehol.org/files/firehol_abusers_30d.netset",
 			Interval: fireHOLAbusersInterval,
 			Format:   FormatLines,
 		},
 		{
 			Name: "firehol_level3",
 			Description: "Reported for attacks, spyware or viruses in the " +
 				"last 30 days",
 			URL:      "https://iplists.firehol.org/files/firehol_level3.netset",
 			Interval: fireHOLLevel3Interval,
 			Format:   FormatLines,
 		},
 		{
 			Name: "spamhaus_drop",
 			Description: "In an IPv4 network that Spamhaus says spammers " +
 				"or cyber criminals have hijacked or lease",
 			URL:      "https://www.spamhaus.org/drop/drop_v4.json",
 			Interval: spamhausDROPInterval,
 			Format:   FormatSpamhausJSON,
 		},
 		{
 			Name: "spamhaus_dropv6",
 			Description: "In an IPv6 network that Spamhaus says spammers " +
 				"or cyber criminals have hijacked or lease",
 			URL:      "https://www.spamhaus.org/drop/drop_v6.json",
 			Interval: spamhausDROPInterval,
 			Format:   FormatSpamhausJSON,
 		},
 		{
 			Name:        "tor_exits",
 			Description: "A Tor exit node, where traffic from the Tor network leaves",
 			URL:         "https://check.torproject.org/torbulkexitlist",
 			Interval:    torExitsInterval,
 			Format:      FormatLines,
 		},
 	}
 }
@@ -1,158 +0,0 @@
 package blocklist
 import (
 	"bufio"
 	"encoding/json"
 	"errors"
 	"fmt"
 	"io"
 	"net/netip"
 	"strings"
 	"go4.org/netipx"
 )
 const (
 	// commentPrefix starts a comment line in a list file.
 	commentPrefix = "#"
 	// networkSeparator separates the address and the mask length of a
 	// network, as in 192.0.2.0/24.
 	networkSeparator = "/"
 	// dshieldFieldSeparator separates the fields of a DShield line.
 	dshieldFieldSeparator = "\t"
 	// spamhausMetadataType is the type of the line that ends a Spamhaus
 	// file. That line holds the file's metadata and no network.
 	spamhausMetadataType = "metadata"
 )
 var (
 	errUnknownFormat = errors.New("unknown list format")
 	errNoNetwork     = errors.New("no network on the line")
 	errBadRange      = errors.New("first and last address make no range")
 )
 // parse reads a list file written in format and returns the addresses it
 // holds. A line it cannot read fails the whole file, so a file that is not
 // the list, such as an error page, never replaces a good copy.
 func parse(r io.Reader, format Format) (*netipx.IPSet, error) {
 	var builder netipx.IPSetBuilder
 	scanner := bufio.NewScanner(r)
 	for lineNumber := 1; scanner.Scan(); lineNumber++ {
 		line := strings.TrimSpace(scanner.Text())
 		if line == "" || strings.HasPrefix(line, commentPrefix) {
 			continue
 		}
 		err := addLine(&builder, line, format)
 		if err != nil {
 			return nil, fmt.Errorf("line %d: %w", lineNumber, err)
 		}
 	}
 	err := scanner.Err()
 	if err != nil {
 		return nil, err
 	}
 	return builder.IPSet()
 }
 // addLine adds the address or network on one line of a list file to builder.
 func addLine(builder *netipx.IPSetBuilder, line string, format Format) error {
 	switch format {
 	case FormatLines:
 		return addAddressOrNetwork(builder, line)
 	case FormatSpamhausJSON:
 		return addSpamhausNetwork(builder, line)
 	case FormatDShield:
 		return addDShieldNetwork(builder, line)
 	default:
 		return errUnknownFormat
 	}
 }
 // addAddressOrNetwork adds an address, such as 192.0.2.1, or a network, such
 // as 192.0.2.0/24, to builder.
 func addAddressOrNetwork(builder *netipx.IPSetBuilder, text string) error {
 	if strings.Contains(text, networkSeparator) {
 		network, err := netip.ParsePrefix(text)
 		if err != nil {
 			return err
 		}
 		builder.AddPrefix(network)
 		return nil
 	}
 	addr, err := netip.ParseAddr(text)
 	if err != nil {
 		return err
 	}
 	builder.Add(addr)
 	return nil
 }
 // addSpamhausNetwork adds the network on a line of a Spamhaus file to
 // builder. The metadata line adds nothing.
 func addSpamhausNetwork(builder *netipx.IPSetBuilder, line string) error {
 	var entry struct {
 		CIDR string `json:"cidr"`
 		Type string `json:"type"`
 	}
 	err := json.Unmarshal([]byte(line), &entry)
 	if err != nil {
 		return err
 	}
 	if entry.Type == spamhausMetadataType {
 		return nil
 	}
 	network, err := netip.ParsePrefix(entry.CIDR)
 	if err != nil {
 		return err
 	}
 	builder.AddPrefix(network)
 	return nil
 }
 // addDShieldNetwork adds the network on a line of a DShield file to builder.
 // The line's first two fields are the network's first and last address.
 func addDShieldNetwork(builder *netipx.IPSetBuilder, line string) error {
 	firstField, rest, found := strings.Cut(line, dshieldFieldSeparator)
 	if !found {
 		return errNoNetwork
 	}
 	lastField, _, _ := strings.Cut(rest, dshieldFieldSeparator)
 	first, err := netip.ParseAddr(firstField)
 	if err != nil {
 		return err
 	}
 	last, err := netip.ParseAddr(lastField)
 	if err != nil {
 		return err
 	}
 	network := netipx.IPRangeFrom(first, last)
 	if !network.IsValid() {
 		return errBadRange
 	}
 	builder.AddRange(network)
 	return nil
 }
@@ -6,10 +6,11 @@ import (
 	"sync"
 )
-// liveCounts holds the running row counts that the stats endpoints report.
+// liveCounts holds the running row counts and the prefix distribution that the
-// They are seeded once at startup from the tables and then adjusted on every
+// stats endpoints report. They are seeded once at startup from the tables and
-// write, so a stats read serves them from memory instead of running a query
+// then adjusted on every write, so a stats read serves them from memory instead
-// over the tables. The COUNT(*) scans (issue 27) grew with the database until
+// of running a query over the tables. The COUNT(*) scans (issue 27) and then
 // the prefix distribution query (issue 30) each grew with the database until
 // they took the whole request timeout and made /api/v1/stats return 500.
 //
 // A single mutex guards all fields so the stats reader takes a consistent
@@ -22,11 +23,20 @@ type liveCounts struct {
 	prefixesV6 int
 	peerings   int
 	peers      int
 	routesV4   int
 	routesV6   int
 	// The prefix distribution: for each mask length, the number of distinct
 	// prefixes that have at least one live route.
 	distributionV4 [ipv4Bits + 1]int
 	distributionV6 [ipv6Bits + 1]int
 }
 // seed sets every count to the value read from the tables at startup. It runs
 // before any writer, so it needs no coordination with the adjust methods.
-func (c *liveCounts) seed(asns, prefixesV4, prefixesV6, peerings, peers int) {
+func (c *liveCounts) seed(
 	asns, prefixesV4, prefixesV6, peerings, peers, routesV4, routesV6 int,
 	distributionV4, distributionV6 []PrefixDistribution,
 ) {
 	c.mu.Lock()
 	defer c.mu.Unlock()
@@ -35,6 +45,16 @@ func (c *liveCounts) seed(asns, prefixesV4, prefixesV6, peerings, peers int) {
 	c.prefixesV6 = prefixesV6
 	c.peerings = peerings
 	c.peers = peers
 	c.routesV4 = routesV4
 	c.routesV6 = routesV6
 	for _, entry := range distributionV4 {
 		addAtMaskLength(c.distributionV4[:], entry.MaskLength, entry.Count)
 	}
 	for _, entry := range distributionV6 {
 		addAtMaskLength(c.distributionV6[:], entry.MaskLength, entry.Count)
 	}
 }
 // addASNs adds n to the ASN count.
@@ -66,7 +86,41 @@ func (c *liveCounts) addPeers(n int) {
 	c.mu.Unlock()
 }
-// fill copies the counts into a Stats, including the derived total, under a
+// addRoutes adds to the IPv4 and IPv6 live-route counts. Deletions pass
 // negative values.
 func (c *liveCounts) addRoutes(v4, v6 int) {
 	c.mu.Lock()
 	c.routesV4 += v4
 	c.routesV6 += v6
 	c.mu.Unlock()
 }
 // addToDistribution adds n to the IPv4 and IPv6 prefix distributions once for
 // each listed mask length. A write lists the mask lengths of the prefixes it
 // gave their first live route with n = 1, and of the prefixes it left with no
 // live route with n = -1.
 func (c *liveCounts) addToDistribution(maskLengthsV4, maskLengthsV6 []int, n int) {
 	c.mu.Lock()
 	defer c.mu.Unlock()
 	for _, maskLength := range maskLengthsV4 {
 		addAtMaskLength(c.distributionV4[:], maskLength, n)
 	}
 	for _, maskLength := range maskLengthsV6 {
 		addAtMaskLength(c.distributionV6[:], maskLength, n)
 	}
 }
 // addAtMaskLength adds n to counts[maskLength]. A mask length the array has no
 // entry for is ignored, so a malformed route cannot crash the daemon.
 func addAtMaskLength(counts []int, maskLength, n int) {
 	if maskLength >= 0 && maskLength < len(counts) {
 		counts[maskLength] += n
 	}
 }
 // fill copies the counts into a Stats, including the derived totals, under a
 // single read lock so the reader sees one consistent snapshot.
 func (c *liveCounts) fill(s *Stats) {
 	c.mu.RLock()
@@ -78,6 +132,26 @@ func (c *liveCounts) fill(s *Stats) {
 	s.Prefixes = c.prefixesV4 + c.prefixesV6
 	s.Peerings = c.peerings
 	s.Peers = c.peers
 	s.IPv4Routes = c.routesV4
 	s.IPv6Routes = c.routesV6
 	s.LiveRoutes = c.routesV4 + c.routesV6
 	s.IPv4PrefixDistribution = distributionList(c.distributionV4[:])
 	s.IPv6PrefixDistribution = distributionList(c.distributionV6[:])
 }
 // distributionList lists the mask lengths that have at least one prefix, in
 // ascending order, the way the distribution query returns them.
 func distributionList(counts []int) []PrefixDistribution {
 	var list []PrefixDistribution
 	for maskLength, count := range counts {
 		if count > 0 {
 			list = append(list,
 				PrefixDistribution{MaskLength: maskLength, Count: count})
 		}
 	}
 	return list
 }
 // countRows returns the number of rows in the named table. It is used only at
@@ -93,8 +167,9 @@ func (d *Database) countRows(ctx context.Context, table string) (int, error) {
 	return n, nil
 }
-// seedCounts reads the current row counts from the tables into the in-memory
+// seedCounts reads the current row counts and prefix distribution from the
-// counters. It runs once at startup, before the streamer begins writing.
+// tables into the in-memory counters. It runs once at startup, before the
 // streamer begins writing.
 func (d *Database) seedCounts(ctx context.Context) error {
 	asns, err := d.countRows(ctx, "asns")
 	if err != nil {
@@ -121,7 +196,23 @@ func (d *Database) seedCounts(ctx context.Context) error {
 		return err
 	}
-	d.counts.seed(asns, prefixesV4, prefixesV6, peerings, peers)
+	routesV4, err := d.countRows(ctx, tableLiveRoutesV4)
 	if err != nil {
 		return err
 	}
 	routesV6, err := d.countRows(ctx, tableLiveRoutesV6)
 	if err != nil {
 		return err
 	}
 	distributionV4, distributionV6, err := d.GetPrefixDistributionContext(ctx)
 	if err != nil {
 		return err
 	}
 	d.counts.seed(asns, prefixesV4, prefixesV6, peerings, peers, routesV4, routesV6,
 		distributionV4, distributionV6)
 	return nil
 }
@@ -3,23 +3,62 @@ package database
 import (
 	"context"
 	"fmt"
 	"slices"
 	"sync"
 	"testing"
 	"time"
 	"git.eeqj.de/sneak/routewatch/internal/config"
 	"git.eeqj.de/sneak/routewatch/internal/logger"
 	"github.com/google/uuid"
 )
-// testV4PeerIP is the peer the IPv4 rows in these tests are learned from.
+// testV4PeerIP is the peer the IPv4 routes in these tests are learned from.
 const testV4PeerIP = "192.0.2.1"
-// testV6Prefix is the IPv6 prefix of these tests.
+// testV6Prefix is the prefix of the IPv6 routes in these tests.
 const testV6Prefix = "2001:db8::/32"
 // mkV4Route builds an IPv4 live route with its mask length taken from the
 // prefix.
 func mkV4Route(t *testing.T, prefix string, asn int, ts time.Time) *LiveRoute {
 	t.Helper()
 	maskLength, err := prefixMaskLength(prefix)
 	if err != nil {
 		t.Fatalf("prefixMaskLength(%s): %v", prefix, err)
 	}
 	return &LiveRoute{
 		Prefix:      prefix,
 		MaskLength:  maskLength,
 		IPVersion:   ipVersionV4,
 		OriginASN:   asn,
 		PeerIP:      testV4PeerIP,
 		ASPath:      []int{asn},
 		NextHop:     "192.0.2.254",
 		LastUpdated: ts,
 	}
 }
 // mkV6Route builds an IPv6 live route.
 func mkV6Route(prefix string, asn int, ts time.Time) *LiveRoute {
 	return &LiveRoute{
 		Prefix:      prefix,
 		MaskLength:  32,
 		IPVersion:   ipVersionV6,
 		OriginASN:   asn,
 		PeerIP:      "2001:db8::1",
 		ASPath:      []int{asn},
 		NextHop:     "2001:db8::ffff",
 		LastUpdated: ts,
 	}
 }
 // TestLiveCountsTrackWritesInRealtime checks that the stats counts start at
-// zero and reflect each write the moment it commits (no recompute, no timer).
+// zero, reflect each write the moment it commits (no recompute, no timer), do
-// These counts are what /api/v1/stats reports; before this change the
+// not move when a route is merely re-announced, and drop when a route is
 // deleted. These counts are what /api/v1/stats reports; before this change the
 // endpoint recomputed them with a COUNT(*) over each table on every request.
 func TestLiveCountsTrackWritesInRealtime(t *testing.T) {
 	t.Parallel()
@@ -40,7 +79,7 @@ func TestLiveCountsTrackWritesInRealtime(t *testing.T) {
 	}
 	if empty.ASNs != 0 || empty.Prefixes != 0 || empty.Peerings != 0 ||
-		empty.Peers != 0 {
+		empty.Peers != 0 || empty.LiveRoutes != 0 {
 		t.Fatalf("empty database counts nonzero: %+v", empty)
 	}
@@ -48,6 +87,17 @@ func TestLiveCountsTrackWritesInRealtime(t *testing.T) {
 	writeASNsPrefixesAndPeers(t, db, ts)
 	routes := []*LiveRoute{
 		mkV4Route(t, "198.51.100.0/24", 64500, ts),
 		mkV4Route(t, "203.0.113.0/24", 64501, ts.Add(time.Minute)),
 		mkV6Route(testV6Prefix, 64502, ts.Add(2*time.Minute)),
 	}
 	err = db.UpsertLiveRouteBatch(routes)
 	if err != nil {
 		t.Fatalf("UpsertLiveRouteBatch: %v", err)
 	}
 	stats, err := db.GetStatsContext(ctx)
 	if err != nil {
 		t.Fatalf("GetStatsContext: %v", err)
@@ -55,17 +105,50 @@ func TestLiveCountsTrackWritesInRealtime(t *testing.T) {
 	assertCounts(t, "after inserts", stats, wantCounts{
 		asns: 2, prefixes: 2, peerings: 1, peers: 1,
 		ipv4Routes: 2, ipv6Routes: 1, liveRoutes: 3,
 	})
 	// Re-announcing the same routes is an update, not an insert: counts hold.
 	err = db.UpsertLiveRouteBatch(routes)
 	if err != nil {
 		t.Fatalf("UpsertLiveRouteBatch (re-announce): %v", err)
 	}
 	stats, err = db.GetStatsContext(ctx)
 	if err != nil {
 		t.Fatalf("GetStatsContext: %v", err)
 	}
 	assertCounts(t, "after re-announce", stats, wantCounts{
 		asns: 2, prefixes: 2, peerings: 1, peers: 1,
 		ipv4Routes: 2, ipv6Routes: 1, liveRoutes: 3,
 	})
 	// A withdrawal removes one route.
 	err = db.DeleteLiveRouteBatch([]LiveRouteDeletion{
 		{Prefix: "203.0.113.0/24", PeerIP: testV4PeerIP, IPVersion: ipVersionV4},
 	})
 	if err != nil {
 		t.Fatalf("DeleteLiveRouteBatch: %v", err)
 	}
 	stats, err = db.GetStatsContext(ctx)
 	if err != nil {
 		t.Fatalf("GetStatsContext: %v", err)
 	}
 	assertCounts(t, "after delete", stats, wantCounts{
 		asns: 2, prefixes: 2, peerings: 1, peers: 1,
 		ipv4Routes: 1, ipv6Routes: 1, liveRoutes: 2,
 	})
 }
 // writeASNsPrefixesAndPeers writes two ASNs, two prefixes, one peer and one
-// peering: the rows the stats count.
+// peering: the rows besides live routes that the stats count.
 func writeASNsPrefixesAndPeers(t *testing.T, db *Database, ts time.Time) {
 	t.Helper()
-	seen := SeenTimes{First: ts, Last: ts}
+	err := db.GetOrCreateASNBatch(map[int]time.Time{64500: ts, 64501: ts})
 	err := db.GetOrCreateASNBatch(map[int]SeenTimes{64500: seen, 64501: seen})
 	if err != nil {
 		t.Fatalf("GetOrCreateASNBatch: %v", err)
 	}
@@ -81,22 +164,22 @@ func writeASNsPrefixesAndPeers(t *testing.T, db *Database, ts time.Time) {
 	err = db.UpdatePeerBatch(map[string]PeerUpdate{
 		testV4PeerIP: {
 			PeerIP: testV4PeerIP, PeerASN: 64500,
-			MessageType: "UPDATE", Seen: seen,
+			MessageType: "UPDATE", Timestamp: ts,
 		},
 	})
 	if err != nil {
 		t.Fatalf("UpdatePeerBatch: %v", err)
 	}
-	err = db.RecordPeering(64500, 64501, seen)
+	err = db.RecordPeering(64500, 64501, ts)
 	if err != nil {
 		t.Fatalf("RecordPeering: %v", err)
 	}
 }
 // TestLiveCountsSeededFromDatabaseAtStartup writes rows, reopens the same
-// database file, and checks the counts come back from the seed scan rather
+// database file, and checks the counts and the prefix distribution come back
-// than starting at zero.
+// from the seed scan rather than starting at zero.
 func TestLiveCountsSeededFromDatabaseAtStartup(t *testing.T) {
 	t.Parallel()
@@ -107,7 +190,20 @@ func TestLiveCountsSeededFromDatabaseAtStartup(t *testing.T) {
 		t.Fatalf("failed to create database: %v", err)
 	}
-	writeASNsPrefixesAndPeers(t, db, time.Date(2026, 1, 2, 3, 4, 5, 0, time.UTC))
+	ts := time.Date(2026, 1, 2, 3, 4, 5, 0, time.UTC)
 	err = db.GetOrCreateASNBatch(map[int]time.Time{64500: ts, 64501: ts, 64502: ts})
 	if err != nil {
 		t.Fatalf("GetOrCreateASNBatch: %v", err)
 	}
 	err = db.UpsertLiveRouteBatch([]*LiveRoute{
 		mkV4Route(t, "198.51.100.0/24", 64500, ts),
 		mkV6Route(testV6Prefix, 64502, ts),
 	})
 	if err != nil {
 		t.Fatalf("UpsertLiveRouteBatch: %v", err)
 	}
 	err = db.Close()
 	if err != nil {
@@ -125,10 +221,490 @@ func TestLiveCountsSeededFromDatabaseAtStartup(t *testing.T) {
 		t.Fatalf("GetStatsContext after reopen: %v", err)
 	}
-	assertCounts(t, "after reopen", stats, wantCounts{
+	if stats.ASNs != 3 {
-		asns: 2, prefixes: 2, peerings: 1, peers: 1,
+		t.Errorf("seeded ASNs = %d, want 3", stats.ASNs)
 	}
 	if stats.IPv4Routes != 1 || stats.IPv6Routes != 1 || stats.LiveRoutes != 2 {
 		t.Errorf("seeded routes = (v4 %d, v6 %d, total %d), want (1, 1, 2)",
 			stats.IPv4Routes, stats.IPv6Routes, stats.LiveRoutes)
 	}
 	assertDistribution(t, "seeded IPv4 distribution", stats.IPv4PrefixDistribution,
 		[]PrefixDistribution{{MaskLength: 24, Count: 1}})
 	assertDistribution(t, "seeded IPv6 distribution", stats.IPv6PrefixDistribution,
 		[]PrefixDistribution{{MaskLength: 32, Count: 1}})
 }
 // TestPrefixDistributionTracksWrites checks that the prefix distribution the
 // stats read reports stays exact across each kind of live-route write, and that
 // after every step it equals what the distribution query reads from the route
 // tables. The steps run once through the batch methods the prefix handler uses
 // and once through the single-route methods.
 func TestPrefixDistributionTracksWrites(t *testing.T) {
 	t.Parallel()
 	steps := prefixDistributionSteps(t)
 	for _, batch := range []bool{true, false} {
 		name := "single-route writes"
 		if batch {
 			name = "batch writes"
 		}
 		t.Run(name, func(t *testing.T) {
 			t.Parallel()
 			db, err := New(&config.Config{StateDir: t.TempDir()}, logger.New())
 			if err != nil {
 				t.Fatalf("failed to create database: %v", err)
 			}
 			defer func() { _ = db.Close() }()
 			ctx := context.Background()
 			for _, step := range steps {
 				err := announceRoutes(db, batch, step.announce)
 				if err != nil {
 					t.Fatalf("%s: announce: %v", step.name, err)
 				}
 				err = withdrawRoutes(db, batch, step.withdraw)
 				if err != nil {
 					t.Fatalf("%s: withdraw: %v", step.name, err)
 				}
 				stats, err := db.GetStatsContext(ctx)
 				if err != nil {
 					t.Fatalf("%s: GetStatsContext: %v", step.name, err)
 				}
 				queryV4, queryV6, err := db.GetPrefixDistributionContext(ctx)
 				if err != nil {
 					t.Fatalf("%s: GetPrefixDistributionContext: %v", step.name, err)
 				}
 				assertDistribution(t, step.name+": IPv4 distribution",
 					stats.IPv4PrefixDistribution, step.wantV4)
 				assertDistribution(t, step.name+": IPv6 distribution",
 					stats.IPv6PrefixDistribution, step.wantV6)
 				assertDistribution(t, step.name+": IPv4 distribution query",
 					queryV4, step.wantV4)
 				assertDistribution(t, step.name+": IPv6 distribution query",
 					queryV6, step.wantV6)
 			}
 		})
 	}
 }
 // prefixDistributionStep is one step of TestPrefixDistributionTracksWrites:
 // the routes it announces, then the routes it withdraws, then the
 // distributions both the stats and the distribution query must report.
 type prefixDistributionStep struct {
 	name     string
 	announce []*LiveRoute
 	withdraw []*LiveRoute
 	wantV4   []PrefixDistribution
 	wantV6   []PrefixDistribution
 }
 // prefixDistributionSteps returns the steps of
 // TestPrefixDistributionTracksWrites, in the order they run.
 func prefixDistributionSteps(t *testing.T) []prefixDistributionStep {
 	t.Helper()
 	ts := time.Date(2026, 1, 2, 3, 4, 5, 0, time.UTC)
 	shared := mkV4Route(t, "198.51.100.0/24", 64500, ts)
 	sharedSecondPeer := mkV4Route(t, "198.51.100.0/24", 64500, ts)
 	sharedSecondPeer.PeerIP = "192.0.2.2"
 	other := mkV4Route(t, "203.0.113.0/24", 64501, ts)
 	wide := mkV4Route(t, "172.16.0.0/16", 64502, ts)
 	v6 := mkV6Route(testV6Prefix, 64503, ts)
 	v6SecondPeer := mkV6Route(testV6Prefix, 64503, ts)
 	v6SecondPeer.PeerIP = "2001:db8::2"
 	all := []PrefixDistribution{{MaskLength: 16, Count: 1}, {MaskLength: 24, Count: 2}}
 	v6Only := []PrefixDistribution{{MaskLength: 32, Count: 1}}
 	return []prefixDistributionStep{
 		{
 			name:     "new routes",
 			announce: []*LiveRoute{shared, other, wide, v6},
 			wantV4:   all, wantV6: v6Only,
 		},
 		{
 			name:     "re-announcement",
 			announce: []*LiveRoute{shared, other, wide, v6},
 			wantV4:   all, wantV6: v6Only,
 		},
 		{
 			name:     "second peer announces a prefix that has a live route",
 			announce: []*LiveRoute{sharedSecondPeer, v6SecondPeer},
 			wantV4:   all, wantV6: v6Only,
 		},
 		{
 			name:     "withdrawal of a route that is not the last for its prefix",
 			withdraw: []*LiveRoute{shared, v6},
 			wantV4:   all, wantV6: v6Only,
 		},
 		{
 			name:     "withdrawal of the last route for a prefix",
 			withdraw: []*LiveRoute{sharedSecondPeer, v6SecondPeer},
 			wantV4: []PrefixDistribution{
 				{MaskLength: 16, Count: 1}, {MaskLength: 24, Count: 1},
 			},
 		},
 		{
 			name:     "withdrawal of every remaining route",
 			withdraw: []*LiveRoute{other, wide},
 		},
 		{
 			name:     "two peers announce a new prefix together",
 			announce: []*LiveRoute{shared, sharedSecondPeer, v6, v6SecondPeer},
 			wantV4:   []PrefixDistribution{{MaskLength: 24, Count: 1}},
 			wantV6:   v6Only,
 		},
 		{
 			name:     "both routes for a prefix withdrawn together",
 			withdraw: []*LiveRoute{shared, sharedSecondPeer, v6, v6SecondPeer},
 		},
 		// The feed often withdraws a route that is not live. That must not take
 		// the prefix out of the distribution. A count wrongly taken below zero is
 		// left out of the answer, so the next step shows it: its announcement
 		// at the same mask length would then not be counted.
 		{
 			name:     "withdrawal of routes that are not live",
 			withdraw: []*LiveRoute{other, v6},
 		},
 		{
 			name:     "announcement after a withdrawal of routes that are not live",
 			announce: []*LiveRoute{other, v6},
 			wantV4:   []PrefixDistribution{{MaskLength: 24, Count: 1}},
 			wantV6:   v6Only,
 		},
 	}
 }
 // announceRoutes writes routes in one UpsertLiveRouteBatch, or with one
 // UpsertLiveRoute each.
 func announceRoutes(db *Database, batch bool, routes []*LiveRoute) error {
 	if batch {
 		return db.UpsertLiveRouteBatch(routes)
 	}
 	for _, route := range routes {
 		err := db.UpsertLiveRoute(route)
 		if err != nil {
 			return err
 		}
 	}
 	return nil
 }
 // withdrawRoutes removes routes in one DeleteLiveRouteBatch, or with one
 // DeleteLiveRoute each.
 func withdrawRoutes(db *Database, batch bool, routes []*LiveRoute) error {
 	if !batch {
 		for _, route := range routes {
 			err := db.DeleteLiveRoute(route.Prefix, route.PeerIP)
 			if err != nil {
 				return err
 			}
 		}
 		return nil
 	}
 	deletions := make([]LiveRouteDeletion, 0, len(routes))
 	for _, route := range routes {
 		deletions = append(deletions, LiveRouteDeletion{
 			Prefix: route.Prefix, PeerIP: route.PeerIP, IPVersion: route.IPVersion,
 		})
 	}
 	return db.DeleteLiveRouteBatch(deletions)
 }
 // TestDeleteLiveRoutesOfPeer gives two peers IPv4 and IPv6 live routes, some
 // for the same prefixes, and deletes all of one peer's routes. The other peer's
 // routes stay, and the route counts and prefix distribution held in memory
 // equal what is read from the route tables.
 func TestDeleteLiveRoutesOfPeer(t *testing.T) {
 	t.Parallel()
 	const (
 		peerIP      = "192.0.2.1"
 		otherPeerIP = "192.0.2.2"
 		sharedV4    = "198.51.100.0/24"
 		sharedV6    = "2001:db8::/32"
 	)
 	db, err := New(&config.Config{StateDir: t.TempDir()}, logger.New())
 	if err != nil {
 		t.Fatalf("failed to create database: %v", err)
 	}
 	defer func() { _ = db.Close() }()
 	ts := time.Date(2026, 1, 2, 3, 4, 5, 0, time.UTC)
 	ofPeer := func(peer string, route *LiveRoute) *LiveRoute {
 		route.PeerIP = peer
 		return route
 	}
 	onlyV6 := mkV6Route("2001:db8:1::/48", 64503, ts)
 	onlyV6.MaskLength = 48
 	err = db.UpsertLiveRouteBatch([]*LiveRoute{
 		ofPeer(peerIP, mkV4Route(t, sharedV4, 64500, ts)),
 		ofPeer(otherPeerIP, mkV4Route(t, sharedV4, 64500, ts)),
 		ofPeer(peerIP, mkV4Route(t, "203.0.113.0/24", 64501, ts)),
 		ofPeer(peerIP, mkV6Route(sharedV6, 64502, ts)),
 		ofPeer(otherPeerIP, mkV6Route(sharedV6, 64502, ts)),
 		ofPeer(peerIP, onlyV6),
 	})
 	if err != nil {
 		t.Fatalf("UpsertLiveRouteBatch: %v", err)
 	}
 	// peerIP has two IPv4 and two IPv6 routes; a second delete finds none.
 	for _, want := range []int{4, 0} {
 		deleted, err := db.DeleteLiveRoutesOfPeer(peerIP)
 		if err != nil {
 			t.Fatalf("DeleteLiveRoutesOfPeer: %v", err)
 		}
 		if deleted != want {
 			t.Errorf("DeleteLiveRoutesOfPeer deleted %d routes, want %d",
 				deleted, want)
 		}
 	}
 	for _, prefix := range []string{sharedV4, sharedV6} {
 		routes, _, err := db.GetPrefixDetailsContext(context.Background(), prefix)
 		if err != nil {
 			t.Fatalf("GetPrefixDetailsContext(%s): %v", prefix, err)
 		}
 		if len(routes) != 1 || routes[0].PeerIP != otherPeerIP {
 			t.Errorf("live routes for %s = %+v, want only the one from %s",
 				prefix, routes, otherPeerIP)
 		}
 	}
 	checkOneLiveRoutePerIPVersion(t, db)
 }
 // TestDeleteLiveRoutesOfPeerDeletesInChunks gives a peer one IPv4 route more
 // than a chunk holds, two of them for prefixes another peer also has. One chunk
 // deletes peerRouteChunkSize of the peer's routes and commits, leaving the last
 // one. The routes are written again, and DeleteLiveRoutesOfPeer deletes all of
 // them, a chunk and then the last one. After each step the route count and
 // prefix distribution held in memory and those read from the route table are
 // the ones wanted.
 func TestDeleteLiveRoutesOfPeerDeletesInChunks(t *testing.T) {
 	t.Parallel()
 	const (
 		peerIP      = "192.0.2.1"
 		otherPeerIP = "192.0.2.2"
 		// How many of the peer's prefixes the other peer also has, the first
 		// ones in prefix order.
 		sharedPrefixes = 2
 	)
 	db, err := New(&config.Config{StateDir: t.TempDir()}, logger.New())
 	if err != nil {
 		t.Fatalf("failed to create database: %v", err)
 	}
 	defer func() { _ = db.Close() }()
 	ts := time.Date(2026, 1, 2, 3, 4, 5, 0, time.UTC)
 	peerRoutes := make([]*LiveRoute, 0, peerRouteChunkSize+1)
 	otherPeerRoutes := make([]*LiveRoute, 0, sharedPrefixes)
 	for i := range peerRouteChunkSize + 1 {
 		prefix := fmt.Sprintf("10.%d.%d.0/24", i/256, i%256)
 		route := mkV4Route(t, prefix, 64500, ts)
 		route.PeerIP = peerIP
 		peerRoutes = append(peerRoutes, route)
 		if i < sharedPrefixes {
 			route := mkV4Route(t, prefix, 64500, ts)
 			route.PeerIP = otherPeerIP
 			otherPeerRoutes = append(otherPeerRoutes, route)
 		}
 	}
 	err = db.UpsertLiveRouteBatch(slices.Concat(peerRoutes, otherPeerRoutes))
 	if err != nil {
 		t.Fatalf("UpsertLiveRouteBatch: %v", err)
 	}
 	deletedV4, deletedV6, err := db.deletePeerRouteChunk(peerIP)
 	if err != nil {
 		t.Fatalf("deletePeerRouteChunk: %v", err)
 	}
 	if deletedV4 != peerRouteChunkSize || deletedV6 != 0 {
 		t.Errorf("deletePeerRouteChunk deleted (%d, %d) routes, want (%d, 0)",
 			deletedV4, deletedV6, peerRouteChunkSize)
 	}
 	// The shared prefixes went with the chunk, so each route left has a
 	// prefix of its own.
 	checkV4RoutesOfOwnPrefixes(t, db, "after one chunk", 1+sharedPrefixes)
 	err = db.UpsertLiveRouteBatch(peerRoutes)
 	if err != nil {
 		t.Fatalf("UpsertLiveRouteBatch: %v", err)
 	}
 	deleted, err := db.DeleteLiveRoutesOfPeer(peerIP)
 	if err != nil {
 		t.Fatalf("DeleteLiveRoutesOfPeer: %v", err)
 	}
 	if deleted != len(peerRoutes) {
 		t.Errorf("DeleteLiveRoutesOfPeer deleted %d routes, want %d",
 			deleted, len(peerRoutes))
 	}
 	checkV4RoutesOfOwnPrefixes(t, db, "after DeleteLiveRoutesOfPeer",
 		sharedPrefixes)
 }
 // checkV4RoutesOfOwnPrefixes checks that the database has wantRoutes IPv4 live
 // routes, each for a /24 no other live route has, both as counted in memory and
 // as read from the route table. when says which step of the test checks.
 func checkV4RoutesOfOwnPrefixes(
 	t *testing.T, db *Database, when string, wantRoutes int,
 ) {
 	t.Helper()
 	ctx := context.Background()
 	stats, err := db.GetStatsContext(ctx)
 	if err != nil {
 		t.Fatalf("GetStatsContext: %v", err)
 	}
 	tableRoutes, _, err := db.GetLiveRouteCountsContext(ctx)
 	if err != nil {
 		t.Fatalf("GetLiveRouteCountsContext: %v", err)
 	}
 	if stats.IPv4Routes != wantRoutes || tableRoutes != wantRoutes {
 		t.Errorf("%s: IPv4 live routes: %d in memory, %d in the table, want %d",
 			when, stats.IPv4Routes, tableRoutes, wantRoutes)
 	}
 	queryDistribution, _, err := db.GetPrefixDistributionContext(ctx)
 	if err != nil {
 		t.Fatalf("GetPrefixDistributionContext: %v", err)
 	}
 	want := []PrefixDistribution{{MaskLength: 24, Count: wantRoutes}}
 	assertDistribution(t, when+": IPv4 distribution",
 		stats.IPv4PrefixDistribution, want)
 	assertDistribution(t, when+": IPv4 distribution query",
 		queryDistribution, want)
 }
 // checkOneLiveRoutePerIPVersion checks that the database has one IPv4 live
 // route, for a /24, and one IPv6 live route, for a /32, both as counted in
 // memory and as read from the route tables.
 func checkOneLiveRoutePerIPVersion(t *testing.T, db *Database) {
 	t.Helper()
 	ctx := context.Background()
 	stats, err := db.GetStatsContext(ctx)
 	if err != nil {
 		t.Fatalf("GetStatsContext: %v", err)
 	}
 	tableV4, tableV6, err := db.GetLiveRouteCountsContext(ctx)
 	if err != nil {
 		t.Fatalf("GetLiveRouteCountsContext: %v", err)
 	}
 	if stats.IPv4Routes != 1 || tableV4 != 1 || stats.IPv6Routes != 1 ||
 		tableV6 != 1 {
 		t.Errorf("live routes (IPv4, IPv6): (%d, %d) in memory, (%d, %d) in "+
 			"the tables, want (1, 1)",
 			stats.IPv4Routes, stats.IPv6Routes, tableV4, tableV6)
 	}
 	queryV4, queryV6, err := db.GetPrefixDistributionContext(ctx)
 	if err != nil {
 		t.Fatalf("GetPrefixDistributionContext: %v", err)
 	}
 	wantV4 := []PrefixDistribution{{MaskLength: 24, Count: 1}}
 	wantV6 := []PrefixDistribution{{MaskLength: 32, Count: 1}}
 	assertDistribution(t, "IPv4 distribution", stats.IPv4PrefixDistribution, wantV4)
 	assertDistribution(t, "IPv6 distribution", stats.IPv6PrefixDistribution, wantV6)
 	assertDistribution(t, "IPv4 distribution query", queryV4, wantV4)
 	assertDistribution(t, "IPv6 distribution query", queryV6, wantV6)
 }
 // TestStatsRouteTimestamps checks the oldest/newest route timestamps are read
 // from the right rows across both tables and parse into time.Time. The old
 // MIN/MAX union query read its result into *time.Time, which the driver could
 // not parse, so it logged a warning every call and left both timestamps nil.
 func TestStatsRouteTimestamps(t *testing.T) {
 	t.Parallel()
 	cfg := &config.Config{StateDir: t.TempDir()}
 	db, err := New(cfg, logger.New())
 	if err != nil {
 		t.Fatalf("failed to create database: %v", err)
 	}
 	defer func() { _ = db.Close() }()
 	ctx := context.Background()
 	empty, err := db.GetStatsContext(ctx)
 	if err != nil {
 		t.Fatalf("GetStatsContext on empty database: %v", err)
 	}
 	if empty.OldestRoute != nil || empty.NewestRoute != nil {
 		t.Fatalf("empty database timestamps = (%v, %v), want (nil, nil)",
 			empty.OldestRoute, empty.NewestRoute)
 	}
 	base := time.Date(2026, 1, 2, 3, 4, 5, 0, time.UTC)
 	oldest := base
 	newest := base.Add(2 * time.Minute)
 	err = db.UpsertLiveRouteBatch([]*LiveRoute{
 		mkV4Route(t, "198.51.100.0/24", 64500, base.Add(time.Minute)),
 		mkV4Route(t, "203.0.113.0/24", 64501, oldest),
 		mkV6Route(testV6Prefix, 64502, newest),
 	})
 	if err != nil {
 		t.Fatalf("UpsertLiveRouteBatch: %v", err)
 	}
 	stats, err := db.GetStatsContext(ctx)
 	if err != nil {
 		t.Fatalf("GetStatsContext: %v", err)
 	}
 	if stats.OldestRoute == nil || !stats.OldestRoute.Equal(oldest) {
 		t.Errorf("OldestRoute = %v, want %v", stats.OldestRoute, oldest)
 	}
 	if stats.NewestRoute == nil || !stats.NewestRoute.Equal(newest) {
 		t.Errorf("NewestRoute = %v, want %v", stats.NewestRoute, newest)
 	}
 }
 // TestLiveCountsConcurrentReadWrite runs writers and stats readers at once so
 // the race detector proves the counters are safe under concurrent use.
@@ -145,10 +721,7 @@ func TestLiveCountsConcurrentReadWrite(t *testing.T) {
 	ts := time.Date(2026, 1, 2, 3, 4, 5, 0, time.UTC)
-	const (
+	const writers = 4
 		writers          = 4
 		prefixesPerWrite = 25
 	)
 	var wg sync.WaitGroup
 	wg.Add(writers)
@@ -157,12 +730,14 @@ func TestLiveCountsConcurrentReadWrite(t *testing.T) {
 		go func(base int) {
 			defer wg.Done()
-			for i := range prefixesPerWrite {
+			for i := range 25 {
-				prefix := fmt.Sprintf("10.%d.%d.0/24", base, i)
+				asn := 65000 + base*100 + i
 				route := mkV6Route(testV6Prefix, asn, ts)
 				route.PeerIP = "2001:db8::" + uuid.NewString()
-				err := db.UpdatePrefixesBatch(map[string]time.Time{prefix: ts})
+				err := db.UpsertLiveRoute(route)
 				if err != nil {
-					t.Errorf("UpdatePrefixesBatch: %v", err)
+					t.Errorf("UpsertLiveRoute: %v", err)
 					return
 				}
@@ -202,9 +777,12 @@ func TestLiveCountsConcurrentReadWrite(t *testing.T) {
 		t.Fatalf("GetStatsContext: %v", err)
 	}
-	if want := writers * prefixesPerWrite; stats.IPv4Prefixes != want {
+	if want := writers * 25; stats.IPv6Routes != want {
-		t.Errorf("IPv4Prefixes = %d, want %d", stats.IPv4Prefixes, want)
+		t.Errorf("IPv6Routes = %d, want %d", stats.IPv6Routes, want)
 	}
 	// Every writer announced the same prefix, so it counts once.
 	assertDistribution(t, "IPv6 distribution", stats.IPv6PrefixDistribution,
 		[]PrefixDistribution{{MaskLength: 32, Count: 1}})
 }
 type wantCounts struct {
@@ -212,6 +790,9 @@ type wantCounts struct {
 	prefixes   int
 	peerings   int
 	peers      int
 	ipv4Routes int
 	ipv6Routes int
 	liveRoutes int
 }
 func assertCounts(t *testing.T, when string, got Stats, want wantCounts) {
@@ -232,4 +813,24 @@ func assertCounts(t *testing.T, when string, got Stats, want wantCounts) {
 	if got.Peers != want.peers {
 		t.Errorf("%s: Peers = %d, want %d", when, got.Peers, want.peers)
 	}
 	if got.IPv4Routes != want.ipv4Routes {
 		t.Errorf("%s: IPv4Routes = %d, want %d", when, got.IPv4Routes, want.ipv4Routes)
 	}
 	if got.IPv6Routes != want.ipv6Routes {
 		t.Errorf("%s: IPv6Routes = %d, want %d", when, got.IPv6Routes, want.ipv6Routes)
 	}
 	if got.LiveRoutes != want.liveRoutes {
 		t.Errorf("%s: LiveRoutes = %d, want %d", when, got.LiveRoutes, want.liveRoutes)
 	}
 }
 func assertDistribution(t *testing.T, what string, got, want []PrefixDistribution) {
 	t.Helper()
 	if !slices.Equal(got, want) {
 		t.Errorf("%s = %v, want %v", what, got, want)
 	}
 }
@@ -1,61 +0,0 @@
 package database
 import (
 	"os"
 	"path/filepath"
 	"strings"
 	"testing"
 	"git.eeqj.de/sneak/routewatch/internal/config"
 	"git.eeqj.de/sneak/routewatch/internal/logger"
 )
 // TestDockerignoreExcludesDatabaseFiles checks that .dockerignore keeps the
 // database file, and the WAL and shared-memory files SQLite writes next to it,
 // out of the build context wherever they sit in the clone. The image ships the
 // whole build context as a source archive.
 func TestDockerignoreExcludesDatabaseFiles(t *testing.T) {
 	t.Parallel()
 	db, err := New(&config.Config{StateDir: t.TempDir()}, logger.New())
 	if err != nil {
 		t.Fatalf("failed to create database: %v", err)
 	}
 	defer func() { _ = db.Close() }()
 	data, err := os.ReadFile("../../.dockerignore")
 	if err != nil {
 		t.Fatalf("failed to read .dockerignore: %v", err)
 	}
 	// Docker reads `**/` as any number of directories and the rest of the
 	// pattern as filepath.Match does, so `**/` followed by a pattern that
 	// matches a file's name excludes that file at any depth.
 	var anyDepth []string
 	for line := range strings.Lines(string(data)) {
 		pattern, ok := strings.CutPrefix(strings.TrimSpace(line), "**/")
 		if ok {
 			anyDepth = append(anyDepth, pattern)
 		}
 	}
 	name := filepath.Base(db.path)
 	for _, file := range []string{name, name + "-wal", name + "-shm"} {
 		excluded := false
 		for _, pattern := range anyDepth {
 			matched, err := filepath.Match(pattern, file)
 			if err != nil {
 				t.Fatalf("bad .dockerignore pattern **/%s: %v", pattern, err)
 			}
 			excluded = excluded || matched
 		}
 		if !excluded {
 			t.Errorf(".dockerignore has no **/ pattern that excludes %s", file)
 		}
 	}
 }
@@ -1,18 +1,14 @@
-// Package database provides SQLite storage for BGP routing data: ASNs,
+// Package database provides SQLite storage for BGP routing data including ASNs,
-// prefixes, announcements, peerings and BGP peers. Its routes table holds a
+// prefixes, announcements, peerings, and live route tables.
 // copy of the whole routing table that internal/routetable keeps in memory.
 package database
 import (
 	"context"
 	"net/netip"
 	"time"
 	"git.eeqj.de/sneak/routewatch/internal/routetable"
 )
-// Stats contains database statistics: counts of ASNs, prefixes, peerings and
+// Stats contains database statistics including counts for ASNs, prefixes,
-// peers, and the file size.
+// peerings, peers, and live routes, as well as file size and prefix distribution data.
 type Stats struct {
 	ASNs                   int
 	Prefixes               int
@@ -21,17 +17,24 @@ type Stats struct {
 	Peerings               int
 	Peers                  int
 	FileSizeBytes          int64
 	LiveRoutes             int
 	IPv4Routes             int
 	IPv6Routes             int
 	OldestRoute            *time.Time
 	NewestRoute            *time.Time
 	IPv4PrefixDistribution []PrefixDistribution
 	IPv6PrefixDistribution []PrefixDistribution
 }
 // Store defines the interface for database operations. It provides methods for
-// managing ASNs, prefixes, announcements, peerings, BGP peers, and the copy of
+// managing ASNs, prefixes, announcements, peerings, BGP peers, and live routes.
-// the routing table. Implementations must be safe for concurrent use.
+// Implementations must be safe for concurrent use.
 //
 //nolint:interfacebloat // the one seam handlers and tests depend on
 type Store interface {
 	// ASN operations
 	GetOrCreateASN(number int, timestamp time.Time) (*ASN, error)
-	GetOrCreateASNBatch(asns map[int]SeenTimes) error
+	GetOrCreateASNBatch(asns map[int]time.Time) error
 	// Prefix operations
 	GetOrCreatePrefix(prefix string, timestamp time.Time) (*Prefix, error)
@@ -41,7 +44,7 @@ type Store interface {
 	RecordAnnouncement(announcement *Announcement) error
 	// Peering operations
-	RecordPeering(asA, asB int, seen SeenTimes) error
+	RecordPeering(asA, asB int, timestamp time.Time) error
 	// Statistics
 	GetStats() (Stats, error)
@@ -51,9 +54,22 @@ type Store interface {
 	UpdatePeer(peerIP string, peerASN int, messageType string, timestamp time.Time) error
 	UpdatePeerBatch(peers map[string]PeerUpdate) error
-	// Routing table operations: the database's copy of the table in memory
+	// Live route operations
-	WriteRouteChanges(changes []routetable.Change, newPeers map[string]uint) error
+	UpsertLiveRoute(route *LiveRoute) error
-	ReadRouteTable(ctx context.Context) (*routetable.Table, error)
+	UpsertLiveRouteBatch(routes []*LiveRoute) error
 	DeleteLiveRoute(prefix, peerIP string) error
 	DeleteLiveRouteBatch(deletions []LiveRouteDeletion) error
 	DeleteLiveRoutesOfPeer(peerIP string) (deleted int, err error)
 	GetPrefixDistribution() (
 		ipv4 []PrefixDistribution, ipv6 []PrefixDistribution, err error)
 	GetPrefixDistributionContext(ctx context.Context) (
 		ipv4 []PrefixDistribution, ipv6 []PrefixDistribution, err error)
 	GetLiveRouteCounts() (ipv4Count, ipv6Count int, err error)
 	GetLiveRouteCountsContext(ctx context.Context) (ipv4Count, ipv6Count int, err error)
 	// IP lookup operations
 	GetIPInfo(ip string) (*IPInfo, error)
 	GetIPInfoContext(ctx context.Context, ip string) (*IPInfo, error)
 	// ASN WHOIS operations
 	GetNextStaleASN(ctx context.Context, staleThreshold time.Duration) (int, error)
@@ -61,11 +77,18 @@ type Store interface {
 	GetWHOISStats(ctx context.Context, staleThreshold time.Duration) (*WHOISStats, error)
 	// AS and prefix detail operations
-	GetAS(ctx context.Context, asn int) (*ASN, bool, error)
+	GetASDetails(asn int) (*ASN, []LiveRoute, error)
-	GetASWHOIS(ctx context.Context, asn int) (*ASN, error)
+	GetASDetailsContext(ctx context.Context, asn int) (*ASN, []LiveRoute, error)
 	GetPrefixFirstSeen(ctx context.Context, prefix netip.Prefix) (time.Time, error)
 	GetASPeers(asn int) ([]ASPeer, error)
 	GetASPeersContext(ctx context.Context, asn int) ([]ASPeer, error)
 	GetPrefixDetails(prefix string) ([]LiveRoute, map[int]ASN, error)
 	GetPrefixDetailsContext(
 		ctx context.Context, prefix string,
 	) ([]LiveRoute, map[int]ASN, error)
 	GetRandomPrefixesByLength(maskLength, ipVersion, limit int) ([]LiveRoute, error)
 	GetRandomPrefixesByLengthContext(
 		ctx context.Context, maskLength, ipVersion, limit int,
 	) ([]LiveRoute, error)
 	// Lifecycle
 	Close() error
@@ -28,10 +28,9 @@ type ASN struct {
 	RIRRegDate  *time.Time `json:"rir_registration_date,omitempty"`
 	RIRLastMod  *time.Time `json:"rir_last_modified,omitempty"`
 	WHOISRaw    string     `json:"whois_raw,omitempty"`
-	// Timestamps. They are zero, and left out of JSON, for an AS that has no
+	// Timestamps
-	// record in the asns table.
+	FirstSeen      time.Time  `json:"first_seen"`
-	FirstSeen      time.Time  `json:"first_seen,omitzero"`
+	LastSeen       time.Time  `json:"last_seen"`
 	LastSeen       time.Time  `json:"last_seen,omitzero"`
 	WHOISUpdatedAt *time.Time `json:"whois_updated_at,omitempty"`
 }
@@ -66,35 +65,69 @@ type ASNPeering struct {
 	LastSeen  time.Time
 }
-// SeenTimes is the earliest and the latest time one batch of updates saw an AS,
+// LiveRoute represents a route in the live routing table
-// a peer or a peering. A row the batch adds is stored first seen at First and
+//
-// last seen at Last. A row already stored takes First as its first_seen only
+//nolint:tagliatelle // field names are the existing JSON API
-// when First is earlier, and Last as its last_seen only when Last is later.
+type LiveRoute struct {
-type SeenTimes struct {
+	Prefix      string    `json:"prefix"`
-	First time.Time
+	MaskLength  int       `json:"mask_length"`
-	Last  time.Time
+	IPVersion   int       `json:"ip_version"`
 	OriginASN   int       `json:"origin_asn"`
 	PeerIP      string    `json:"peer_ip"`
 	ASPath      []int     `json:"as_path"`
 	NextHop     string    `json:"next_hop"`
 	LastUpdated time.Time `json:"last_updated"`
 }
-// Add makes t the earliest time of s when it is earlier than First, and the
+// PrefixDistribution represents the distribution of prefixes by mask length
-// latest when it is later than Last. The zero SeenTimes holds no time yet, so
+//
-// the first Add sets both.
+//nolint:tagliatelle // field names are the existing JSON API
-func (s *SeenTimes) Add(t time.Time) {
+type PrefixDistribution struct {
-	if s.First.IsZero() || t.Before(s.First) {
+	MaskLength int `json:"mask_length"`
-		s.First = t
+	Count      int `json:"count"`
 }
-	if s.Last.IsZero() || t.After(s.Last) {
+// IPInfo represents comprehensive IP information for the /ip endpoint
-		s.Last = t
+//
-	}
+//nolint:tagliatelle // field names are the existing JSON API
 type IPInfo struct {
 	IP         string   `json:"ip"`
 	PTR        []string `json:"ptr,omitempty"`
 	Netblock   string   `json:"netblock"`
 	MaskLength int      `json:"mask_length"`
 	IPVersion  int      `json:"ip_version"`
 	NumPeers   int      `json:"num_peers"`
 	// AS information
 	ASN         int    `json:"asn"`
 	ASName      string `json:"as_name,omitempty"`
 	Handle      string `json:"handle,omitempty"`
 	Description string `json:"description,omitempty"`
 	OrgName     string `json:"org_name,omitempty"`
 	OrgID       string `json:"org_id,omitempty"`
 	Address     string `json:"address,omitempty"`
 	CountryCode string `json:"country_code,omitempty"`
 	AbuseEmail  string `json:"abuse_email,omitempty"`
 	RIR         string `json:"rir,omitempty"`
 	// Timestamps
 	FirstSeen time.Time `json:"first_seen"`
 	LastSeen  time.Time `json:"last_seen"`
 	// Indicates if WHOIS data needs refresh (not serialized)
 	NeedsWHOISRefresh bool `json:"-"`
 }
-// PeerUpdate represents parameters for updating a peer. PeerASN and
+// LiveRouteDeletion represents parameters for deleting a live route
-// MessageType are those of the peer's latest update.
+type LiveRouteDeletion struct {
 	Prefix    string
 	PeerIP    string
 	IPVersion int
 }
 // PeerUpdate represents parameters for updating a peer
 type PeerUpdate struct {
 	PeerIP      string
 	PeerASN     int
 	MessageType string
-	Seen        SeenTimes
+	Timestamp   time.Time
 }
 // ASNWHOISUpdate contains WHOIS data for updating an ASN record.
@@ -1,339 +0,0 @@
 package database
 import (
 	"context"
 	"database/sql"
 	"encoding/json"
 	"errors"
 	"fmt"
 	"net/netip"
 	"time"
 	"github.com/bits-and-blooms/bitset"
 	"git.eeqj.de/sneak/routewatch/internal/routetable"
 )
 // keptRoutesPerRow is how many kept routes a row of the routes table has
 // columns for: the newest and the older one.
 const keptRoutesPerRow = 2
 // errUnknownRoutePeer is returned for a peer that route_peers lacks: on a
 // write, the peer of a kept route; on a read, a peer number in a row.
 var errUnknownRoutePeer = errors.New("peer not in route_peers")
 // The statements of the routes and route_peers tables (schema.sql).
 const (
 	insertRoutePeerSQL = `INSERT INTO route_peers (number, address)
 		VALUES (?, ?)`
 	routePeerNumberSQL = `SELECT number FROM route_peers WHERE address = ?`
 	routePeersSQL      = `SELECT number, address FROM route_peers`
 	upsertRouteSQL = `INSERT INTO routes (prefix, origin_asn, peers,
 			newest_peer, newest_as_path, newest_time,
 			older_peer, older_as_path, older_time)
 		VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?)
 		ON CONFLICT (prefix, origin_asn) DO UPDATE SET peers = excluded.peers,
 			newest_peer = excluded.newest_peer,
 			newest_as_path = excluded.newest_as_path,
 			newest_time = excluded.newest_time,
 			older_peer = excluded.older_peer,
 			older_as_path = excluded.older_as_path,
 			older_time = excluded.older_time`
 	deleteRouteSQL = `DELETE FROM routes WHERE prefix = ? AND origin_asn = ?`
 	routesSQL      = `SELECT prefix, origin_asn, peers,
 		newest_peer, newest_as_path, newest_time,
 		older_peer, older_as_path, older_time FROM routes`
 )
 // WriteRouteChanges writes, in one transaction, what one call of the routing
 // table's TakeChanges returned. It stores each new peer with its number, writes
 // the row of each changed prefix and origin AS pair, and deletes the row of
 // each removed one. Route times are stored to the second, as the feed gives
 // them.
 //
 // When it fails, it writes nothing. The caller then writes these changes and
 // peers again, because later changes can name the peers it did not store.
 func (d *Database) WriteRouteChanges(
 	changes []routetable.Change, newPeers map[string]uint,
 ) error {
 	if len(changes) == 0 && len(newPeers) == 0 {
 		return nil
 	}
 	d.lock("WriteRouteChanges")
 	defer d.unlock()
 	tx, err := d.beginTx()
 	if err != nil {
 		return fmt.Errorf("failed to begin transaction: %w", err)
 	}
 	defer d.rollback(tx)
 	ctx := context.Background()
 	// The new peers first, so that the rows can look up their numbers.
 	for address, number := range newPeers {
 		_, err := tx.ExecContext(ctx, insertRoutePeerSQL, number, address)
 		if err != nil {
 			return fmt.Errorf("failed to store peer %s: %w", address, err)
 		}
 	}
 	err = writeRouteRows(ctx, tx, changes)
 	if err != nil {
 		return err
 	}
 	err = tx.Commit()
 	if err != nil {
 		return fmt.Errorf("failed to commit transaction: %w", err)
 	}
 	return nil
 }
 // writeRouteRows upserts the row of each change in tx, or deletes it for a
 // removed pair.
 func writeRouteRows(
 	ctx context.Context, tx *loggingTx, changes []routetable.Change,
 ) error {
 	upsert, err := tx.PrepareContext(ctx, upsertRouteSQL)
 	if err != nil {
 		return fmt.Errorf("failed to prepare route upsert: %w", err)
 	}
 	defer func() { _ = upsert.Close() }()
 	del, err := tx.PrepareContext(ctx, deleteRouteSQL)
 	if err != nil {
 		return fmt.Errorf("failed to prepare route delete: %w", err)
 	}
 	defer func() { _ = del.Close() }()
 	peerNumber, err := tx.PrepareContext(ctx, routePeerNumberSQL)
 	if err != nil {
 		return fmt.Errorf("failed to prepare peer number lookup: %w", err)
 	}
 	defer func() { _ = peerNumber.Close() }()
 	for _, change := range changes {
 		prefix := change.Prefix.String()
 		if change.Removed {
 			_, err := del.ExecContext(ctx, prefix, change.OriginASN)
 			if err != nil {
 				return fmt.Errorf("failed to delete route %s: %w", prefix, err)
 			}
 			continue
 		}
 		row, err := routeRow(ctx, peerNumber, change)
 		if err != nil {
 			return fmt.Errorf("failed to write route %s: %w", prefix, err)
 		}
 		_, err = upsert.ExecContext(ctx, row...)
 		if err != nil {
 			return fmt.Errorf("failed to write route %s: %w", prefix, err)
 		}
 	}
 	return nil
 }
 // routeRow returns the values of the routes row of change, in the order of
 // upsertRouteSQL. peerNumber looks up a peer's number by its address. The
 // table keeps at most keptRoutesPerRow routes of a pair.
 func routeRow(
 	ctx context.Context, peerNumber *sql.Stmt, change routetable.Change,
 ) ([]any, error) {
 	peers, err := change.Peers.MarshalBinary()
 	if err != nil {
 		return nil, err
 	}
 	row := []any{change.Prefix.String(), change.OriginASN, peers}
 	for i := range keptRoutesPerRow {
 		if i >= len(change.Routes) {
 			row = append(row, nil, nil, nil)
 			continue
 		}
 		r := change.Routes[i]
 		var number uint
 		err := peerNumber.QueryRowContext(ctx, r.Peer).Scan(&number)
 		if errors.Is(err, sql.ErrNoRows) {
 			return nil, fmt.Errorf("%w: %s", errUnknownRoutePeer, r.Peer)
 		}
 		if err != nil {
 			return nil, err
 		}
 		path, err := json.Marshal(r.ASPath)
 		if err != nil {
 			return nil, err
 		}
 		row = append(row, number, string(path), r.Time.Unix())
 	}
 	return row, nil
 }
 // ReadRouteTable returns the routing table that the routes and route_peers
 // tables hold, as startup reads it. It reads the peers first, so that the
 // table keeps their numbers, then loads each row into the table as it reads
 // it. The two reads are separate, so nothing may write the tables meanwhile.
 // It fails on a row that names a peer number route_peers lacks.
 func (d *Database) ReadRouteTable(ctx context.Context) (*routetable.Table, error) {
 	peerNumbers, err := d.readRoutePeers(ctx)
 	if err != nil {
 		return nil, err
 	}
 	addresses := make(map[uint]string, len(peerNumbers))
 	numbers := new(bitset.BitSet)
 	for address, number := range peerNumbers {
 		addresses[number] = address
 		numbers.Set(number)
 	}
 	table := routetable.New(routetable.Params{PeerNumbers: peerNumbers})
 	rows, err := d.db.QueryContext(ctx, routesSQL)
 	if err != nil {
 		return nil, fmt.Errorf("failed to read routes: %w", err)
 	}
 	defer func() { _ = rows.Close() }()
 	for rows.Next() {
 		change, err := scanRouteRow(rows, addresses, numbers)
 		if err != nil {
 			return nil, err
 		}
 		table.Load(change)
 	}
 	err = rows.Err()
 	if err != nil {
 		return nil, fmt.Errorf("failed to read routes: %w", err)
 	}
 	return table, nil
 }
 // readRoutePeers returns the number of each peer in route_peers, by address.
 func (d *Database) readRoutePeers(ctx context.Context) (map[string]uint, error) {
 	rows, err := d.db.QueryContext(ctx, routePeersSQL)
 	if err != nil {
 		return nil, fmt.Errorf("failed to read route peers: %w", err)
 	}
 	defer func() { _ = rows.Close() }()
 	peerNumbers := make(map[string]uint)
 	for rows.Next() {
 		var (
 			number  uint
 			address string
 		)
 		err := rows.Scan(&number, &address)
 		if err != nil {
 			return nil, fmt.Errorf("failed to read a route peer: %w", err)
 		}
 		peerNumbers[address] = number
 	}
 	err = rows.Err()
 	if err != nil {
 		return nil, fmt.Errorf("failed to read route peers: %w", err)
 	}
 	return peerNumbers, nil
 }
 // keptRouteColumns are the three columns of one kept route in a routes row.
 type keptRouteColumns struct {
 	peer   sql.Null[uint]
 	asPath sql.NullString
 	time   sql.NullInt64
 }
 // scanRouteRow returns the content of the routes row rows is at, with each kept
 // route's peer named by its address in addresses. It fails when the row names a
 // peer number that addresses lacks. numbers holds the numbers of addresses as a
 // set, against which a row's whole peer set is checked at once.
 func scanRouteRow(
 	rows *sql.Rows, addresses map[uint]string, numbers *bitset.BitSet,
 ) (routetable.Change, error) {
 	var (
 		change routetable.Change
 		prefix string
 		peers  []byte
 		kept   [keptRoutesPerRow]keptRouteColumns
 	)
 	err := rows.Scan(&prefix, &change.OriginASN, &peers,
 		&kept[0].peer, &kept[0].asPath, &kept[0].time,
 		&kept[1].peer, &kept[1].asPath, &kept[1].time)
 	if err != nil {
 		return change, fmt.Errorf("failed to read a route: %w", err)
 	}
 	change.Prefix, err = netip.ParsePrefix(prefix)
 	if err != nil {
 		return change, fmt.Errorf("failed to read route %s: %w", prefix, err)
 	}
 	change.Peers = new(bitset.BitSet)
 	err = change.Peers.UnmarshalBinary(peers)
 	if err != nil {
 		return change, fmt.Errorf("failed to read the peers of route %s: %w",
 			prefix, err)
 	}
 	if !numbers.IsSuperSet(change.Peers) {
 		unknown, _ := change.Peers.Difference(numbers).NextSet(0)
 		return change, fmt.Errorf("%w: number %d in the peers of route %s",
 			errUnknownRoutePeer, unknown, prefix)
 	}
 	for _, columns := range kept {
 		if !columns.peer.Valid {
 			continue
 		}
 		address, known := addresses[columns.peer.V]
 		if !known {
 			return change, fmt.Errorf("%w: number %d in route %s",
 				errUnknownRoutePeer, columns.peer.V, prefix)
 		}
 		r := routetable.Route{
 			Peer: address,
 			Time: time.Unix(columns.time.Int64, 0).UTC(),
 		}
 		err := json.Unmarshal([]byte(columns.asPath.String), &r.ASPath)
 		if err != nil {
 			return change, fmt.Errorf("failed to read an AS path of route %s: %w",
 				prefix, err)
 		}
 		change.Routes = append(change.Routes, r)
 	}
 	return change, nil
 }
@@ -1,527 +0,0 @@
 package database
 import (
 	"errors"
 	"fmt"
 	"math"
 	"math/rand/v2"
 	"net/netip"
 	"os"
 	"reflect"
 	"slices"
 	"testing"
 	"time"
 	"github.com/bits-and-blooms/bitset"
 	"git.eeqj.de/sneak/routewatch/internal/config"
 	"git.eeqj.de/sneak/routewatch/internal/logger"
 	"git.eeqj.de/sneak/routewatch/internal/routetable"
 )
 // Peers, origin ASes and prefixes of the routes table tests.
 const (
 	peerA = "192.0.2.1"
 	peerB = "192.0.2.2"
 	peerC = "2001:db8::3"
 	peerD = "2001:db8::4"
 	peerE = "2001:db8::5"
 	asA = 64500
 	asB = 64501
 	// transitAS is the first AS of every test path, the peer's own.
 	transitAS = 64496
 	tablePrefixV4      = "10.1.2.0/24"
 	tablePrefixShortV4 = "10.9.0.0/16"
 	tablePrefixV6      = "2001:db8:1::/48"
 )
 // tableTime returns the time second seconds after the start of every routes
 // table test.
 func tableTime(second int) time.Time {
 	return time.Date(2026, 1, 2, 3, 4, 5, 0, time.UTC).
 		Add(time.Duration(second) * time.Second)
 }
 // announceTo has peer announce prefix with origin AS asn second seconds after
 // the start.
 func announceTo(
 	table *routetable.Table, prefix string, asn int, peer string, second int,
 ) {
 	table.Announce(netip.MustParsePrefix(prefix), asn, routetable.Route{
 		Peer: peer, ASPath: []int{transitAS, asn}, Time: tableTime(second),
 	})
 }
 // newRoutesTestDatabase returns a new database in a temporary directory.
 func newRoutesTestDatabase(t *testing.T) *Database {
 	t.Helper()
 	db, err := New(&config.Config{StateDir: t.TempDir()}, logger.New())
 	if err != nil {
 		t.Fatalf("failed to create database: %v", err)
 	}
 	t.Cleanup(func() { _ = db.Close() })
 	return db
 }
 // writeTableChanges writes what table changed since the last call.
 func writeTableChanges(t *testing.T, db *Database, table *routetable.Table) {
 	t.Helper()
 	changes, newPeers := table.TakeChanges(math.MaxInt)
 	err := db.WriteRouteChanges(changes, newPeers)
 	if err != nil {
 		t.Fatalf("WriteRouteChanges: %v", err)
 	}
 }
 func TestReadRouteTableGivesBackWhatWasWritten(t *testing.T) {
 	t.Parallel()
 	db := newRoutesTestDatabase(t)
 	source := routetable.New(routetable.Params{})
 	// Two origins of one prefix: the routes of peerC and peerB are kept for
 	// asA, peerA keeps only its bit.
 	announceTo(source, tablePrefixV4, asA, peerA, 10)
 	announceTo(source, tablePrefixV4, asA, peerB, 20)
 	announceTo(source, tablePrefixV4, asA, peerC, 30)
 	announceTo(source, tablePrefixV4, asB, peerD, 40)
 	// Two routes with the same time.
 	announceTo(source, tablePrefixV6, asA, peerA, 50)
 	announceTo(source, tablePrefixV6, asA, peerC, 50)
 	// An origin whose kept routes were withdrawn while peerA carries it.
 	announceTo(source, tablePrefixShortV4, asB, peerA, 10)
 	announceTo(source, tablePrefixShortV4, asB, peerB, 20)
 	announceTo(source, tablePrefixShortV4, asB, peerC, 30)
 	source.Withdraw(netip.MustParsePrefix(tablePrefixShortV4), peerB)
 	source.Withdraw(netip.MustParsePrefix(tablePrefixShortV4), peerC)
 	writeTableChanges(t, db, source)
 	checkReadTable(t, db, source)
 	// A peer moves to another origin, one goes down and a new one comes.
 	announceTo(source, tablePrefixV4, asB, peerA, 60)
 	source.PeerDown(peerC)
 	announceTo(source, tablePrefixV6, asB, peerE, 70)
 	writeTableChanges(t, db, source)
 	checkReadTable(t, db, source)
 }
 func TestReadRouteTableGivesATableThatTakesLaterUpdates(t *testing.T) {
 	t.Parallel()
 	db := newRoutesTestDatabase(t)
 	source := routetable.New(routetable.Params{})
 	// peerA and peerB carry tablePrefixV4, peerB and peerC tablePrefixV6.
 	announceTo(source, tablePrefixV4, asA, peerA, 10)
 	announceTo(source, tablePrefixV4, asA, peerB, 20)
 	announceTo(source, tablePrefixV6, asA, peerB, 30)
 	announceTo(source, tablePrefixV6, asA, peerC, 40)
 	writeTableChanges(t, db, source)
 	read := checkReadTable(t, db, source)
 	// The same updates to both tables: a loaded peer withdraws a prefix,
 	// another one goes down, and a new peer comes.
 	for _, table := range []*routetable.Table{source, read} {
 		table.Withdraw(netip.MustParsePrefix(tablePrefixV4), peerA)
 		table.PeerDown(peerB)
 		announceTo(table, tablePrefixShortV4, asB, peerD, 50)
 	}
 	checkSameReads(t, read, source)
 }
 func TestReadRouteTableFailsOnAPeerWithoutANumber(t *testing.T) {
 	t.Parallel()
 	db := newRoutesTestDatabase(t)
 	table := routetable.New(routetable.Params{})
 	// Only the routes of peerB and peerC are kept, so only the peer set names
 	// peerA.
 	announceTo(table, tablePrefixV4, asA, peerA, 10)
 	announceTo(table, tablePrefixV4, asA, peerB, 20)
 	announceTo(table, tablePrefixV4, asA, peerC, 30)
 	writeTableChanges(t, db, table)
 	_, err := db.db.ExecContext(t.Context(),
 		"DELETE FROM route_peers WHERE address = ?", peerA)
 	if err != nil {
 		t.Fatalf("deleting a route peer: %v", err)
 	}
 	_, err = db.ReadRouteTable(t.Context())
 	if !errors.Is(err, errUnknownRoutePeer) {
 		t.Fatalf("ReadRouteTable = %v, want %v", err, errUnknownRoutePeer)
 	}
 }
 // checkReadTable checks that the table ReadRouteTable reads answers every read
 // as want does, and that reading it recorded no change. It returns that table.
 func checkReadTable(
 	t *testing.T, db *Database, want *routetable.Table,
 ) *routetable.Table {
 	t.Helper()
 	got, err := db.ReadRouteTable(t.Context())
 	if err != nil {
 		t.Fatalf("ReadRouteTable: %v", err)
 	}
 	checkSameReads(t, got, want)
 	changes, newPeers := got.TakeChanges(math.MaxInt)
 	if len(changes) != 0 || len(newPeers) != 0 {
 		t.Errorf("the read recorded changes %+v and new peers %v, want none",
 			changes, newPeers)
 	}
 	return got
 }
 // checkSameReads checks that got answers every read as want does, for the
 // prefixes and the origin ASes the tests use.
 func checkSameReads(t *testing.T, got, want *routetable.Table) {
 	t.Helper()
 	if !reflect.DeepEqual(got.Counts(), want.Counts()) {
 		t.Errorf("Counts() = %+v, want %+v", got.Counts(), want.Counts())
 	}
 	for _, text := range []string{
 		tablePrefixV4, tablePrefixShortV4, tablePrefixV6,
 	} {
 		prefix := netip.MustParsePrefix(text)
 		if !reflect.DeepEqual(got.Origins(prefix), want.Origins(prefix)) {
 			t.Errorf("Origins(%s) = %+v, want %+v",
 				prefix, got.Origins(prefix), want.Origins(prefix))
 		}
 		gotSummary, gotFound := got.Lookup(prefix.Addr())
 		wantSummary, wantFound := want.Lookup(prefix.Addr())
 		if gotFound != wantFound || !reflect.DeepEqual(gotSummary, wantSummary) {
 			t.Errorf("Lookup(%s) = %+v, %v; want %+v, %v", prefix.Addr(),
 				gotSummary, gotFound, wantSummary, wantFound)
 		}
 		ipVersion := ipVersionV6
 		if prefix.Addr().Is4() {
 			ipVersion = ipVersionV4
 		}
 		gotSample := sortedSample(got, ipVersion, prefix.Bits())
 		wantSample := sortedSample(want, ipVersion, prefix.Bits())
 		if !reflect.DeepEqual(gotSample, wantSample) {
 			t.Errorf("SamplePrefixes(%d, %d) = %+v, want %+v",
 				ipVersion, prefix.Bits(), gotSample, wantSample)
 		}
 	}
 	for _, asn := range []int{asA, asB} {
 		if !reflect.DeepEqual(got.OriginatedPrefixes(asn),
 			want.OriginatedPrefixes(asn)) {
 			t.Errorf("OriginatedPrefixes(%d) = %+v, want %+v", asn,
 				got.OriginatedPrefixes(asn), want.OriginatedPrefixes(asn))
 		}
 	}
 }
 // sortedSample returns every prefix of the IP version and mask length in
 // table, in prefix order.
 func sortedSample(
 	table *routetable.Table, ipVersion, maskLength int,
 ) []routetable.PrefixSummary {
 	// More than the tests have of any mask length.
 	const all = 100
 	sample := table.SamplePrefixes(ipVersion, maskLength, all)
 	slices.SortFunc(sample, func(a, b routetable.PrefixSummary) int {
 		return a.Prefix.Compare(b.Prefix)
 	})
 	return sample
 }
 func TestWriteRouteChangesDeletesTheRowOfARemovedPair(t *testing.T) {
 	t.Parallel()
 	db := newRoutesTestDatabase(t)
 	table := routetable.New(routetable.Params{})
 	announceTo(table, tablePrefixV4, asA, peerA, 10)
 	announceTo(table, tablePrefixV4, asB, peerB, 20)
 	writeTableChanges(t, db, table)
 	// The prefix's only peer with asA withdraws it.
 	table.Withdraw(netip.MustParsePrefix(tablePrefixV4), peerA)
 	writeTableChanges(t, db, table)
 	var origins []int
 	rows, err := db.db.QueryContext(t.Context(),
 		"SELECT origin_asn FROM routes WHERE prefix = ?", tablePrefixV4)
 	if err != nil {
 		t.Fatalf("reading the routes: %v", err)
 	}
 	defer func() { _ = rows.Close() }()
 	for rows.Next() {
 		var origin int
 		err := rows.Scan(&origin)
 		if err != nil {
 			t.Fatalf("reading a route: %v", err)
 		}
 		origins = append(origins, origin)
 	}
 	err = rows.Err()
 	if err != nil {
 		t.Fatalf("reading the routes: %v", err)
 	}
 	if !slices.Equal(origins, []int{asB}) {
 		t.Errorf("rows of %s have origins %v, want only %d",
 			tablePrefixV4, origins, asB)
 	}
 }
 // routePeer is one row of route_peers.
 type routePeer struct {
 	number  uint
 	address string
 }
 // readRoutePeerRows returns the rows of route_peers in number order.
 func readRoutePeerRows(t *testing.T, db *Database) []routePeer {
 	t.Helper()
 	rows, err := db.db.QueryContext(t.Context(),
 		"SELECT number, address FROM route_peers ORDER BY number")
 	if err != nil {
 		t.Fatalf("reading the route peers: %v", err)
 	}
 	defer func() { _ = rows.Close() }()
 	var peers []routePeer
 	for rows.Next() {
 		var peer routePeer
 		err := rows.Scan(&peer.number, &peer.address)
 		if err != nil {
 			t.Fatalf("reading a route peer: %v", err)
 		}
 		peers = append(peers, peer)
 	}
 	err = rows.Err()
 	if err != nil {
 		t.Fatalf("reading the route peers: %v", err)
 	}
 	return peers
 }
 func TestWriteRouteChangesStoresNewPeers(t *testing.T) {
 	t.Parallel()
 	db := newRoutesTestDatabase(t)
 	table := routetable.New(routetable.Params{})
 	announceTo(table, tablePrefixV4, asA, peerA, 10)
 	announceTo(table, tablePrefixV6, asA, peerC, 20)
 	writeTableChanges(t, db, table)
 	// peerA is stored already; peerB is new.
 	announceTo(table, tablePrefixV4, asA, peerA, 30)
 	announceTo(table, tablePrefixV4, asA, peerB, 40)
 	writeTableChanges(t, db, table)
 	want := []routePeer{{0, peerA}, {1, peerC}, {2, peerB}}
 	got := readRoutePeerRows(t, db)
 	if !slices.Equal(got, want) {
 		t.Errorf("route_peers = %+v, want %+v", got, want)
 	}
 }
 func TestWriteRouteChangesWritesNothingWhenItFails(t *testing.T) {
 	t.Parallel()
 	db := newRoutesTestDatabase(t)
 	table := routetable.New(routetable.Params{})
 	announceTo(table, tablePrefixV4, asA, peerA, 10)
 	announceTo(table, tablePrefixV6, asA, peerB, 20)
 	// peerB's number is missing, so its kept route cannot be written.
 	changes, newPeers := table.TakeChanges(math.MaxInt)
 	delete(newPeers, peerB)
 	err := db.WriteRouteChanges(changes, newPeers)
 	if !errors.Is(err, errUnknownRoutePeer) {
 		t.Fatalf("WriteRouteChanges = %v, want %v", err, errUnknownRoutePeer)
 	}
 	peers := readRoutePeerRows(t, db)
 	if len(peers) != 0 {
 		t.Errorf("route_peers = %+v after the failed write, want none", peers)
 	}
 	var routes int
 	err = db.db.QueryRowContext(t.Context(),
 		"SELECT COUNT(*) FROM routes").Scan(&routes)
 	if err != nil {
 		t.Fatalf("counting the routes: %v", err)
 	}
 	if routes != 0 {
 		t.Errorf("routes holds %d rows after the failed write, want none", routes)
 	}
 }
 // Parameters for BenchmarkReadRouteTable.
 const (
 	// benchTablePairs is how many prefix and origin AS pairs the table holds:
 	// one origin AS for each prefix. Every benchTableV6Every-th prefix is an
 	// IPv6 /48, the others IPv4 /24s.
 	benchTablePairs   = 200000
 	benchTableV6Every = 5
 	// benchTablePeers is how many peers there are, about as many as RIS has.
 	// benchTablePeersPerPair is how many of them, picked at random, carry each
 	// pair: RIS's 460 million routes over 1.4 million pairs.
 	benchTablePeers        = 1400
 	benchTablePeersPerPair = 330
 	// benchTableBatch is how many changes each write holds.
 	benchTableBatch = 10000
 )
 // BenchmarkReadRouteTable times the read of a routing table of 200,000 prefix
 // and origin AS pairs, each carried by 330 of 1,400 peers and keeping two
 // routes. It writes that table first. It reports the bytes of the database
 // file per pair. It is run by hand, not by make test, for example in the test
 // image:
 //
 //	go test -run '^$' -bench ReadRouteTable -benchtime 5x ./internal/database/
 func BenchmarkReadRouteTable(b *testing.B) {
 	db, err := New(&config.Config{StateDir: b.TempDir()}, logger.New())
 	if err != nil {
 		b.Fatalf("failed to create database: %v", err)
 	}
 	defer func() { _ = db.Close() }()
 	//nolint:gosec // The benchmark needs the same table every run.
 	rng := rand.New(rand.NewPCG(1, 2))
 	newPeers := make(map[string]uint, benchTablePeers)
 	for number := range uint(benchTablePeers) {
 		newPeers[benchPeerAddress(number)] = number
 	}
 	for first := 0; first < benchTablePairs; first += benchTableBatch {
 		changes := make([]routetable.Change, 0, benchTableBatch)
 		for pair := first; pair < first+benchTableBatch; pair++ {
 			changes = append(changes, benchTableChange(rng, pair))
 		}
 		err := db.WriteRouteChanges(changes, newPeers)
 		if err != nil {
 			b.Fatalf("WriteRouteChanges: %v", err)
 		}
 		newPeers = nil
 	}
 	// The WAL is copied into the database file, whose size is reported.
 	err = db.Checkpoint(b.Context())
 	if err != nil {
 		b.Fatalf("Checkpoint: %v", err)
 	}
 	file, err := os.Stat(db.path)
 	if err != nil {
 		b.Fatalf("reading the database file's size: %v", err)
 	}
 	for b.Loop() {
 		table, err := db.ReadRouteTable(b.Context())
 		if err != nil {
 			b.Fatalf("ReadRouteTable: %v", err)
 		}
 		counts := table.Counts()
 		if counts.IPv4Prefixes+counts.IPv6Prefixes != benchTablePairs {
 			b.Fatalf("read %d prefixes, want %d",
 				counts.IPv4Prefixes+counts.IPv6Prefixes, benchTablePairs)
 		}
 	}
 	// After the loop: b.Loop drops the metrics reported before it starts.
 	b.ReportMetric(float64(file.Size())/benchTablePairs, "file-bytes/pair")
 }
 // benchPeerAddress returns the address of the peer numbered number.
 func benchPeerAddress(number uint) string {
 	const addressesPerBlock = 256
 	return fmt.Sprintf("198.18.%d.%d",
 		number/addressesPerBlock, number%addressesPerBlock)
 }
 // benchTableChange returns the content of the pair numbered pair: its prefix,
 // its origin AS, benchTablePeersPerPair peers picked at random, and the routes
 // of two of them, each with an AS path of four ASes.
 func benchTableChange(rng *rand.Rand, pair int) routetable.Change {
 	const (
 		firstOrigin  = 64500
 		transitASes  = 50000
 		olderSeconds = 10
 	)
 	text := fmt.Sprintf("%d.%d.%d.0/24", 1+pair>>16, (pair>>8)%256, pair%256)
 	if pair%benchTableV6Every == 0 {
 		text = fmt.Sprintf("2001:%x:%x::/48", pair>>16, pair%65536)
 	}
 	prefix := netip.MustParsePrefix(text)
 	origin := firstOrigin + pair%transitASes
 	peers := bitset.New(benchTablePeers)
 	for peers.Count() < benchTablePeersPerPair {
 		peers.Set(rng.UintN(benchTablePeers))
 	}
 	change := routetable.Change{Prefix: prefix, OriginASN: origin, Peers: peers}
 	// The routes of the first two peers, newest first.
 	for i, number := range slices.Collect(peers.EachSet())[:keptRoutesPerRow] {
 		change.Routes = append(change.Routes, routetable.Route{
 			Peer: benchPeerAddress(number),
 			ASPath: []int{
 				firstOrigin + rng.IntN(transitASes),
 				firstOrigin + rng.IntN(transitASes),
 				firstOrigin + rng.IntN(transitASes),
 				origin,
 			},
 			Time: tableTime(pair - i*olderSeconds),
 		})
 	}
 	return change
 }
@@ -89,31 +89,61 @@ CREATE INDEX IF NOT EXISTS idx_bgp_peers_asn ON bgp_peers(peer_asn);
 CREATE INDEX IF NOT EXISTS idx_bgp_peers_last_seen ON bgp_peers(last_seen);
 CREATE INDEX IF NOT EXISTS idx_bgp_peers_ip ON bgp_peers(peer_ip);
-- The whole routing table, as internal/routetable keeps it in memory: one row
+-- IPv4 routing table maintained by PrefixHandler. A route write changes the
-- for each prefix and origin AS that some peer carries. Startup reads every
+-- table and its entry in every index on a column the write sets, so the table
-- row, and the rows of the pairs that change are written back.
+-- has only the indexes that the queries named with them use.
-CREATE TABLE IF NOT EXISTS routes (
+CREATE TABLE IF NOT EXISTS live_routes_v4 (
-	prefix TEXT NOT NULL, -- in the text form Go's net/netip prints
+	-- The row id, which the prefix-length pages' sample draws through the
 	-- mask_length index. Declared as a column, it stays the same for as long
 	-- as the route is live, also through a VACUUM.
 	id INTEGER PRIMARY KEY,
 	prefix TEXT NOT NULL,
 	mask_length INTEGER NOT NULL, -- CIDR mask length (0-32)
 	origin_asn INTEGER NOT NULL,
-	-- The peers whose current route to the prefix has this origin AS: a set
+	peer_ip TEXT NOT NULL,
-	-- of their numbers in route_peers, as the bitset package's MarshalBinary
+	as_path TEXT NOT NULL, -- JSON array
-	-- writes it.
+	next_hop TEXT NOT NULL,
-	peers BLOB NOT NULL,
+	last_updated DATETIME NOT NULL,
-	-- The newest of those routes and the one before it, the two kept in full.
+	-- A peer has at most one route for a prefix. This key finds the route a
-	-- Each has its peer's number in route_peers, its AS path as a JSON array,
+	-- write updates or deletes and, peer_ip coming first, all of a peer's
-	-- and its time in seconds since 1970, UTC. A route that is not kept has
+	-- routes when its BGP session goes down.
-	-- NULL in its three columns.
+	UNIQUE(peer_ip, prefix)
 	newest_peer INTEGER,
 	newest_as_path TEXT,
 	newest_time INTEGER,
 	older_peer INTEGER,
 	older_as_path TEXT,
 	older_time INTEGER,
 	PRIMARY KEY (prefix, origin_asn)
 ) WITHOUT ROWID;
 -- The peers of the routes table, each with the number it has there.
 CREATE TABLE IF NOT EXISTS route_peers (
 	number INTEGER PRIMARY KEY,
 	address TEXT NOT NULL UNIQUE
 );
 -- IPv6 routing table maintained by PrefixHandler, as live_routes_v4.
 CREATE TABLE IF NOT EXISTS live_routes_v6 (
 	id INTEGER PRIMARY KEY,
 	prefix TEXT NOT NULL,
 	mask_length INTEGER NOT NULL, -- CIDR mask length (0-128)
 	origin_asn INTEGER NOT NULL,
 	peer_ip TEXT NOT NULL,
 	as_path TEXT NOT NULL, -- JSON array
 	next_hop TEXT NOT NULL,
 	last_updated DATETIME NOT NULL,
 	UNIQUE(peer_ip, prefix)
 );
 -- Indexes for both live route tables, and the queries that use each.
 --
 -- prefix, last_updated: a prefix's routes, for the prefix page and its API
 -- answer, the IP lookup and its peer count, and the check whether a prefix
 -- still has a live route; and a prefix's newest route for the prefix-length
 -- pages and the AS page, in one search whatever the number of peers.
 CREATE INDEX IF NOT EXISTS idx_live_routes_v4_prefix_last_updated ON live_routes_v4(prefix, last_updated);
 CREATE INDEX IF NOT EXISTS idx_live_routes_v6_prefix_last_updated ON live_routes_v6(prefix, last_updated);
 -- mask_length: the prefix-length pages' random sample, the row id range of a
 -- mask length and the first route of it at or after a row id.
 CREATE INDEX IF NOT EXISTS idx_live_routes_v4_mask_length ON live_routes_v4(mask_length);
 CREATE INDEX IF NOT EXISTS idx_live_routes_v6_mask_length ON live_routes_v6(mask_length);
 -- mask_length, prefix: the prefix-length pages' list of a mask length's
 -- prefixes in text order, and the prefix distribution read at startup.
 CREATE INDEX IF NOT EXISTS idx_live_routes_v4_mask_prefix ON live_routes_v4(mask_length, prefix);
 CREATE INDEX IF NOT EXISTS idx_live_routes_v6_mask_prefix ON live_routes_v6(mask_length, prefix);
 -- origin_asn, prefix: the prefixes an AS originates, each in one search
 -- whatever the number of peers, for the AS page and its API answer.
 CREATE INDEX IF NOT EXISTS idx_live_routes_v4_origin_prefix ON live_routes_v4(origin_asn, prefix);
 CREATE INDEX IF NOT EXISTS idx_live_routes_v6_origin_prefix ON live_routes_v6(origin_asn, prefix);
 -- last_updated: the oldest and newest route times in /api/v1/stats and
 -- /status.json.
 CREATE INDEX IF NOT EXISTS idx_live_routes_v4_last_updated ON live_routes_v4(last_updated);
 CREATE INDEX IF NOT EXISTS idx_live_routes_v6_last_updated ON live_routes_v6(last_updated);
@@ -1,6 +1,8 @@
 package database
 import (
 	"fmt"
 	"net"
 	"strings"
 	"github.com/google/uuid"
@@ -18,3 +20,15 @@ func detectIPVersion(prefix string) int {
 	return ipVersionV4
 }
 // prefixMaskLength returns the mask length of a prefix such as 192.0.2.0/24.
 func prefixMaskLength(prefix string) (int, error) {
 	_, network, err := net.ParseCIDR(prefix)
 	if err != nil {
 		return 0, fmt.Errorf("invalid prefix %s: %w", prefix, err)
 	}
 	maskLength, _ := network.Mask.Size()
 	return maskLength, nil
 }
@@ -34,7 +34,7 @@ type Tracker struct {
 	// Announcement/withdrawal metrics
 	announcementCounter metrics.Counter
 	withdrawalCounter   metrics.Counter
-	churnPerMinute      minuteCounter // prefix announcements and withdrawals
+	churnRate           metrics.Meter // combined announcements + withdrawals per second
 	// BGP peer tracking
 	bgpPeerCount atomic.Int32
@@ -56,7 +56,7 @@ func New() *Tracker {
 		ipv6UpdateRate:      metrics.NewMeter(),
 		announcementCounter: metrics.NewCounter(),
 		withdrawalCounter:   metrics.NewCounter(),
-		churnPerMinute:      minuteCounter{now: time.Now},
+		churnRate:           metrics.NewMeter(),
 	}
 }
@@ -156,13 +156,13 @@ func (t *Tracker) RecordIPv6Update() {
 // RecordAnnouncement records a route announcement
 func (t *Tracker) RecordAnnouncement() {
 	t.announcementCounter.Inc(1)
-	t.churnPerMinute.add()
+	t.churnRate.Mark(1)
 }
 // RecordWithdrawal records a route withdrawal
 func (t *Tracker) RecordWithdrawal() {
 	t.withdrawalCounter.Inc(1)
-	t.churnPerMinute.add()
+	t.churnRate.Mark(1)
 }
 // SetBGPPeerCount updates the current BGP peer count
@@ -198,10 +198,9 @@ func (t *Tracker) GetWithdrawalCount() uint64 {
 	return uint64(count)
 }
-// GetChurnPerMinute returns the number of prefix announcements and
+// GetChurnRate returns the route churn rate per second
-// withdrawals, from all peers, in the last full clock minute.
+func (t *Tracker) GetChurnRate() float64 {
-func (t *Tracker) GetChurnPerMinute() int {
+	return t.churnRate.Rate1()
 	return t.churnPerMinute.lastFullMinute()
 }
 // GetRouteMetrics returns current route update metrics
@@ -1,59 +0,0 @@
 package metrics
 import (
 	"sync"
 	"time"
 )
 // minuteCounter counts events in each clock minute and reports the count of
 // the last full minute. It is safe for concurrent use.
 type minuteCounter struct {
 	mu  sync.Mutex
 	now func() time.Time
 	// minute is the start of the minute that count belongs to.
 	minute time.Time
 	count  int
 	// lastMinuteCount is the count of the minute just before minute.
 	lastMinuteCount int
 }
 // add counts one event in the current minute.
 func (c *minuteCounter) add() {
 	c.mu.Lock()
 	defer c.mu.Unlock()
 	c.moveToCurrentMinute()
 	c.count++
 }
 // lastFullMinute returns the number of events in the minute that ended most
 // recently.
 func (c *minuteCounter) lastFullMinute() int {
 	c.mu.Lock()
 	defer c.mu.Unlock()
 	c.moveToCurrentMinute()
 	return c.lastMinuteCount
 }
 // moveToCurrentMinute starts a new count when the clock has moved into
 // another minute. The count it ends becomes the last full minute's count when
 // its minute is the one just before the current minute. Otherwise the last
 // full minute had no events. The caller holds mu.
 func (c *minuteCounter) moveToCurrentMinute() {
 	minute := c.now().Truncate(time.Minute)
 	if minute.Equal(c.minute) {
 		return
 	}
 	if minute.Sub(c.minute) == time.Minute {
 		c.lastMinuteCount = c.count
 	} else {
 		c.lastMinuteCount = 0
 	}
 	c.minute = minute
 	c.count = 0
 }
@@ -1,86 +0,0 @@
 package metrics
 import (
 	"sync"
 	"testing"
 	"time"
 )
 // TestChurnPerMinuteCountsLastFullMinute announces and withdraws prefixes on
 // an injected clock and expects each minute's whole count once that minute
 // has ended, and 0 for a minute with none.
 func TestChurnPerMinuteCountsLastFullMinute(t *testing.T) {
 	t.Parallel()
 	now := time.Date(2026, 10, 26, 12, 0, 30, 0, time.UTC)
 	tracker := New()
 	tracker.churnPerMinute.now = func() time.Time { return now }
 	expectChurn := func(want int, why string) {
 		t.Helper()
 		got := tracker.GetChurnPerMinute()
 		if got != want {
 			t.Fatalf("at %s churn = %d, want %d: %s",
 				now.Format(time.TimeOnly), got, want, why)
 		}
 	}
 	const firstMinuteChurn = 2
 	tracker.RecordAnnouncement()
 	tracker.RecordWithdrawal()
 	expectChurn(0, "12:00 has not ended")
 	now = time.Date(2026, 10, 26, 12, 1, 59, 0, time.UTC)
 	tracker.RecordAnnouncement()
 	expectChurn(firstMinuteChurn, "12:00 had one announcement and one withdrawal")
 	now = time.Date(2026, 10, 26, 12, 2, 0, 0, time.UTC)
 	expectChurn(1, "12:01 had one announcement")
 	now = time.Date(2026, 10, 26, 12, 4, 0, 0, time.UTC)
 	expectChurn(0, "12:03 had none")
 	tracker.RecordWithdrawal()
 	now = time.Date(2026, 10, 26, 12, 6, 0, 0, time.UTC)
 	expectChurn(0, "12:05 had none, though 12:04 had one withdrawal")
 }
 // TestChurnPerMinuteCountsConcurrentRecords announces prefixes from several
 // goroutines at once and expects every one counted.
 func TestChurnPerMinuteCountsConcurrentRecords(t *testing.T) {
 	t.Parallel()
 	const (
 		goroutines          = 8
 		recordsPerGoroutine = 1000
 	)
 	now := time.Date(2026, 10, 26, 12, 0, 0, 0, time.UTC)
 	tracker := New()
 	tracker.churnPerMinute.now = func() time.Time { return now }
 	var wg sync.WaitGroup
 	for range goroutines {
 		wg.Go(func() {
 			for range recordsPerGoroutine {
 				tracker.RecordAnnouncement()
 			}
 		})
 	}
 	wg.Wait()
 	now = now.Add(time.Minute)
 	want := goroutines * recordsPerGoroutine
 	if got := tracker.GetChurnPerMinute(); got != want {
 		t.Fatalf("churn = %d, want %d", got, want)
 	}
 }
@@ -4,7 +4,6 @@ package ristypes
 import (
 	"encoding/json"
 	"slices"
 	"time"
 )
@@ -25,8 +24,7 @@ const (
 )
 // ASPath is a BGP AS path as the feed writes it: an array of AS numbers in
-// which an AS set is an array of its members, such as [1, 2, [3, 4]]. A path
+// which an AS set is an array of its members, such as [1, 2, [3, 4]].
 // that holds AS 0 decodes as an empty one (UnmarshalJSON).
 type ASPath struct {
 	// Sequence is the path's AS numbers in order. A set of one member that
 	// ends the path counts as that AS and is its last element. The members of
@@ -39,56 +37,34 @@ type ASPath struct {
 	Set []int
 }
 // NoOrigin is the origin AS of a route whose origin is not known. AS 0 is
 // reserved, so no AS has this number.
 const NoOrigin = 0
 // Origin returns the AS that originated the route: the last AS of the
-// sequence, or NoOrigin when the path ends in a set of several members or is
+// sequence, or 0 (none) when the path ends in a set of several members or is
 // empty.
 func (p *ASPath) Origin() int {
 	if len(p.Set) > 0 || len(p.Sequence) == 0 {
-		return NoOrigin
+		return 0
 	}
 	return p.Sequence[len(p.Sequence)-1]
 }
-// UnmarshalJSON implements the json.Unmarshaler interface for ASPath. A path
+// UnmarshalJSON implements the json.Unmarshaler interface for ASPath.
 // that holds AS 0 anywhere, a member of an AS set included, decodes as an empty
 // path: RFC 7607 makes such a path malformed and its announcements
 // withdrawals. On an announcement with an empty path the prefix handler
 // deletes the peer's route, and the AS and peering handlers record nothing.
 func (p *ASPath) UnmarshalJSON(data []byte) error {
 	path, err := decodeASPath(data)
 	if err != nil {
 		return err
 	}
 	if slices.Contains(path.Sequence, 0) || slices.Contains(path.Set, 0) {
 		path = ASPath{}
 	}
 	*p = path
 	return nil
 }
 // decodeASPath decodes an AS path as the feed writes it.
 func decodeASPath(data []byte) (ASPath, error) {
 	// Most paths have no AS set and decode as a plain array of integers.
 	var sequence []int
 	err := json.Unmarshal(data, &sequence)
 	if err == nil {
-		return ASPath{Sequence: sequence}, nil
+		*p = ASPath{Sequence: sequence}
 		return nil
 	}
 	var raw []any
 	err = json.Unmarshal(data, &raw)
 	if err != nil {
-		return ASPath{}, err
+		return err
 	}
 	path := ASPath{Sequence: make([]int, 0, len(raw))}
@@ -114,7 +90,9 @@ func decodeASPath(data []byte) (ASPath, error) {
 		}
 	}
-	return path, nil
+	*p = path
 	return nil
 }
 // RISLiveMessage represents the outer wrapper message from the RIPE RIS Live stream.
@@ -145,33 +145,3 @@ func TestASPathKeepsATrailingSetApart(t *testing.T) {
 		})
 	}
 }
 // TestASPathWithASZeroDecodesAsAnEmptyPath decodes AS paths that hold AS 0
 // before their end, at their end, or in an AS set. RFC 7607 makes such a path
 // malformed, so each decodes as an empty path.
 func TestASPathWithASZeroDecodesAsAnEmptyPath(t *testing.T) {
 	t.Parallel()
 	for _, path := range []string{
 		"[64496, 0, 64497]",
 		"[64496, 0]",
 		"[64496, [0, 64497], 64498]",
 		"[64496, [64497, 0]]",
 	} {
 		t.Run(path, func(t *testing.T) {
 			t.Parallel()
 			var got ristypes.ASPath
 			err := json.Unmarshal([]byte(path), &got)
 			if err != nil {
 				t.Fatalf("unmarshal %s: %v", path, err)
 			}
 			if len(got.Sequence) > 0 || len(got.Set) > 0 {
 				t.Errorf("%s decoded to sequence %v and set %v, want an empty path",
 					path, got.Sequence, got.Set)
 			}
 		})
 	}
 }
@@ -1,155 +0,0 @@
 package routetable_test
 import (
 	"fmt"
 	"math"
 	"math/rand/v2"
 	"net/netip"
 	"runtime"
 	"testing"
 	"time"
 	"git.eeqj.de/sneak/routewatch/internal/routetable"
 )
 // Parameters for BenchmarkApplyMixedBatch.
 const (
 	// benchPeers is how many peers there are, about as many as RIS has.
 	benchPeers = 1400
 	// benchPrefixes is how many IPv4 /24 prefixes the table holds, and
 	// benchPeersPerPrefix how many peers, picked at random, carry each.
 	benchPrefixes       = 100000
 	benchPeersPerPrefix = 20
 	// benchBatchSize is how many updates the timed batch holds, as many as
 	// the prefix handler's largest batch (prefixBatchMaxSize in
 	// internal/routewatch).
 	benchBatchSize = 250000
 	// In the timed batch every benchWithdrawalEvery-th update is a
 	// withdrawal, and every benchNewOriginEvery-th announcement has an
 	// origin AS other than the prefix's.
 	benchWithdrawalEvery = 5
 	benchNewOriginEvery  = 7
 	// benchOrigins is how many origin ASes the prefixes are spread over,
 	// from benchFirstASN on: 20 prefixes each, about as many as an origin AS
 	// has on average in the full table.
 	benchOrigins  = 5000
 	benchFirstASN = 64500
 	// benchUpdatesPerSecond is how many updates share one time.
 	benchUpdatesPerSecond = 1000
 	benchMaskLength       = 24
 )
 // benchUpdate is one update of the benchmark.
 type benchUpdate struct {
 	prefix   netip.Prefix
 	origin   int
 	route    routetable.Route
 	withdraw bool
 }
 // BenchmarkApplyMixedBatch times one batch of 250,000 updates of routes picked
 // at random: announcements, withdrawals and announcements with a new origin AS.
 // The table it applies them to holds 100,000 IPv4 prefixes from 5,000 origin
 // ASes, each carried by 20 of 1,400 peers. It reports the heap bytes that table
 // takes per prefix and origin AS pair. It is run by hand, not by make test, for
 // example in the test image:
 //
 //	go test -run '^$' -bench MixedBatch -benchtime 10x ./internal/routetable/
 func BenchmarkApplyMixedBatch(b *testing.B) {
 	//nolint:gosec // The benchmark needs the same updates every run.
 	rng := rand.New(rand.NewPCG(1, 2))
 	peers := make([]string, benchPeers)
 	for i := range peers {
 		peers[i] = fmt.Sprintf("198.18.%d.%d", i/256, i%256)
 	}
 	before := heapBytes()
 	table := routetable.New(routetable.Params{})
 	updates := 0
 	for prefix := range benchPrefixes {
 		for range benchPeersPerPrefix {
 			peer := peers[rng.IntN(benchPeers)]
 			apply(table, benchAnnouncement(rng, prefix, peer, updates, false))
 			updates++
 		}
 	}
 	// The record of changes is handed over every second while routewatch
 	// runs, so it is not part of the table's size.
 	table.TakeChanges(math.MaxInt)
 	bytesPerPair := float64(heapBytes()-before) / benchPrefixes
 	batch := make([]benchUpdate, 0, benchBatchSize)
 	for i := range benchBatchSize {
 		update := benchAnnouncement(rng, rng.IntN(benchPrefixes),
 			peers[rng.IntN(benchPeers)], updates+i, i%benchNewOriginEvery == 0)
 		update.withdraw = i%benchWithdrawalEvery == 0
 		batch = append(batch, update)
 	}
 	for b.Loop() {
 		for _, update := range batch {
 			apply(table, update)
 		}
 	}
 	// After the loop: b.Loop drops the metrics reported before it starts.
 	b.ReportMetric(bytesPerPair, "bytes/pair")
 }
 // benchAnnouncement returns the announcement of the prefix numbered prefix, a
 // /24 from 1.0.0.0/24 on, by peer. It is the updates-th update of the
 // benchmark, and its AS path holds four ASes from the peer's AS to the origin
 // AS. newOrigin gives it an origin AS other than the prefix's.
 func benchAnnouncement(
 	rng *rand.Rand, prefix int, peer string, updates int, newOrigin bool,
 ) benchUpdate {
 	origin := benchFirstASN + prefix%benchOrigins
 	if newOrigin {
 		origin += benchOrigins
 	}
 	start := time.Date(2026, 1, 2, 3, 4, 5, 0, time.UTC)
 	return benchUpdate{
 		prefix: netip.MustParsePrefix(fmt.Sprintf("%d.%d.%d.0/%d",
 			1+prefix>>16, (prefix>>8)%256, prefix%256, benchMaskLength)),
 		origin: origin,
 		route: routetable.Route{
 			Peer: peer,
 			ASPath: []int{
 				benchFirstASN + rng.IntN(benchOrigins),
 				benchFirstASN + rng.IntN(benchOrigins),
 				benchFirstASN + rng.IntN(benchOrigins),
 				origin,
 			},
 			Time: start.Add(time.Duration(updates/benchUpdatesPerSecond) *
 				time.Second),
 		},
 	}
 }
 // apply applies update to table.
 func apply(table *routetable.Table, update benchUpdate) {
 	if update.withdraw {
 		table.Withdraw(update.prefix, update.route.Peer)
 		return
 	}
 	table.Announce(update.prefix, update.origin, update.route)
 }
 // heapBytes returns the bytes of the live heap objects, after a collection.
 func heapBytes() uint64 {
 	runtime.GC()
 	var stats runtime.MemStats
 	runtime.ReadMemStats(&stats)
 	return stats.HeapAlloc
 }
@@ -1,233 +0,0 @@
 package routetable
 import (
 	"net/netip"
 	"slices"
 	"time"
 	"github.com/bits-and-blooms/bitset"
 )
 // PrefixSummary is what the table answers about one prefix.
 type PrefixSummary struct {
 	Prefix netip.Prefix
 	// OriginASN is the origin AS that the most peers carry the prefix with.
 	// When several have as many peers, it is the lowest AS number.
 	OriginASN int
 	// Peers is how many peers carry the prefix.
 	Peers int
 	// Newest is the time of the newest kept route of the prefix, or nil when
 	// it keeps none.
 	Newest *time.Time
 }
 // OriginatedPrefix is one prefix an AS originates.
 type OriginatedPrefix struct {
 	Prefix netip.Prefix
 	// Newest is the time of the newest kept route of the prefix with that
 	// origin AS, or nil when it keeps none.
 	Newest *time.Time
 }
 // Counts are the table's figures for the stats.
 type Counts struct {
 	// Pairs counts the prefix and origin AS pairs that some peer carries.
 	Pairs int
 	// Peers counts the peers that have a number: those given in
 	// Params.PeerNumbers and those numbered since.
 	Peers        int
 	IPv4Prefixes int
 	IPv6Prefixes int
 	// IPv4PrefixesByLength[n] and IPv6PrefixesByLength[n] are how many
 	// prefixes of mask length n some peer carries.
 	IPv4PrefixesByLength []int
 	IPv6PrefixesByLength []int
 	// IPv4Routes and IPv6Routes count peer and prefix pairs: each peer that
 	// carries a prefix counts once for it.
 	IPv4Routes int
 	IPv6Routes int
 	// OriginsWithoutKeptRoute counts the prefix and origin AS pairs that peers
 	// carry but whose kept routes were all withdrawn.
 	OriginsWithoutKeptRoute int
 	// OldestKeptRoute and NewestKeptRoute are the times of the oldest and the
 	// newest kept routes, or nil when the table keeps none.
 	OldestKeptRoute *time.Time
 	NewestKeptRoute *time.Time
 }
 // Lookup returns the most specific prefix that holds addr and that some peer
 // carries. It ignores prefixes shorter than /8 for IPv4 and /16 for IPv6. It
 // makes one map lookup per mask length, and reports false when no prefix
 // holds addr.
 func (t *Table) Lookup(addr netip.Addr) (PrefixSummary, bool) {
 	t.mu.RLock()
 	defer t.mu.RUnlock()
 	// An IPv4 address written in IPv6 form (::ffff:192.0.2.1) is looked up as
 	// IPv4.
 	addr = addr.Unmap()
 	f := t.familyOf(addr)
 	for bits := addr.BitLen(); bits >= f.minLookupLength; bits-- {
 		prefix := netip.PrefixFrom(addr, bits).Masked()
 		origins, found := f.byLength[bits][prefix]
 		if found {
 			return summarize(prefix, origins), true
 		}
 	}
 	return PrefixSummary{}, false
 }
 // OriginatedPrefixes returns the prefixes AS asn originates, in prefix order.
 func (t *Table) OriginatedPrefixes(asn int) []OriginatedPrefix {
 	t.mu.RLock()
 	defer t.mu.RUnlock()
 	prefixes := make([]OriginatedPrefix, 0, len(t.byOrigin[asn]))
 	for prefix, o := range t.byOrigin[asn] {
 		prefixes = append(prefixes,
 			OriginatedPrefix{Prefix: prefix, Newest: o.newestTime()})
 	}
 	slices.SortFunc(prefixes, func(a, b OriginatedPrefix) int {
 		return a.Prefix.Compare(b.Prefix)
 	})
 	return prefixes
 }
 // Origins returns each origin AS of prefix, in AS number order, with its peers
 // and its kept routes. It returns nil when no peer carries the prefix.
 func (t *Table) Origins(prefix netip.Prefix) []Origin {
 	t.mu.RLock()
 	defer t.mu.RUnlock()
 	if !prefix.IsValid() {
 		return nil
 	}
 	var origins []Origin
 	for _, o := range t.origins(prefix.Masked()) {
 		origins = append(origins, Origin{
 			ASN:    o.asn,
 			Peers:  t.addresses(&o.peers),
 			Routes: t.exportRoutes(o.routes),
 		})
 	}
 	return origins
 }
 // SamplePrefixes returns up to limit of the prefixes of IP version ipVersion
 // (4 or 6) and mask length maskLength. It reads only the prefixes it returns.
 // Go starts each walk over a map at a random place, so each call returns
 // another sample.
 func (t *Table) SamplePrefixes(ipVersion, maskLength, limit int) []PrefixSummary {
 	t.mu.RLock()
 	defer t.mu.RUnlock()
 	var f *family
 	switch ipVersion {
 	case ipVersion4:
 		f = &t.ipv4
 	case ipVersion6:
 		f = &t.ipv6
 	default:
 		return nil
 	}
 	if maskLength < 0 || maskLength >= len(f.byLength) || limit <= 0 {
 		return nil
 	}
 	prefixes := f.byLength[maskLength]
 	sample := make([]PrefixSummary, 0, min(limit, len(prefixes)))
 	for prefix, origins := range prefixes {
 		if len(sample) == limit {
 			break
 		}
 		sample = append(sample, summarize(prefix, origins))
 	}
 	return sample
 }
 // Counts returns the table's figures for the stats. The writes keep them up to
 // date, so this reads no prefix.
 func (t *Table) Counts() Counts {
 	t.mu.RLock()
 	defer t.mu.RUnlock()
 	counts := Counts{
 		Peers:                   len(t.peerNumbers),
 		IPv4PrefixesByLength:    t.ipv4.prefixesByLength(),
 		IPv6PrefixesByLength:    t.ipv6.prefixesByLength(),
 		IPv4Routes:              t.ipv4.routes,
 		IPv6Routes:              t.ipv6.routes,
 		OriginsWithoutKeptRoute: t.originsWithoutKeptRoute,
 	}
 	for _, n := range counts.IPv4PrefixesByLength {
 		counts.IPv4Prefixes += n
 	}
 	for _, n := range counts.IPv6PrefixesByLength {
 		counts.IPv6Prefixes += n
 	}
 	for _, prefixes := range t.byOrigin {
 		counts.Pairs += len(prefixes)
 	}
 	oldest, found := t.keptTimes.Min()
 	if found {
 		counts.OldestKeptRoute = &oldest.time
 	}
 	newest, found := t.keptTimes.Max()
 	if found {
 		counts.NewestKeptRoute = &newest.time
 	}
 	return counts
 }
 // addresses returns the addresses of the peers in peers, in number order.
 func (t *Table) addresses(peers *bitset.BitSet) []string {
 	addresses := make([]string, 0, peers.Count())
 	for number := range peers.EachSet() {
 		addresses = append(addresses, t.peerAddresses[number])
 	}
 	return addresses
 }
 // summarize returns the summary of prefix, whose origins are in AS number
 // order.
 func summarize(prefix netip.Prefix, origins []*origin) PrefixSummary {
 	summary := PrefixSummary{Prefix: prefix}
 	mostPeers := 0
 	for _, o := range origins {
 		peers := int(o.peers.Count())
 		summary.Peers += peers
 		if peers > mostPeers {
 			mostPeers = peers
 			summary.OriginASN = o.asn
 		}
 		newest := o.newestTime()
 		if newest != nil && (summary.Newest == nil || newest.After(*summary.Newest)) {
 			summary.Newest = newest
 		}
 	}
 	return summary
 }
@@ -1,265 +0,0 @@
 package routetable_test
 import (
 	"net/netip"
 	"reflect"
 	"testing"
 	"git.eeqj.de/sneak/routewatch/internal/routetable"
 )
 // announceAll has each listed peer announce prefix with origin AS asn, the
 // peer at index i i*10 seconds after start.
 func announceAll(
 	table *routetable.Table, prefix string, asn, start int, peers ...string,
 ) {
 	const secondsBetweenPeers = 10
 	for i, peer := range peers {
 		table.Announce(netip.MustParsePrefix(prefix), asn,
 			routeOf(peer, asn, start+i*secondsBetweenPeers))
 	}
 }
 func TestLookup(t *testing.T) {
 	t.Parallel()
 	table := routetable.New(routetable.Params{})
 	announceAll(table, "10.0.0.0/8", asA, 10, peerA)
 	// Three peers with two origins: asB has more of them.
 	announceAll(table, "10.1.0.0/16", asA, 10, peerA)
 	announceAll(table, "10.1.0.0/16", asB, 20, peerB, peerC)
 	// Two origins with one peer each: the lower AS number wins.
 	announceAll(table, prefixV4, asB, 20, peerB)
 	announceAll(table, prefixV4, asA, 10, peerA)
 	// An origin whose kept routes were withdrawn: no newest time.
 	announceAll(table, "10.9.0.0/16", asA, 10, peerA, peerB, peerC)
 	table.Withdraw(netip.MustParsePrefix("10.9.0.0/16"), peerB)
 	table.Withdraw(netip.MustParsePrefix("10.9.0.0/16"), peerC)
 	announceAll(table, "2001:db8::/32", asA, 10, peerA)
 	announceAll(table, prefixV6, asB, 20, peerB)
 	announceAll(table, "3000::/16", asA, 10, peerA)
 	// Shorter than the lookup uses.
 	announceAll(table, "192.0.0.0/7", asA, 10, peerA)
 	announceAll(table, "2000::/15", asA, 10, peerA)
 	tests := []struct {
 		addr string
 		// want is the summary's prefix, or empty when none is found.
 		want      string
 		originASN int
 		peers     int
 		newest    int // in seconds after the start; 0 for none
 	}{
 		{"10.1.2.3", prefixV4, asA, 2, 20},
 		{"::ffff:10.1.2.3", prefixV4, asA, 2, 20},
 		{"10.1.3.4", "10.1.0.0/16", asB, 3, 30},
 		{"10.2.0.1", "10.0.0.0/8", asA, 1, 10},
 		{"10.9.0.1", "10.9.0.0/16", asA, 1, 0},
 		{"192.0.2.1", "", 0, 0, 0},
 		{"2001:db8:1::5", prefixV6, asB, 1, 20},
 		{"2001:db8:2::1", "2001:db8::/32", asA, 1, 10},
 		{"3000::1", "3000::/16", asA, 1, 10},
 		{"2001:db9::1", "", 0, 0, 0},
 	}
 	for _, tc := range tests {
 		t.Run(tc.addr, func(t *testing.T) {
 			t.Parallel()
 			got, found := table.Lookup(netip.MustParseAddr(tc.addr))
 			if tc.want == "" {
 				if found {
 					t.Errorf("Lookup(%s) = %+v, want none", tc.addr, got)
 				}
 				return
 			}
 			want := routetable.PrefixSummary{
 				Prefix:    netip.MustParsePrefix(tc.want),
 				OriginASN: tc.originASN,
 				Peers:     tc.peers,
 			}
 			if tc.newest != 0 {
 				want.Newest = timeAt(tc.newest)
 			}
 			if !found || !reflect.DeepEqual(got, want) {
 				t.Errorf("Lookup(%s) = %+v, %v; want %+v", tc.addr, got, found, want)
 			}
 		})
 	}
 }
 func TestOriginatedPrefixes(t *testing.T) {
 	t.Parallel()
 	table := routetable.New(routetable.Params{})
 	announceAll(table, "2001:db8::/32", asA, 30, peerA)
 	announceAll(table, prefixV4, asA, 10, peerA)
 	// asB's newer route for the same prefix does not count for asA.
 	announceAll(table, prefixV4, asB, 40, peerB)
 	announceAll(table, "10.1.0.0/16", asA, 10, peerA, peerB)
 	announceAll(table, "10.9.0.0/16", asA, 10, peerA, peerB, peerC)
 	table.Withdraw(netip.MustParsePrefix("10.9.0.0/16"), peerB)
 	table.Withdraw(netip.MustParsePrefix("10.9.0.0/16"), peerC)
 	want := []routetable.OriginatedPrefix{
 		{Prefix: netip.MustParsePrefix("10.1.0.0/16"), Newest: timeAt(20)},
 		{Prefix: netip.MustParsePrefix(prefixV4), Newest: timeAt(10)},
 		{Prefix: netip.MustParsePrefix("10.9.0.0/16")},
 		{Prefix: netip.MustParsePrefix("2001:db8::/32"), Newest: timeAt(30)},
 	}
 	got := table.OriginatedPrefixes(asA)
 	if !reflect.DeepEqual(got, want) {
 		t.Errorf("OriginatedPrefixes(%d) = %+v, want %+v", asA, got, want)
 	}
 	got = table.OriginatedPrefixes(asC)
 	if len(got) != 0 {
 		t.Errorf("OriginatedPrefixes(%d) = %+v, want none", asC, got)
 	}
 }
 func TestSamplePrefixes(t *testing.T) {
 	t.Parallel()
 	table := routetable.New(routetable.Params{})
 	announced := []string{
 		"10.0.0.0/24", "10.0.1.0/24", "10.0.2.0/24", "10.0.3.0/24",
 		"10.0.4.0/24", "10.0.0.0/16",
 		"2001:db8::/48", "2001:db8:1::/48", "2001:db8:2::/48",
 	}
 	for _, prefix := range announced {
 		announceAll(table, prefix, asA, 10, peerA)
 	}
 	tests := []struct {
 		name                         string
 		ipVersion, maskLength, limit int
 		want                         int
 	}{
 		{"fewer than there are", 4, 24, 3, 3},
 		{"more than there are", 4, 24, 10, 5},
 		{"IPv6", 6, 48, 10, 3},
 		{"a mask length with none", 4, 20, 10, 0},
 		{"no such IP version", 5, 24, 10, 0},
 		{"a mask length too long", 4, 33, 10, 0},
 		{"a negative mask length", 4, -1, 10, 0},
 		{"a limit of zero", 4, 24, 0, 0},
 	}
 	for _, tc := range tests {
 		t.Run(tc.name, func(t *testing.T) {
 			t.Parallel()
 			sample := table.SamplePrefixes(tc.ipVersion, tc.maskLength, tc.limit)
 			if len(sample) != tc.want {
 				t.Fatalf("SamplePrefixes(%d, %d, %d) returned %d prefixes, want %d",
 					tc.ipVersion, tc.maskLength, tc.limit, len(sample), tc.want)
 			}
 			seen := make(map[netip.Prefix]bool)
 			for _, got := range sample {
 				want := routetable.PrefixSummary{
 					Prefix: got.Prefix, OriginASN: asA, Peers: 1, Newest: timeAt(10),
 				}
 				if seen[got.Prefix] || got.Prefix.Bits() != tc.maskLength ||
 					!reflect.DeepEqual(got, want) {
 					t.Errorf("SamplePrefixes(%d, %d, %d) returned %+v",
 						tc.ipVersion, tc.maskLength, tc.limit, got)
 				}
 				seen[got.Prefix] = true
 			}
 		})
 	}
 }
 func TestCounts(t *testing.T) {
 	t.Parallel()
 	table := routetable.New(routetable.Params{})
 	checkCounts(t, table, routetable.Counts{
 		IPv4PrefixesByLength: byLength(ipv4Bits, nil),
 		IPv6PrefixesByLength: byLength(ipv6Bits, nil),
 	})
 	announceAll(table, prefixV4, asA, 10, peerA, peerB)
 	announceAll(table, "10.2.0.0/16", asA, 15, peerA)
 	announceAll(table, "2001:db8::/32", asA, 5, peerA)
 	announceAll(table, "2001:db8::/32", asA, 25, peerC)
 	checkCounts(t, table, routetable.Counts{
 		Pairs:                3,
 		Peers:                3,
 		IPv4Prefixes:         2,
 		IPv6Prefixes:         1,
 		IPv4PrefixesByLength: byLength(ipv4Bits, map[int]int{16: 1, 24: 1}),
 		IPv6PrefixesByLength: byLength(ipv6Bits, map[int]int{32: 1}),
 		IPv4Routes:           3,
 		IPv6Routes:           2,
 		OldestKeptRoute:      timeAt(5),
 		NewestKeptRoute:      timeAt(25),
 	})
 	// peerC's route drops peerA's from the kept ones, and peerA leaves the
 	// IPv6 prefix.
 	announceAll(table, prefixV4, asA, 30, peerC)
 	table.Withdraw(netip.MustParsePrefix("2001:db8::/32"), peerA)
 	checkCounts(t, table, routetable.Counts{
 		Pairs:                3,
 		Peers:                3,
 		IPv4Prefixes:         2,
 		IPv6Prefixes:         1,
 		IPv4PrefixesByLength: byLength(ipv4Bits, map[int]int{16: 1, 24: 1}),
 		IPv6PrefixesByLength: byLength(ipv6Bits, map[int]int{32: 1}),
 		IPv4Routes:           4,
 		IPv6Routes:           1,
 		OldestKeptRoute:      timeAt(15),
 		NewestKeptRoute:      timeAt(30),
 	})
 	// peerC was the last peer of the IPv6 prefix. It keeps its number.
 	table.PeerDown(peerC)
 	checkCounts(t, table, routetable.Counts{
 		Pairs:                2,
 		Peers:                3,
 		IPv4Prefixes:         2,
 		IPv4PrefixesByLength: byLength(ipv4Bits, map[int]int{16: 1, 24: 1}),
 		IPv6PrefixesByLength: byLength(ipv6Bits, nil),
 		IPv4Routes:           3,
 		OldestKeptRoute:      timeAt(15),
 		NewestKeptRoute:      timeAt(20),
 	})
 }
 // The address lengths of the two IP versions.
 const (
 	ipv4Bits = 32
 	ipv6Bits = 128
 )
 // byLength returns the prefix counts by mask length, for addresses of bits
 // bits, with counts[n] prefixes of mask length n and none of any other.
 func byLength(bits int, counts map[int]int) []int {
 	all := make([]int, bits+1)
 	for n, count := range counts {
 		all[n] = count
 	}
 	return all
 }
 // checkCounts checks that the table's counts are want.
 func checkCounts(t *testing.T, table *routetable.Table, want routetable.Counts) {
 	t.Helper()
 	got := table.Counts()
 	if !reflect.DeepEqual(got, want) {
 		t.Errorf("Counts() = %+v, want %+v", got, want)
 	}
 }
@@ -1,677 +0,0 @@
 // Package routetable holds the whole routing table in memory. For each prefix
 // and origin AS, it keeps the peers whose current route to the prefix has that
 // origin AS. It also keeps the two newest of those routes in full. It applies
 // announcements, withdrawals and peers' sessions going down. It answers the
 // route reads that the pages and the API need.
 package routetable
 import (
 	"cmp"
 	"maps"
 	"net/netip"
 	"slices"
 	"sync"
 	"time"
 	"github.com/bits-and-blooms/bitset"
 	"github.com/google/btree"
 )
 const (
 	// keptRoutesPerOrigin is how many routes of each prefix and origin AS are
 	// kept in full: the newest ones. Every other peer that carries the prefix
 	// with that origin AS keeps only its bit in the peer set.
 	keptRoutesPerOrigin = 2
 	// keptTimesDegree is the degree of the B-tree that holds the times of the
 	// kept routes in order: each of its nodes holds up to 63 times.
 	keptTimesDegree = 32
 	ipv4Bits = 32
 	ipv6Bits = 128
 	// The address lookup ignores prefixes shorter than these mask lengths. A
 	// default route or a route this short only says where a peer sends traffic
 	// it has no better route for; it does not say who holds the address.
 	minLookupMaskLengthV4 = 8
 	minLookupMaskLengthV6 = 16
 	// The IP versions SamplePrefixes takes.
 	ipVersion4 = 4
 	ipVersion6 = 6
 )
 // Route is one peer's route to one prefix. The next hop is the peer itself, so
 // it is not stored.
 type Route struct {
 	// Peer is the peer's address.
 	Peer   string
 	ASPath []int
 	// Time is when the peer announced the route.
 	Time time.Time
 }
 // Origin is one origin AS of a prefix: the peers whose current route to the
 // prefix has that origin AS, and the newest of those routes in full.
 type Origin struct {
 	// ASN is the origin AS. 0 means no known origin: the path ends in an AS
 	// set of several members.
 	ASN int
 	// Peers are the peers' addresses, in the order of their numbers: the
 	// order they were first seen in.
 	Peers []string
 	// Routes are the kept routes, newest first: at most two, and none when
 	// both were withdrawn while other peers still carry the prefix.
 	Routes []Route
 }
 // Change is the current content of one prefix and origin AS pair that changed:
 // what a database row for the pair holds.
 type Change struct {
 	Prefix    netip.Prefix
 	OriginASN int
 	// Removed says that no peer carries the prefix with this origin AS any
 	// more. Peers and Routes are then nil.
 	Removed bool
 	// Peers holds the number of each peer that carries the prefix with this
 	// origin AS.
 	Peers *bitset.BitSet
 	// Routes are the kept routes, newest first.
 	Routes []Route
 }
 // Params configures New.
 type Params struct {
 	// PeerNumbers holds the number each peer was given before, by address. A
 	// peer not in it gets the next number above all of them the first time it
 	// announces a route.
 	PeerNumbers map[string]uint
 }
 // Table is the routing table. Its methods are safe for concurrent use.
 type Table struct {
 	mu sync.RWMutex
 	ipv4 family
 	ipv6 family
 	// byOrigin holds, for each origin AS, the prefixes it originates.
 	byOrigin map[int]map[netip.Prefix]*origin
 	// peerNumbers and peerAddresses give each peer's number by its address
 	// and its address by its number. nextPeerNumber is the number the next
 	// new peer gets.
 	peerNumbers    map[string]uint
 	peerAddresses  map[uint]string
 	nextPeerNumber uint
 	// peerPrefixes[n] counts the prefixes the peer numbered n carries, for
 	// each n below nextPeerNumber. It is a slice, not a map, because Load
 	// counts once for every peer of every pair it loads: with a map, reading
 	// a full table at startup took several times as long.
 	peerPrefixes []int
 	// newPeers and changed are what TakeChanges hands over: the peers
 	// numbered since it last ran, and the prefix and origin AS pairs changed
 	// since it last took them.
 	newPeers map[string]uint
 	changed  map[pair]struct{}
 	// keptTimes counts the kept routes at each time, in time order, so its
 	// first and last items are the oldest and newest kept routes.
 	keptTimes *btree.BTreeG[keptTime]
 	// originsWithoutKeptRoute counts the origins that peers carry but that
 	// keep no route.
 	originsWithoutKeptRoute int
 }
 // New returns an empty table that numbers new peers on from
 // params.PeerNumbers.
 func New(params Params) *Table {
 	t := &Table{
 		ipv4:          newFamily(ipv4Bits, minLookupMaskLengthV4),
 		ipv6:          newFamily(ipv6Bits, minLookupMaskLengthV6),
 		byOrigin:      make(map[int]map[netip.Prefix]*origin),
 		peerNumbers:   make(map[string]uint, len(params.PeerNumbers)),
 		peerAddresses: make(map[uint]string, len(params.PeerNumbers)),
 		newPeers:      make(map[string]uint),
 		changed:       make(map[pair]struct{}),
 		keptTimes: btree.NewG(keptTimesDegree, func(a, b keptTime) bool {
 			return a.time.Before(b.time)
 		}),
 	}
 	for address, number := range params.PeerNumbers {
 		t.peerNumbers[address] = number
 		t.peerAddresses[number] = address
 		t.nextPeerNumber = max(t.nextPeerNumber, number+1)
 	}
 	t.peerPrefixes = make([]int, t.nextPeerNumber)
 	return t
 }
 // Announce applies an announcement: the peer's current route to prefix is now
 // r, with origin AS originASN. A peer that carried the prefix with another
 // origin AS leaves that origin's peer set, and its route there is dropped. r
 // is kept in full when it is one of the two newest routes of its prefix and
 // origin AS; otherwise only the peer's bit is.
 //
 // An announcement whose path is empty or holds AS 0 is a withdrawal, and the
 // caller passes it to Withdraw instead.
 func (t *Table) Announce(prefix netip.Prefix, originASN int, r Route) {
 	t.mu.Lock()
 	defer t.mu.Unlock()
 	if !prefix.IsValid() {
 		return
 	}
 	prefix = prefix.Masked()
 	peer := t.numberPeer(r.Peer)
 	current := originWithPeer(t.origins(prefix), peer)
 	if current != nil && current.asn != originASN {
 		t.leave(prefix, current, peer)
 	}
 	t.join(prefix, t.findOrAddOrigin(prefix, originASN), route{
 		peer: peer,
 		path: slices.Clone(r.ASPath),
 		time: r.Time,
 	})
 }
 // Withdraw applies a withdrawal: the peer no longer carries prefix. It leaves
 // the prefix's peer set, and its kept route, if any, is dropped.
 func (t *Table) Withdraw(prefix netip.Prefix, peer string) {
 	t.mu.Lock()
 	defer t.mu.Unlock()
 	number, known := t.peerNumbers[peer]
 	if !known || !prefix.IsValid() {
 		return
 	}
 	prefix = prefix.Masked()
 	o := originWithPeer(t.origins(prefix), number)
 	if o != nil {
 		t.leave(prefix, o, number)
 	}
 }
 // PeerDown applies a peer's session going down: the peer leaves every peer
 // set, and every route of it is dropped. When the peer carries any prefix, it
 // visits every prefix in the table.
 func (t *Table) PeerDown(peer string) {
 	t.mu.Lock()
 	defer t.mu.Unlock()
 	number, known := t.peerNumbers[peer]
 	if !known || t.peerPrefixes[number] == 0 {
 		return
 	}
 	for _, f := range []*family{&t.ipv4, &t.ipv6} {
 		for _, prefixes := range f.byLength {
 			for prefix, origins := range prefixes {
 				o := originWithPeer(origins, number)
 				if o != nil {
 					t.leave(prefix, o, number)
 				}
 			}
 		}
 	}
 }
 // Load puts one prefix and origin AS pair that the database holds into the
 // table, as startup does with each row it reads. The change's peers join the
 // pair's peer set, and its routes are kept as an announcement's would be.
 // Unlike an update, Load records no change, so TakeChanges does not hand the
 // pair back to be written again. Loading a pair twice changes nothing.
 //
 // The caller makes sure that every peer change names, in its peer set or in
 // its routes, has a number in Params.PeerNumbers.
 func (t *Table) Load(change Change) {
 	t.mu.Lock()
 	defer t.mu.Unlock()
 	// A removed pair has no peers, and a pair without peers is not in the
 	// table.
 	if change.Peers == nil || change.Peers.None() || !change.Prefix.IsValid() {
 		return
 	}
 	prefix := change.Prefix.Masked()
 	o := t.findOrAddOrigin(prefix, change.OriginASN)
 	wasWithoutKeptRoute := o.withoutKeptRoute()
 	// The peers not yet in the peer set join it in one union, which takes
 	// less time than setting their bits one at a time.
 	joining := change.Peers.Difference(&o.peers)
 	o.peers.InPlaceUnion(joining)
 	t.familyOf(prefix.Addr()).routes += int(joining.Count())
 	for peer := range joining.EachSet() {
 		t.peerPrefixes[peer]++
 	}
 	// Oldest first, as they were announced, so that two routes with the same
 	// time are kept in the order they had.
 	for _, r := range slices.Backward(change.Routes) {
 		peer := t.peerNumbers[r.Peer]
 		t.dropKeptRoute(o, peer)
 		t.keepIfNewest(o, route{
 			peer: peer,
 			path: slices.Clone(r.ASPath),
 			time: r.Time,
 		})
 	}
 	t.countOriginWithoutKeptRoute(o, wasWithoutKeptRoute)
 }
 // TakeChanges returns at most maxChanges of the prefix and origin AS pairs that
 // changed since they were last taken, in prefix order, each with its current
 // content. The other changed pairs wait for a later call. It also returns every
 // peer numbered since it last ran, by address, so a pair taken later names only
 // peers already returned. It then forgets what it returned.
 func (t *Table) TakeChanges(maxChanges int) ([]Change, map[string]uint) {
 	t.mu.Lock()
 	defer t.mu.Unlock()
 	changes := make([]Change, 0, min(maxChanges, len(t.changed)))
 	for key := range t.changed {
 		if len(changes) == maxChanges {
 			break
 		}
 		changes = append(changes, t.currentContent(key))
 		delete(t.changed, key)
 	}
 	// A map keeps the memory of its largest size, so an emptied one is
 	// replaced.
 	if len(t.changed) == 0 {
 		t.changed = make(map[pair]struct{})
 	}
 	slices.SortFunc(changes, func(a, b Change) int {
 		return cmp.Or(a.Prefix.Compare(b.Prefix),
 			cmp.Compare(a.OriginASN, b.OriginASN))
 	})
 	newPeers := t.newPeers
 	t.newPeers = make(map[string]uint)
 	return changes, newPeers
 }
 // PutBackChanges records again what one TakeChanges call returned, for a
 // caller that could not write it. The next TakeChanges returns those peers
 // again, and those pairs wait to be taken again like any changed pair. Each is
 // then taken with its content at that time, so a later change of a pair
 // replaces the earlier.
 func (t *Table) PutBackChanges(changes []Change, newPeers map[string]uint) {
 	t.mu.Lock()
 	defer t.mu.Unlock()
 	for _, change := range changes {
 		t.changed[pair{prefix: change.Prefix, asn: change.OriginASN}] = struct{}{}
 	}
 	maps.Copy(t.newPeers, newPeers)
 }
 // ChangeCount returns how many changed prefix and origin AS pairs wait for
 // TakeChanges.
 func (t *Table) ChangeCount() int {
 	t.mu.RLock()
 	defer t.mu.RUnlock()
 	return len(t.changed)
 }
 // numberPeer returns the peer's number, and gives it the next one the first
 // time the table sees it.
 func (t *Table) numberPeer(address string) uint {
 	number, known := t.peerNumbers[address]
 	if known {
 		return number
 	}
 	number = t.nextPeerNumber
 	t.nextPeerNumber++
 	t.peerNumbers[address] = number
 	t.peerAddresses[number] = address
 	t.peerPrefixes = append(t.peerPrefixes, 0)
 	t.newPeers[address] = number
 	return number
 }
 // familyOf returns the part of the table for addr's IP version.
 func (t *Table) familyOf(addr netip.Addr) *family {
 	if addr.Is4() {
 		return &t.ipv4
 	}
 	return &t.ipv6
 }
 // prefixesOfLength returns the prefixes of the IP version and the mask length
 // of prefix, a valid masked prefix.
 func (t *Table) prefixesOfLength(prefix netip.Prefix) map[netip.Prefix][]*origin {
 	return t.familyOf(prefix.Addr()).byLength[prefix.Bits()]
 }
 // origins returns the origins of prefix, a valid masked prefix.
 func (t *Table) origins(prefix netip.Prefix) []*origin {
 	return t.prefixesOfLength(prefix)[prefix]
 }
 // findOrAddOrigin returns the origin of prefix with AS asn, added with no
 // peers when the prefix has none with that AS.
 func (t *Table) findOrAddOrigin(prefix netip.Prefix, asn int) *origin {
 	prefixes := t.prefixesOfLength(prefix)
 	origins := prefixes[prefix]
 	i, found := slices.BinarySearchFunc(origins, asn,
 		func(o *origin, asn int) int { return cmp.Compare(o.asn, asn) })
 	if found {
 		return origins[i]
 	}
 	o := &origin{asn: asn}
 	prefixes[prefix] = slices.Insert(origins, i, o)
 	if t.byOrigin[asn] == nil {
 		t.byOrigin[asn] = make(map[netip.Prefix]*origin)
 	}
 	t.byOrigin[asn][prefix] = o
 	return o
 }
 // removeOrigin removes o, which no peer carries any more, from prefix, and the
 // prefix from the table when it has no origin left.
 func (t *Table) removeOrigin(prefix netip.Prefix, o *origin) {
 	prefixes := t.prefixesOfLength(prefix)
 	origins := slices.DeleteFunc(prefixes[prefix],
 		func(other *origin) bool { return other == o })
 	if len(origins) == 0 {
 		delete(prefixes, prefix)
 	} else {
 		prefixes[prefix] = origins
 	}
 	delete(t.byOrigin[o.asn], prefix)
 	if len(t.byOrigin[o.asn]) == 0 {
 		delete(t.byOrigin, o.asn)
 	}
 }
 // join puts the peer of r in the peer set of o, an origin of prefix, and keeps
 // r in full when it is one of the two newest routes of o. The peer's earlier
 // route, if o keeps one, is replaced: it is no longer the peer's current route.
 // The pair is recorded as changed only when its peer set or kept routes change.
 func (t *Table) join(prefix netip.Prefix, o *origin, r route) {
 	if slices.ContainsFunc(o.routes, r.equal) {
 		// The peer announced its kept route again.
 		return
 	}
 	wasWithoutKeptRoute := o.withoutKeptRoute()
 	joined := !o.peers.Test(r.peer)
 	if joined {
 		o.peers.Set(r.peer)
 		t.familyOf(prefix.Addr()).routes++
 		t.peerPrefixes[r.peer]++
 	}
 	dropped := t.dropKeptRoute(o, r.peer)
 	kept := t.keepIfNewest(o, r)
 	if joined || dropped || kept {
 		t.recordChange(prefix, o, wasWithoutKeptRoute)
 	}
 }
 // leave takes peer out of the peer set of o, an origin of prefix, and drops
 // its kept route, if any.
 func (t *Table) leave(prefix netip.Prefix, o *origin, peer uint) {
 	wasWithoutKeptRoute := o.withoutKeptRoute()
 	o.peers.Clear(peer)
 	t.dropKeptRoute(o, peer)
 	t.familyOf(prefix.Addr()).routes--
 	t.peerPrefixes[peer]--
 	t.recordChange(prefix, o, wasWithoutKeptRoute)
 }
 // keepIfNewest keeps r in o unless both kept routes of o are newer, and says
 // whether it kept r. When o already keeps two routes, the older one is
 // dropped, and its peer keeps only its bit.
 func (t *Table) keepIfNewest(o *origin, r route) bool {
 	// The kept routes stay newest first: r goes before the first one that is
 	// not newer than it.
 	i := 0
 	for i < len(o.routes) && o.routes[i].time.After(r.time) {
 		i++
 	}
 	if i == keptRoutesPerOrigin {
 		return false
 	}
 	if len(o.routes) == keptRoutesPerOrigin {
 		t.dropKeptRoute(o, o.routes[keptRoutesPerOrigin-1].peer)
 	}
 	o.routes = slices.Insert(o.routes, i, r)
 	t.countKeptTime(r.time, 1)
 	return true
 }
 // dropKeptRoute drops the peer's route from the kept routes of o, if o keeps
 // one, and says whether it did.
 func (t *Table) dropKeptRoute(o *origin, peer uint) bool {
 	i := slices.IndexFunc(o.routes, func(r route) bool { return r.peer == peer })
 	if i < 0 {
 		return false
 	}
 	t.countKeptTime(o.routes[i].time, -1)
 	o.routes = slices.Delete(o.routes, i, i+1)
 	return true
 }
 // recordChange records that the pair of prefix and the AS of o changed, and
 // brings the count of origins without a kept route up to date.
 // wasWithoutKeptRoute says whether o was such an origin before the change. An
 // origin that no peer carries any more is removed.
 func (t *Table) recordChange(
 	prefix netip.Prefix, o *origin, wasWithoutKeptRoute bool,
 ) {
 	t.changed[pair{prefix: prefix, asn: o.asn}] = struct{}{}
 	t.countOriginWithoutKeptRoute(o, wasWithoutKeptRoute)
 	if o.peers.None() {
 		t.removeOrigin(prefix, o)
 	}
 }
 // countOriginWithoutKeptRoute brings the count of origins without a kept route
 // up to date after a change to o. wasWithoutKeptRoute says whether o was such
 // an origin before the change.
 func (t *Table) countOriginWithoutKeptRoute(o *origin, wasWithoutKeptRoute bool) {
 	if wasWithoutKeptRoute {
 		t.originsWithoutKeptRoute--
 	}
 	if o.withoutKeptRoute() {
 		t.originsWithoutKeptRoute++
 	}
 }
 // countKeptTime adds delta to the number of kept routes with time at.
 func (t *Table) countKeptTime(at time.Time, delta int) {
 	count, _ := t.keptTimes.Get(keptTime{time: at})
 	count.time = at
 	count.routes += delta
 	if count.routes == 0 {
 		t.keptTimes.Delete(count)
 		return
 	}
 	t.keptTimes.ReplaceOrInsert(count)
 }
 // currentContent returns what the table holds for the pair now.
 func (t *Table) currentContent(key pair) Change {
 	o := t.byOrigin[key.asn][key.prefix]
 	if o == nil {
 		return Change{Prefix: key.prefix, OriginASN: key.asn, Removed: true}
 	}
 	return Change{
 		Prefix:    key.prefix,
 		OriginASN: key.asn,
 		Peers:     o.peers.Clone(),
 		Routes:    t.exportRoutes(o.routes),
 	}
 }
 // exportRoutes returns copies of routes that name each peer by its address, or
 // nil when there are none.
 func (t *Table) exportRoutes(routes []route) []Route {
 	if len(routes) == 0 {
 		return nil
 	}
 	exported := make([]Route, 0, len(routes))
 	for _, r := range routes {
 		exported = append(exported, Route{
 			Peer:   t.peerAddresses[r.peer],
 			ASPath: slices.Clone(r.path),
 			Time:   r.time,
 		})
 	}
 	return exported
 }
 // family is the part of the table for one IP version.
 type family struct {
 	// byLength[n] holds the prefixes of mask length n that some peer carries,
 	// each with its origins in AS number order.
 	byLength []map[netip.Prefix][]*origin
 	// minLookupLength is the shortest mask length the address lookup uses.
 	minLookupLength int
 	// routes counts the peer and prefix pairs: each peer that carries a
 	// prefix counts once for it.
 	routes int
 }
 // newFamily returns an empty family for addresses of bits bits.
 func newFamily(bits, minLookupLength int) family {
 	f := family{
 		byLength:        make([]map[netip.Prefix][]*origin, bits+1),
 		minLookupLength: minLookupLength,
 	}
 	for n := range f.byLength {
 		f.byLength[n] = make(map[netip.Prefix][]*origin)
 	}
 	return f
 }
 // prefixesByLength returns how many prefixes of each mask length f holds.
 func (f *family) prefixesByLength() []int {
 	counts := make([]int, len(f.byLength))
 	for n, prefixes := range f.byLength {
 		counts[n] = len(prefixes)
 	}
 	return counts
 }
 // origin is what the table holds for one prefix and origin AS.
 type origin struct {
 	asn int
 	// peers holds the number of each peer whose current route to the prefix
 	// has this origin AS.
 	peers bitset.BitSet
 	// routes are the newest of those routes, newest first, at most
 	// keptRoutesPerOrigin.
 	routes []route
 }
 // withoutKeptRoute says whether peers carry o but o keeps no route.
 func (o *origin) withoutKeptRoute() bool {
 	return o.peers.Any() && len(o.routes) == 0
 }
 // newestTime returns the time of the newest kept route of o, or nil when o
 // keeps none.
 func (o *origin) newestTime() *time.Time {
 	if len(o.routes) == 0 {
 		return nil
 	}
 	newest := o.routes[0].time
 	return &newest
 }
 // originWithPeer returns the origin whose peer set holds peer, or nil when
 // none does. A peer carries a prefix with one origin AS at most.
 func originWithPeer(origins []*origin, peer uint) *origin {
 	for _, o := range origins {
 		if o.peers.Test(peer) {
 			return o
 		}
 	}
 	return nil
 }
 // route is a kept route. peer is the peer's number.
 type route struct {
 	peer uint
 	path []int
 	time time.Time
 }
 // equal says whether r and other are the same peer's route with the same path
 // and time.
 func (r route) equal(other route) bool {
 	return r.peer == other.peer && r.time.Equal(other.time) &&
 		slices.Equal(r.path, other.path)
 }
 // pair names one prefix and origin AS.
 type pair struct {
 	prefix netip.Prefix
 	asn    int
 }
 // keptTime counts the kept routes with one time.
 type keptTime struct {
 	time   time.Time
 	routes int
 }
@@ -1,667 +0,0 @@
 package routetable_test
 import (
 	"math"
 	"net/netip"
 	"reflect"
 	"slices"
 	"sync"
 	"testing"
 	"time"
 	"github.com/bits-and-blooms/bitset"
 	"git.eeqj.de/sneak/routewatch/internal/routetable"
 )
 const (
 	peerA = "192.0.2.1"
 	peerB = "192.0.2.2"
 	peerC = "2001:db8::3"
 	peerD = "2001:db8::4"
 	asA = 64500
 	asB = 64501
 	asC = 64502
 	// transitAS is the first AS of every test path, the peer's own.
 	transitAS = 64496
 	prefixV4 = "10.1.2.0/24"
 	prefixV6 = "2001:db8:1::/48"
 )
 // at returns the time second seconds after the start of every test.
 func at(second int) time.Time {
 	return time.Date(2026, 1, 2, 3, 4, 5, 0, time.UTC).
 		Add(time.Duration(second) * time.Second)
 }
 // timeAt returns at(second) for a field that may be nil.
 func timeAt(second int) *time.Time {
 	t := at(second)
 	return &t
 }
 // routeOf returns the route peer announces with origin AS asn second seconds
 // after the start.
 func routeOf(peer string, asn, second int) routetable.Route {
 	return routetable.Route{
 		Peer: peer, ASPath: []int{transitAS, asn}, Time: at(second),
 	}
 }
 // step is one update a test applies to a table for one prefix.
 type step func(table *routetable.Table, prefix netip.Prefix)
 // announce is the step of peer announcing prefix with origin AS asn second
 // seconds after the start.
 func announce(peer string, asn, second int) step {
 	return func(table *routetable.Table, prefix netip.Prefix) {
 		table.Announce(prefix, asn, routeOf(peer, asn, second))
 	}
 }
 // withdraw is the step of peer withdrawing prefix.
 func withdraw(peer string) step {
 	return func(table *routetable.Table, prefix netip.Prefix) {
 		table.Withdraw(prefix, peer)
 	}
 }
 // peerDown is the step of peer's session going down.
 func peerDown(peer string) step {
 	return func(table *routetable.Table, _ netip.Prefix) {
 		table.PeerDown(peer)
 	}
 }
 // rule is one case of the rule that decides what the table holds for a prefix:
 // the steps applied to an empty table, and the prefix's origins after them.
 // The peers are numbered in the order they first announce, which is the order
 // Origin.Peers lists them in.
 type rule struct {
 	name  string
 	steps []step
 	want  []routetable.Origin
 }
 // checkRules runs each case for an IPv4 and an IPv6 prefix.
 func checkRules(t *testing.T, rules []rule) {
 	t.Helper()
 	for _, tc := range rules {
 		for _, text := range []string{prefixV4, prefixV6} {
 			t.Run(tc.name+" "+text, func(t *testing.T) {
 				t.Parallel()
 				prefix := netip.MustParsePrefix(text)
 				table := routetable.New(routetable.Params{})
 				for _, apply := range tc.steps {
 					apply(table, prefix)
 				}
 				got := table.Origins(prefix)
 				if !reflect.DeepEqual(got, tc.want) {
 					t.Errorf("Origins(%s) = %+v, want %+v", prefix, got, tc.want)
 				}
 			})
 		}
 	}
 }
 func TestAnnouncementsKeepTheTwoNewestRoutes(t *testing.T) {
 	t.Parallel()
 	checkRules(t, []rule{
 		{
 			name:  "an announcement is kept",
 			steps: []step{announce(peerA, asA, 10)},
 			want: []routetable.Origin{{ASN: asA, Peers: []string{peerA},
 				Routes: []routetable.Route{routeOf(peerA, asA, 10)}}},
 		},
 		{
 			name: "a lagging peer's older route is not kept",
 			steps: []step{announce(peerA, asA, 20), announce(peerB, asA, 30),
 				announce(peerC, asA, 10)},
 			want: []routetable.Origin{{ASN: asA,
 				Peers: []string{peerA, peerB, peerC}, Routes: []routetable.Route{
 					routeOf(peerB, asA, 30), routeOf(peerA, asA, 20),
 				}}},
 		},
 		{
 			name: "a third newer route drops the older kept one, whose peer " +
 				"keeps its bit",
 			steps: []step{announce(peerA, asA, 10), announce(peerB, asA, 20),
 				announce(peerC, asA, 30)},
 			want: []routetable.Origin{{ASN: asA,
 				Peers: []string{peerA, peerB, peerC}, Routes: []routetable.Route{
 					routeOf(peerC, asA, 30), routeOf(peerB, asA, 20),
 				}}},
 		},
 		{
 			name: "a route as old as the older kept one replaces it",
 			steps: []step{announce(peerA, asA, 10), announce(peerB, asA, 20),
 				announce(peerC, asA, 10)},
 			want: []routetable.Origin{{ASN: asA,
 				Peers: []string{peerA, peerB, peerC}, Routes: []routetable.Route{
 					routeOf(peerB, asA, 20), routeOf(peerC, asA, 10),
 				}}},
 		},
 		{
 			name: "a peer's new route replaces its kept one",
 			steps: []step{announce(peerA, asA, 10), announce(peerB, asA, 20),
 				announce(peerA, asA, 30)},
 			want: []routetable.Origin{{ASN: asA, Peers: []string{peerA, peerB},
 				Routes: []routetable.Route{
 					routeOf(peerA, asA, 30), routeOf(peerB, asA, 20),
 				}}},
 		},
 		{
 			name: "a peer's new route replaces its kept one even when older",
 			steps: []step{announce(peerA, asA, 10), announce(peerB, asA, 20),
 				announce(peerB, asA, 5)},
 			want: []routetable.Origin{{ASN: asA, Peers: []string{peerA, peerB},
 				Routes: []routetable.Route{
 					routeOf(peerA, asA, 10), routeOf(peerB, asA, 5),
 				}}},
 		},
 	})
 }
 func TestAPeerCarriesAPrefixWithOneOrigin(t *testing.T) {
 	t.Parallel()
 	checkRules(t, []rule{
 		{
 			name: "a peer moving to a new origin leaves the old one",
 			steps: []step{announce(peerA, asA, 10), announce(peerB, asA, 20),
 				announce(peerA, asB, 30)},
 			want: []routetable.Origin{
 				{ASN: asA, Peers: []string{peerB},
 					Routes: []routetable.Route{routeOf(peerB, asA, 20)}},
 				{ASN: asB, Peers: []string{peerA},
 					Routes: []routetable.Route{routeOf(peerA, asB, 30)}},
 			},
 		},
 		{
 			name: "a peer whose route is not kept moves to a new origin",
 			steps: []step{announce(peerA, asA, 10), announce(peerB, asA, 20),
 				announce(peerC, asA, 30), announce(peerA, asB, 40)},
 			want: []routetable.Origin{
 				{ASN: asA, Peers: []string{peerB, peerC},
 					Routes: []routetable.Route{
 						routeOf(peerC, asA, 30), routeOf(peerB, asA, 20),
 					}},
 				{ASN: asB, Peers: []string{peerA},
 					Routes: []routetable.Route{routeOf(peerA, asB, 40)}},
 			},
 		},
 		{
 			name: "origins are listed in AS number order",
 			steps: []step{announce(peerA, asC, 10), announce(peerB, asA, 20),
 				announce(peerC, asB, 30)},
 			want: []routetable.Origin{
 				{ASN: asA, Peers: []string{peerB},
 					Routes: []routetable.Route{routeOf(peerB, asA, 20)}},
 				{ASN: asB, Peers: []string{peerC},
 					Routes: []routetable.Route{routeOf(peerC, asB, 30)}},
 				{ASN: asC, Peers: []string{peerA},
 					Routes: []routetable.Route{routeOf(peerA, asC, 10)}},
 			},
 		},
 	})
 }
 func TestWithdrawalsAndPeerDowns(t *testing.T) {
 	t.Parallel()
 	// threePeers is peerA, peerB and peerC announcing in turn; the routes of
 	// peerC and peerB are kept.
 	threePeers := []step{announce(peerA, asA, 10), announce(peerB, asA, 20),
 		announce(peerC, asA, 30)}
 	checkRules(t, []rule{
 		{
 			name:  "a withdrawal drops the peer's kept route",
 			steps: append(slices.Clone(threePeers), withdraw(peerC)),
 			want: []routetable.Origin{{ASN: asA, Peers: []string{peerA, peerB},
 				Routes: []routetable.Route{routeOf(peerB, asA, 20)}}},
 		},
 		{
 			name:  "a withdrawal of a route that is not kept leaves the kept ones",
 			steps: append(slices.Clone(threePeers), withdraw(peerA)),
 			want: []routetable.Origin{{ASN: asA, Peers: []string{peerB, peerC},
 				Routes: []routetable.Route{
 					routeOf(peerC, asA, 30), routeOf(peerB, asA, 20),
 				}}},
 		},
 		{
 			name: "an origin whose kept routes are withdrawn keeps its other " +
 				"peers",
 			steps: append(slices.Clone(threePeers), withdraw(peerB),
 				withdraw(peerC)),
 			want: []routetable.Origin{{ASN: asA, Peers: []string{peerA}}},
 		},
 		{
 			name: "an origin without kept routes keeps the next update",
 			steps: append(slices.Clone(threePeers), withdraw(peerB),
 				withdraw(peerC), announce(peerA, asA, 5)),
 			want: []routetable.Origin{{ASN: asA, Peers: []string{peerA},
 				Routes: []routetable.Route{routeOf(peerA, asA, 5)}}},
 		},
 		{
 			name: "an origin no peer carries is removed",
 			steps: []step{announce(peerA, asA, 10), announce(peerB, asB, 20),
 				withdraw(peerA)},
 			want: []routetable.Origin{{ASN: asB, Peers: []string{peerB},
 				Routes: []routetable.Route{routeOf(peerB, asB, 20)}}},
 		},
 		{
 			name:  "a prefix no peer carries is removed",
 			steps: []step{announce(peerA, asA, 10), withdraw(peerA)},
 			want:  nil,
 		},
 		{
 			name:  "a withdrawal from a peer that does not carry it changes nothing",
 			steps: []step{announce(peerA, asA, 10), withdraw(peerB)},
 			want: []routetable.Origin{{ASN: asA, Peers: []string{peerA},
 				Routes: []routetable.Route{routeOf(peerA, asA, 10)}}},
 		},
 		{
 			name: "a peer going down leaves the prefix",
 			steps: []step{announce(peerA, asA, 10), announce(peerB, asA, 20),
 				peerDown(peerB)},
 			want: []routetable.Origin{{ASN: asA, Peers: []string{peerA},
 				Routes: []routetable.Route{routeOf(peerA, asA, 10)}}},
 		},
 		{
 			name: "a peer going down after it withdrew changes nothing",
 			steps: []step{announce(peerA, asA, 10), announce(peerB, asA, 20),
 				withdraw(peerB), peerDown(peerB)},
 			want: []routetable.Origin{{ASN: asA, Peers: []string{peerA},
 				Routes: []routetable.Route{routeOf(peerA, asA, 10)}}},
 		},
 	})
 }
 func TestPeerDownLeavesEveryPrefix(t *testing.T) {
 	t.Parallel()
 	table := routetable.New(routetable.Params{})
 	prefixes := []netip.Prefix{
 		netip.MustParsePrefix(prefixV4),
 		netip.MustParsePrefix("10.2.0.0/16"),
 		netip.MustParsePrefix(prefixV6),
 	}
 	// peerA carries every prefix with origin asA, peerB the first one with
 	// origin asB.
 	for _, prefix := range prefixes {
 		table.Announce(prefix, asA, routeOf(peerA, asA, 10))
 	}
 	table.Announce(prefixes[0], asB, routeOf(peerB, asB, 20))
 	table.PeerDown(peerA)
 	want := []routetable.Origin{{ASN: asB, Peers: []string{peerB},
 		Routes: []routetable.Route{routeOf(peerB, asB, 20)}}}
 	got := table.Origins(prefixes[0])
 	if !reflect.DeepEqual(got, want) {
 		t.Errorf("Origins(%s) = %+v, want %+v", prefixes[0], got, want)
 	}
 	for _, prefix := range prefixes[1:] {
 		got := table.Origins(prefix)
 		if got != nil {
 			t.Errorf("Origins(%s) = %+v after the only peer went down, want nil",
 				prefix, got)
 		}
 	}
 	counts := table.Counts()
 	if counts.IPv4Prefixes != 1 || counts.IPv6Prefixes != 0 ||
 		counts.IPv4Routes != 1 || counts.IPv6Routes != 0 {
 		t.Errorf("Counts() = %+v, want one IPv4 prefix and route", counts)
 	}
 	if len(table.OriginatedPrefixes(asA)) != 0 {
 		t.Errorf("OriginatedPrefixes(%d) = %+v, want none",
 			asA, table.OriginatedPrefixes(asA))
 	}
 }
 func TestCountsOriginsWithoutKeptRoute(t *testing.T) {
 	t.Parallel()
 	prefix := netip.MustParsePrefix(prefixV4)
 	table := routetable.New(routetable.Params{})
 	steps := []struct {
 		apply step
 		want  int
 	}{
 		{announce(peerA, asA, 10), 0},
 		{announce(peerB, asA, 20), 0},
 		{announce(peerC, asA, 30), 0},
 		{withdraw(peerC), 0},
 		{withdraw(peerB), 1},
 		// An update from the last peer is kept.
 		{announce(peerA, asA, 40), 0},
 		{withdraw(peerA), 0},
 		// Once more without kept routes, then without peers: the origin
 		// is removed.
 		{announce(peerA, asA, 10), 0},
 		{announce(peerB, asA, 20), 0},
 		{announce(peerC, asA, 30), 0},
 		{withdraw(peerB), 0},
 		{withdraw(peerC), 1},
 		{peerDown(peerA), 0},
 	}
 	for i, s := range steps {
 		s.apply(table, prefix)
 		got := table.Counts().OriginsWithoutKeptRoute
 		if got != s.want {
 			t.Errorf("after step %d, OriginsWithoutKeptRoute = %d, want %d",
 				i, got, s.want)
 		}
 	}
 }
 // change is a routetable.Change with its peer set as a list of peer numbers.
 type change struct {
 	Prefix    string
 	OriginASN int
 	Removed   bool
 	Peers     []uint
 	Routes    []routetable.Route
 }
 // peerNumbers returns the numbers in set, or nil for a nil set.
 func peerNumbers(set *bitset.BitSet) []uint {
 	if set == nil {
 		return nil
 	}
 	return slices.Collect(set.EachSet())
 }
 func TestTakeChanges(t *testing.T) {
 	t.Parallel()
 	// peerA was numbered 5 before; the next new peer is 6.
 	table := routetable.New(routetable.Params{
 		PeerNumbers: map[string]uint{peerA: 5},
 	})
 	v4 := netip.MustParsePrefix(prefixV4)
 	v6 := netip.MustParsePrefix(prefixV6)
 	table.Announce(v6, asA, routeOf(peerA, asA, 10))
 	table.Announce(v4, asA, routeOf(peerA, asA, 10))
 	table.Announce(v4, asA, routeOf(peerB, asA, 20))
 	checkChanges(t, table, []change{
 		{Prefix: prefixV4, OriginASN: asA, Peers: []uint{5, 6},
 			Routes: []routetable.Route{
 				routeOf(peerB, asA, 20), routeOf(peerA, asA, 10),
 			}},
 		{Prefix: prefixV6, OriginASN: asA, Peers: []uint{5},
 			Routes: []routetable.Route{routeOf(peerA, asA, 10)}},
 	}, map[string]uint{peerB: 6})
 	// TakeChanges cleared the record.
 	checkChanges(t, table, []change{}, map[string]uint{})
 	// peerB moves to asB; peerA withdraws, which removes the pair of v4 and
 	// asA.
 	table.Announce(v4, asB, routeOf(peerB, asB, 30))
 	table.Withdraw(v4, peerA)
 	checkChanges(t, table, []change{
 		{Prefix: prefixV4, OriginASN: asA, Removed: true},
 		{Prefix: prefixV4, OriginASN: asB, Peers: []uint{6},
 			Routes: []routetable.Route{routeOf(peerB, asB, 30)}},
 	}, map[string]uint{})
 }
 func TestTakeChangesHoldsOnlyPairsThatChanged(t *testing.T) {
 	t.Parallel()
 	table := routetable.New(routetable.Params{})
 	v4 := netip.MustParsePrefix(prefixV4)
 	v6 := netip.MustParsePrefix(prefixV6)
 	// peerA, peerB and peerC are numbered 0, 1 and 2. The routes of peerC and
 	// peerB to v4 are kept; peerA keeps only its bit.
 	announceAll(table, prefixV4, asA, 10, peerA, peerB, peerC)
 	table.Announce(v6, asA, routeOf(peerB, asA, 10))
 	table.TakeChanges(math.MaxInt)
 	// peerA announces again, with a time older than both kept routes.
 	table.Announce(v4, asA, routeOf(peerA, asA, 15))
 	checkChanges(t, table, []change{}, map[string]uint{})
 	// peerC announces its kept route again.
 	table.Announce(v4, asA, routeOf(peerC, asA, 30))
 	checkChanges(t, table, []change{}, map[string]uint{})
 	// peerC announces the same path with a newer time, so its kept route
 	// changes.
 	table.Announce(v4, asA, routeOf(peerC, asA, 40))
 	checkChanges(t, table, []change{
 		{Prefix: prefixV4, OriginASN: asA, Peers: []uint{0, 1, 2},
 			Routes: []routetable.Route{
 				routeOf(peerC, asA, 40), routeOf(peerB, asA, 20),
 			}},
 	}, map[string]uint{})
 	// peerA withdraws v6, which it does not carry.
 	table.Withdraw(v6, peerA)
 	checkChanges(t, table, []change{}, map[string]uint{})
 	// peerA going down changes v4, the one prefix it carries.
 	table.PeerDown(peerA)
 	checkChanges(t, table, []change{
 		{Prefix: prefixV4, OriginASN: asA, Peers: []uint{1, 2},
 			Routes: []routetable.Route{
 				routeOf(peerC, asA, 40), routeOf(peerB, asA, 20),
 			}},
 	}, map[string]uint{})
 	// peerA, which carries nothing now, goes down again.
 	table.PeerDown(peerA)
 	checkChanges(t, table, []change{}, map[string]uint{})
 }
 // TestTakeChangesTakesAtMostMaxChanges changes three prefix and origin AS
 // pairs, then takes the changes two at a time. The first call must return two
 // pairs and both new peers, and the second the third pair and no peer.
 func TestTakeChangesTakesAtMostMaxChanges(t *testing.T) {
 	t.Parallel()
 	const maxChanges = 2
 	table := routetable.New(routetable.Params{})
 	v4 := netip.MustParsePrefix(prefixV4)
 	v6 := netip.MustParsePrefix(prefixV6)
 	table.Announce(v4, asA, routeOf(peerA, asA, 10))
 	table.Announce(v4, asB, routeOf(peerB, asB, 10))
 	table.Announce(v6, asA, routeOf(peerA, asA, 10))
 	first, firstPeers := table.TakeChanges(maxChanges)
 	second, secondPeers := table.TakeChanges(maxChanges)
 	if len(first) != maxChanges || len(second) != 1 {
 		t.Fatalf("TakeChanges(%d) returned %d and then %d pairs, want %d and 1",
 			maxChanges, len(first), len(second), maxChanges)
 	}
 	wantPeers := map[string]uint{peerA: 0, peerB: 1}
 	if !reflect.DeepEqual(firstPeers, wantPeers) || len(secondPeers) != 0 {
 		t.Errorf("TakeChanges(%d) returned the new peers %v and then %v, "+
 			"want %v and none", maxChanges, firstPeers, secondPeers, wantPeers)
 	}
 	for _, c := range first {
 		if c.Prefix == second[0].Prefix && c.OriginASN == second[0].OriginASN {
 			t.Errorf("both calls returned %s with AS%d", c.Prefix, c.OriginASN)
 		}
 	}
 }
 // TestPutBackChanges takes a table's changes and puts them back, as a caller
 // does whose write failed. The next TakeChanges must return them again, with
 // each pair's content then, and with the changes since.
 func TestPutBackChanges(t *testing.T) {
 	t.Parallel()
 	table := routetable.New(routetable.Params{})
 	v4 := netip.MustParsePrefix(prefixV4)
 	v6 := netip.MustParsePrefix(prefixV6)
 	table.Announce(v4, asA, routeOf(peerA, asA, 10))
 	table.Announce(v6, asA, routeOf(peerA, asA, 10))
 	table.PutBackChanges(table.TakeChanges(math.MaxInt))
 	if got := table.ChangeCount(); got != 2 {
 		t.Errorf("ChangeCount() = %d after the changes were put back, want 2",
 			got)
 	}
 	// peerA withdraws v4, so v4's earlier content must not come back; peerB
 	// announces v6, and is a new peer as well.
 	table.Withdraw(v4, peerA)
 	table.Announce(v6, asA, routeOf(peerB, asA, 20))
 	checkChanges(t, table, []change{
 		{Prefix: prefixV4, OriginASN: asA, Removed: true},
 		{Prefix: prefixV6, OriginASN: asA, Peers: []uint{0, 1},
 			Routes: []routetable.Route{
 				routeOf(peerB, asA, 20), routeOf(peerA, asA, 10),
 			}},
 	}, map[string]uint{peerA: 0, peerB: 1})
 	if got := table.ChangeCount(); got != 0 {
 		t.Errorf("ChangeCount() = %d after TakeChanges, want 0", got)
 	}
 }
 func TestLoad(t *testing.T) {
 	t.Parallel()
 	const otherV4 = "10.9.0.0/16"
 	v4 := netip.MustParsePrefix(prefixV4)
 	v6 := netip.MustParsePrefix(prefixV6)
 	other := netip.MustParsePrefix(otherV4)
 	// The routes of peerC and peerB to v4 are kept; peerA keeps only its bit.
 	// The two routes to v6 have the same time. The routes of other were
 	// withdrawn while peerA still carries it.
 	source := routetable.New(routetable.Params{})
 	announceAll(source, prefixV4, asA, 10, peerA, peerB, peerC)
 	announceAll(source, prefixV4, asB, 40, peerD)
 	source.Announce(v6, asA, routeOf(peerA, asA, 50))
 	source.Announce(v6, asA, routeOf(peerC, asA, 50))
 	announceAll(source, otherV4, asB, 10, peerA, peerB, peerC)
 	source.Withdraw(other, peerB)
 	source.Withdraw(other, peerC)
 	changes, peers := source.TakeChanges(math.MaxInt)
 	loaded := routetable.New(routetable.Params{PeerNumbers: peers})
 	// Loading a pair twice changes nothing.
 	for range 2 {
 		for _, change := range changes {
 			loaded.Load(change)
 		}
 	}
 	for _, prefix := range []netip.Prefix{v4, v6, other} {
 		got, want := loaded.Origins(prefix), source.Origins(prefix)
 		if !reflect.DeepEqual(got, want) {
 			t.Errorf("Origins(%s) = %+v after the load, want %+v", prefix, got, want)
 		}
 	}
 	if !reflect.DeepEqual(loaded.Counts(), source.Counts()) {
 		t.Errorf("Counts() = %+v after the load, want %+v",
 			loaded.Counts(), source.Counts())
 	}
 	checkChanges(t, loaded, []change{}, map[string]uint{})
 }
 // TestConcurrentUse has goroutines update one table while others read it. The
 // race detector, which make test runs, fails it when a method uses the table
 // without its lock.
 func TestConcurrentUse(t *testing.T) {
 	t.Parallel()
 	const (
 		// rounds is how many times each goroutine calls its method.
 		rounds     = 1000
 		ipVersion  = 4
 		sampleSize = 10
 	)
 	table := routetable.New(routetable.Params{})
 	prefix := netip.MustParsePrefix(prefixV4)
 	uses := []func(round int){
 		func(round int) { table.Announce(prefix, asA, routeOf(peerA, asA, round)) },
 		func(round int) { table.Announce(prefix, asB, routeOf(peerB, asB, round)) },
 		func(int) { table.Withdraw(prefix, peerA) },
 		func(int) { table.PeerDown(peerB) },
 		func(int) { table.PutBackChanges(table.TakeChanges(math.MaxInt)) },
 		func(int) { table.ChangeCount() },
 		func(int) { table.Lookup(prefix.Addr()) },
 		func(int) { table.Origins(prefix) },
 		func(int) { table.OriginatedPrefixes(asA) },
 		func(int) { table.SamplePrefixes(ipVersion, prefix.Bits(), sampleSize) },
 		func(int) { table.Counts() },
 	}
 	var wg sync.WaitGroup
 	for _, use := range uses {
 		wg.Go(func() {
 			for round := range rounds {
 				use(round)
 			}
 		})
 	}
 	wg.Wait()
 }
 // checkChanges checks that TakeChanges, taking every change, returns want and
 // wantPeers.
 func checkChanges(
 	t *testing.T, table *routetable.Table, want []change,
 	wantPeers map[string]uint,
 ) {
 	t.Helper()
 	changes, newPeers := table.TakeChanges(math.MaxInt)
 	got := make([]change, 0, len(changes))
 	for _, c := range changes {
 		got = append(got, change{
 			Prefix: c.Prefix.String(), OriginASN: c.OriginASN, Removed: c.Removed,
 			Peers: peerNumbers(c.Peers), Routes: c.Routes,
 		})
 	}
 	if !reflect.DeepEqual(got, want) {
 		t.Errorf("TakeChanges() changes = %+v, want %+v", got, want)
 	}
 	if !reflect.DeepEqual(newPeers, wantPeers) {
 		t.Errorf("TakeChanges() new peers = %v, want %v", newPeers, wantPeers)
 	}
 }
@@ -2,25 +2,19 @@
 // running instance of the application and contains pointers to its core
 // dependencies, and is responsible for initialization. It also contains the
 // ASN WHOIS fetcher for background updates and the database maintainer for
-// background maintenance tasks. The package also holds the handlers that
+// background maintenance tasks.
 // write the feed's updates to the database in batches, and the flush loop
 // that the AS, peer and prefix handlers share.
 package routewatch
 import (
 	"context"
 	"errors"
 	"fmt"
 	"path/filepath"
 	"sync"
 	"time"
 	"git.eeqj.de/sneak/routewatch/internal/blocklist"
 	"git.eeqj.de/sneak/routewatch/internal/config"
 	"git.eeqj.de/sneak/routewatch/internal/database"
 	"git.eeqj.de/sneak/routewatch/internal/logger"
 	"git.eeqj.de/sneak/routewatch/internal/metrics"
 	"git.eeqj.de/sneak/routewatch/internal/routetable"
 	"git.eeqj.de/sneak/routewatch/internal/server"
 	"git.eeqj.de/sneak/routewatch/internal/streamer"
@@ -31,13 +25,11 @@ import (
 // are disabled, since only the batched handlers exist.
 var errNonBatchedNotImplemented = errors.New("non-batched handlers not implemented")
-// Dependencies contains all dependencies for RouteWatch. Table is the routing
+// Dependencies contains all dependencies for RouteWatch
 // table read from the database at startup, which the server reads too.
 type Dependencies struct {
 	fx.In
 	DB       database.Store
 	Table    *routetable.Table
 	Streamer *streamer.Streamer
 	Server   *server.Server
 	Logger   *logger.Logger
@@ -47,7 +39,6 @@ type Dependencies struct {
 // RouteWatch represents the main application instance
 type RouteWatch struct {
 	db             database.Store
 	table          *routetable.Table
 	streamer       *streamer.Streamer
 	server         *server.Server
 	logger         *logger.Logger
@@ -61,18 +52,12 @@ type RouteWatch struct {
 	peeringHandler *PeeringHandler
 	asnFetcher     *ASNFetcher
 	dbMaintainer   *DBMaintainer
 	blocklists     *blocklist.Blocklists
 }
 // blocklistsDirName is the directory in the state directory that holds the
 // blocklist copies.
 const blocklistsDirName = "blocklists"
 // New creates a new RouteWatch instance
 func New(deps Dependencies) *RouteWatch {
 	rw := &RouteWatch{
 		db:         deps.DB,
 		table:      deps.Table,
 		streamer:   deps.Streamer,
 		server:     deps.Server,
 		logger:     deps.Logger,
@@ -100,7 +85,6 @@ func (rw *RouteWatch) Run(ctx context.Context) error {
 	// Register database handler to process BGP UPDATE messages
 	if rw.config.EnableBatchedDatabaseWrites {
 		rw.logger.Info("Using batched database handlers for improved performance")
 		// ASHandler maintains the asns table
 		rw.dbHandler = NewASHandler(rw.db, rw.logger)
 		rw.streamer.RegisterHandler(rw.dbHandler)
@@ -109,10 +93,8 @@ func (rw *RouteWatch) Run(ctx context.Context) error {
 		rw.peerHandler = NewPeerHandler(rw.db, rw.logger)
 		rw.streamer.RegisterHandler(rw.peerHandler)
-		// PrefixHandler keeps the routing table in memory current, and writes
+		// PrefixHandler maintains the prefixes and live_routes tables
-		// its changes to the routes table and new prefixes to the prefix
+		rw.prefixHandler = NewPrefixHandler(rw.db, rw.logger)
 		// tables
 		rw.prefixHandler = NewPrefixHandler(rw.db, rw.logger, rw.table)
 		rw.prefixHandler.SetMetricsTracker(rw.streamer.GetMetricsTracker())
 		rw.streamer.RegisterHandler(rw.prefixHandler)
@@ -126,36 +108,25 @@ func (rw *RouteWatch) Run(ctx context.Context) error {
 		return errNonBatchedNotImplemented
 	}
 	// No longer need routing table handler - PrefixHandler maintains live_routes table
 	// Start streaming
 	err := rw.streamer.Start(ctx)
 	if err != nil {
 		return err
 	}
 	// Start ASN WHOIS fetcher for background updates. The HTTP handlers read
 	// the server's fetcher without a lock, so it is set before they run.
 	rw.asnFetcher = NewASNFetcher(rw.db, rw.logger.Logger)
 	rw.asnFetcher.Start(ctx)
 	rw.server.SetASNFetcher(rw.asnFetcher)
 	// Load the blocklist copies from disk and start downloading the lists.
 	// The HTTP handlers read the server's blocklists without a lock, so they
 	// are set before the handlers run.
 	blocklists := blocklist.New(blocklist.Params{
 		Dir:    filepath.Join(rw.config.StateDir, blocklistsDirName),
 		Lists:  blocklist.Lists(),
 		Logger: rw.logger.Logger,
 	})
 	blocklists.Start(ctx)
 	rw.blocklists = blocklists
 	rw.server.SetBlocklists(blocklists)
 	// Start HTTP server
 	err = rw.server.Start(ctx)
 	if err != nil {
 		return err
 	}
 	// Start ASN WHOIS fetcher for background updates
 	rw.asnFetcher = NewASNFetcher(rw.db, rw.logger.Logger)
 	rw.asnFetcher.Start(ctx)
 	rw.server.SetASNFetcher(rw.asnFetcher)
 	// Start database maintenance goroutine
 	rw.dbMaintainer = NewDBMaintainer(rw.db, rw.logger.Logger)
 	rw.dbMaintainer.Start(ctx)
@@ -167,12 +138,11 @@ func (rw *RouteWatch) Run(ctx context.Context) error {
 }
 // Shutdown stops all services in order: the streamer, the handlers, which
-// write what they hold, the WHOIS fetcher, the database maintainer, the
+// write what they hold, the WHOIS fetcher, the database maintainer and the
-// blocklist downloads and the HTTP server, and last the database, which it
+// HTTP server, and last the database, which it checkpoints and closes. Each
-// checkpoints and closes. Each stage waits at most until ctx ends, so
+// stage waits at most until ctx ends, so Shutdown returns soon after: a
-// Shutdown returns soon after: a handler logs what it could not write by
+// handler logs what it could not write by then, and the HTTP server closes
-// then, and the HTTP server closes the connections of requests still
+// the connections of requests still running.
 // running.
 func (rw *RouteWatch) Shutdown(ctx context.Context) {
 	rw.mu.Lock()
 	if rw.shutdown {
@@ -219,10 +189,6 @@ func (rw *RouteWatch) Shutdown(ctx context.Context) {
 		rw.dbMaintainer.Stop(ctx)
 	}
 	if rw.blocklists != nil {
 		rw.blocklists.Stop(ctx)
 	}
 	err := rw.server.Stop(ctx)
 	if err != nil {
 		rw.logger.Error("Stopped the HTTP server before every request finished",
@@ -263,28 +229,6 @@ func (rw *RouteWatch) closeDatabase(ctx context.Context) {
 	}
 }
 // readRouteTable reads the routing table from the database and logs how many
 // prefix and origin AS pairs and peers it holds and how long the read took.
 // fx calls it once, to build the server and RouteWatch, before the streamer
 // connects, so the prefix handler applies the feed's updates to all of it. No
 // start timeout limits the read: fx builds them before it runs a start hook.
 func readRouteTable(
 	db database.Store, logger *logger.Logger,
 ) (*routetable.Table, error) {
 	start := time.Now()
 	table, err := db.ReadRouteTable(context.Background())
 	if err != nil {
 		return nil, fmt.Errorf("failed to read the routing table: %w", err)
 	}
 	counts := table.Counts()
 	logger.Info("Read the routing table", "pairs", counts.Pairs,
 		"peers", counts.Peers, "duration_ms", time.Since(start).Milliseconds())
 	return table, nil
 }
 // getModule provides all fx dependencies
 func getModule() []fx.Option {
 	return []fx.Option{
@@ -296,7 +240,6 @@ func getModule() []fx.Option {
 				database.New,
 				fx.As(new(database.Store)),
 			),
 			readRouteTable,
 			streamer.New,
 			server.New,
 			New,
@@ -7,7 +7,6 @@ import (
 	"net"
 	"net/http"
 	"net/http/httptest"
 	"net/netip"
 	"slices"
 	"strconv"
 	"strings"
@@ -20,7 +19,6 @@ import (
 	"git.eeqj.de/sneak/routewatch/internal/logger"
 	"git.eeqj.de/sneak/routewatch/internal/metrics"
 	"git.eeqj.de/sneak/routewatch/internal/ristypes"
 	"git.eeqj.de/sneak/routewatch/internal/routetable"
 	"git.eeqj.de/sneak/routewatch/internal/server"
 	"git.eeqj.de/sneak/routewatch/internal/streamer"
 )
@@ -33,15 +31,14 @@ type mockStore struct {
 	ASNCount        int
 	PrefixCount     int
 	PeeringCount    int
 	RouteCount      int
 	WithdrawalCount int
 	// Track unique items
 	ASNs     map[int]*database.ASN
 	Prefixes map[string]*database.Prefix
 	Peerings map[string]bool // key is "from_to"
-	// TablePrefixes holds the prefixes that the written changes of the
+	Routes   map[string]bool // key is "prefix_origin_peer"
 	// routing table leave some peer carrying.
 	TablePrefixes map[string]bool
 	// Track IP versions
 	IPv4Prefixes int
@@ -54,7 +51,7 @@ func newMockStore() *mockStore {
 		ASNs:     make(map[int]*database.ASN),
 		Prefixes: make(map[string]*database.Prefix),
 		Peerings: make(map[string]bool),
-		TablePrefixes: make(map[string]bool),
+		Routes:   make(map[string]bool),
 	}
 }
@@ -104,13 +101,6 @@ func (m *mockStore) UpdatePrefixesBatch(prefixes map[string]time.Time) error {
 				IPVersion: ipVersion,
 				FirstSeen: timestamp,
 			}
 			m.PrefixCount++
 			if ipVersion == ipVersionV4 {
 				m.IPv4Prefixes++
 			} else {
 				m.IPv6Prefixes++
 			}
 		}
 	}
@@ -162,7 +152,7 @@ func (m *mockStore) RecordAnnouncement(_ *database.Announcement) error {
 }
 // RecordPeering mock implementation
-func (m *mockStore) RecordPeering(asA, asB int, _ database.SeenTimes) error {
+func (m *mockStore) RecordPeering(asA, asB int, _ time.Time) error {
 	m.mu.Lock()
 	defer m.mu.Unlock()
@@ -211,30 +201,92 @@ func (m *mockStore) GetStatsContext(_ context.Context) (database.Stats, error) {
 	return m.GetStats()
 }
-// GetAS returns the stored AS, or only its number when none is stored.
+// UpsertLiveRoute mock implementation
-func (m *mockStore) GetAS(_ context.Context, asn int) (*database.ASN, bool, error) {
+func (m *mockStore) UpsertLiveRoute(_ *database.LiveRoute) error {
 	// Simple mock - just return nil
 	return nil
 }
 // DeleteLiveRoute mock implementation
 func (m *mockStore) DeleteLiveRoute(_, _ string) error {
 	// Simple mock - just return nil
 	return nil
 }
 // GetPrefixDistribution mock implementation
 func (m *mockStore) GetPrefixDistribution() (
 	[]database.PrefixDistribution, []database.PrefixDistribution, error,
 ) {
 	// Return empty distributions for now
 	return nil, nil, nil
 }
 // GetPrefixDistributionContext mock implementation with context support
 func (m *mockStore) GetPrefixDistributionContext(_ context.Context) (
 	[]database.PrefixDistribution, []database.PrefixDistribution, error,
 ) {
 	return m.GetPrefixDistribution()
 }
 // GetLiveRouteCounts mock implementation
 func (m *mockStore) GetLiveRouteCounts() (int, int, error) {
 	// Return mock counts
 	return m.RouteCount / 2, m.RouteCount / 2, nil
 }
 // GetLiveRouteCountsContext mock implementation with context support
 func (m *mockStore) GetLiveRouteCountsContext(_ context.Context) (int, int, error) {
 	return m.GetLiveRouteCounts()
 }
 // GetASDetails mock implementation
 func (m *mockStore) GetASDetails(asn int) (*database.ASN, []database.LiveRoute, error) {
 	m.mu.Lock()
 	defer m.mu.Unlock()
 	// Check if ASN exists
 	if asnInfo, exists := m.ASNs[asn]; exists {
-		return asnInfo, true, nil
+		// Return empty prefixes for now
 		return asnInfo, []database.LiveRoute{}, nil
 	}
-	return &database.ASN{ASN: asn}, false, nil
+	return nil, nil, database.ErrNoRoute
 }
-// GetASWHOIS returns the stored AS, or only its number when none is stored.
+// GetASDetailsContext mock implementation with context support
-func (m *mockStore) GetASWHOIS(ctx context.Context, asn int) (*database.ASN, error) {
+func (m *mockStore) GetASDetailsContext(
-	asnInfo, _, err := m.GetAS(ctx, asn)
+	_ context.Context, asn int,
-
+) (*database.ASN, []database.LiveRoute, error) {
-	return asnInfo, err
+	return m.GetASDetails(asn)
 }
-// GetPrefixFirstSeen returns the zero time: the mock keeps no prefix times.
+// GetPrefixDetails mock implementation
-func (m *mockStore) GetPrefixFirstSeen(
+func (m *mockStore) GetPrefixDetails(
-	_ context.Context, _ netip.Prefix,
+	_ string,
-) (time.Time, error) {
+) ([]database.LiveRoute, map[int]database.ASN, error) {
-	return time.Time{}, nil
+	// Return empty routes for now
 	return []database.LiveRoute{}, map[int]database.ASN{}, nil
 }
 // GetPrefixDetailsContext mock implementation with context support
 func (m *mockStore) GetPrefixDetailsContext(
 	_ context.Context, prefix string,
 ) ([]database.LiveRoute, map[int]database.ASN, error) {
 	return m.GetPrefixDetails(prefix)
 }
 func (m *mockStore) GetRandomPrefixesByLength(
 	_, _, _ int,
 ) ([]database.LiveRoute, error) {
 	// Return empty routes for now
 	return []database.LiveRoute{}, nil
 }
 // GetRandomPrefixesByLengthContext mock implementation with context support
 func (m *mockStore) GetRandomPrefixesByLengthContext(
 	_ context.Context, maskLength, ipVersion, limit int,
 ) ([]database.LiveRoute, error) {
 	return m.GetRandomPrefixesByLength(maskLength, ipVersion, limit)
 }
 // GetASPeers mock implementation
@@ -250,6 +302,32 @@ func (m *mockStore) GetASPeersContext(
 	return m.GetASPeers(asn)
 }
 // GetIPInfo mock implementation
 func (m *mockStore) GetIPInfo(ip string) (*database.IPInfo, error) {
 	return m.GetIPInfoContext(context.Background(), ip)
 }
 // GetIPInfoContext mock implementation with context support
 func (m *mockStore) GetIPInfoContext(
 	_ context.Context, ip string,
 ) (*database.IPInfo, error) {
 	now := time.Now()
 	return &database.IPInfo{
 		IP:          ip,
 		Netblock:    "8.8.8.0/24",
 		MaskLength:  24,
 		IPVersion:   4,
 		NumPeers:    3,
 		ASN:         15169,
 		Handle:      "GOOGLE",
 		Description: "Google LLC",
 		CountryCode: "US",
 		FirstSeen:   now.Add(-24 * time.Hour),
 		LastSeen:    now,
 	}, nil
 }
 // GetNextStaleASN mock implementation
 func (m *mockStore) GetNextStaleASN(_ context.Context, _ time.Duration) (int, error) {
 	return 0, database.ErrNoStaleASN
@@ -277,41 +355,57 @@ func (m *mockStore) GetWHOISStats(
 	}, nil
 }
-// WriteRouteChanges records the prefixes the changes leave some peer carrying,
+// UpsertLiveRouteBatch mock implementation
-// whatever their origin AS.
+func (m *mockStore) UpsertLiveRouteBatch(routes []*database.LiveRoute) error {
 func (m *mockStore) WriteRouteChanges(
 	changes []routetable.Change, _ map[string]uint,
 ) error {
 	m.mu.Lock()
 	defer m.mu.Unlock()
-	for _, change := range changes {
+	for _, route := range routes {
-		if change.Removed {
+		// Track prefix
-			delete(m.TablePrefixes, change.Prefix.String())
+		if _, exists := m.Prefixes[route.Prefix]; !exists {
-		} else {
+			m.Prefixes[route.Prefix] = &database.Prefix{
-			m.TablePrefixes[change.Prefix.String()] = true
+				Prefix:    route.Prefix,
 				IPVersion: route.IPVersion,
 				FirstSeen: route.LastUpdated,
 			}
 			m.PrefixCount++
 			if route.IPVersion == 4 {
 				m.IPv4Prefixes++
 			} else {
 				m.IPv6Prefixes++
 			}
 		}
 		m.RouteCount++
 	}
 	return nil
 }
-// ReadRouteTable returns an empty routing table.
+// DeleteLiveRouteBatch mock implementation
-func (m *mockStore) ReadRouteTable(_ context.Context) (*routetable.Table, error) {
+func (m *mockStore) DeleteLiveRouteBatch(_ []database.LiveRouteDeletion) error {
-	return routetable.New(routetable.Params{}), nil
+	// Simple mock - just return nil
 	return nil
 }
 // DeleteLiveRoutesOfPeer mock implementation
 func (m *mockStore) DeleteLiveRoutesOfPeer(_ string) (int, error) {
 	// Simple mock - deletes nothing
 	return 0, nil
 }
 // GetOrCreateASNBatch mock implementation
-func (m *mockStore) GetOrCreateASNBatch(asns map[int]database.SeenTimes) error {
+func (m *mockStore) GetOrCreateASNBatch(asns map[int]time.Time) error {
 	m.mu.Lock()
 	defer m.mu.Unlock()
-	for number, seen := range asns {
+	for number, timestamp := range asns {
 		if _, exists := m.ASNs[number]; !exists {
 			m.ASNs[number] = &database.ASN{
 				ASN:       number,
-				FirstSeen: seen.First,
+				FirstSeen: timestamp,
-				LastSeen:  seen.Last,
+				LastSeen:  timestamp,
 			}
 			m.ASNCount++
 		}
@@ -372,22 +466,19 @@ func TestRouteWatchLiveFeed(t *testing.T) {
 	// Create streamer
 	s := streamer.New(logger, metricsTracker)
-	// The state directory holds the blocklist copies Run downloads.
+	// Create test config with empty state dir (no snapshot loading)
 	cfg := &config.Config{
-		StateDir:                    t.TempDir(),
+		StateDir:                    "",
 		MaxRuntime:                  5 * time.Second,
 		EnableBatchedDatabaseWrites: true,
 	}
 	table := routetable.New(routetable.Params{})
 	// Create server
-	srv := server.New(mockDB, table, s, logger, cfg)
+	srv := server.New(mockDB, s, logger, cfg)
 	// Create RouteWatch with 5 second limit
 	deps := Dependencies{
 		DB:       mockDB,
 		Table:    table,
 		Streamer: s,
 		Server:   srv,
 		Logger:   logger,
@@ -475,8 +566,7 @@ func announcementFeed(prefixes []string) string {
 // handler's worker waits on the first one until the server sees the streamer
 // close the connection, which only Shutdown does, so all three are still in
 // the streamer when Shutdown starts. Each prefix must be in the database when
-// Shutdown returns, both in the prefix tables and in the routing table's
+// Shutdown returns.
 // writes.
 func TestShutdownWritesTheUpdatesQueuedInTheStreamer(t *testing.T) {
 	t.Parallel()
@@ -506,11 +596,11 @@ func TestShutdownWritesTheUpdatesQueuedInTheStreamer(t *testing.T) {
 	rw := New(Dependencies{
 		DB:       store,
 		Streamer: s,
-		Server:   server.New(store, nil, s, log, cfg),
+		Server:   server.New(store, s, log, cfg),
 		Logger:   log,
 		Config:   cfg,
 	})
-	rw.prefixHandler = NewPrefixHandler(store, log, routetable.New(routetable.Params{}))
+	rw.prefixHandler = NewPrefixHandler(store, log)
 	s.RegisterHandler(gatedPrefixHandler{
 		PrefixHandler: rw.prefixHandler, release: release,
 	})
@@ -550,11 +640,9 @@ func TestShutdownWritesTheUpdatesQueuedInTheStreamer(t *testing.T) {
 	defer store.mu.Unlock()
 	for _, prefix := range prefixes {
-		_, inPrefixTables := store.Prefixes[prefix]
+		if _, ok := store.Prefixes[prefix]; !ok {
-		if !inPrefixTables || !store.TablePrefixes[prefix] {
+			t.Errorf("%s was queued in the streamer when Shutdown started "+
-			t.Errorf("%s was queued in the streamer when Shutdown started; "+
+				"but is not in the database", prefix)
 				"written to the prefix tables %t, in the routing table's "+
 				"writes %t", prefix, inPrefixTables, store.TablePrefixes[prefix])
 		}
 	}
 }
@@ -608,7 +696,7 @@ func TestShutdownReturnsByItsDeadlineWhileAWriteIsBlocked(t *testing.T) {
 	rw := New(Dependencies{
 		DB:       store,
 		Streamer: s,
-		Server:   server.New(store, nil, s, log, cfg),
+		Server:   server.New(store, s, log, cfg),
 		Logger:   log,
 		Config:   cfg,
 	})
@@ -678,9 +766,7 @@ const (
 	callClose      = "close"
 )
-func (s *closeOrderStore) GetOrCreateASNBatch(
+func (s *closeOrderStore) GetOrCreateASNBatch(asns map[int]time.Time) error {
 	asns map[int]database.SeenTimes,
 ) error {
 	s.record(callWrite)
 	return s.Store.GetOrCreateASNBatch(asns)
@@ -722,7 +808,7 @@ func TestShutdownCheckpointsAndClosesTheDatabaseLast(t *testing.T) {
 	rw := New(Dependencies{
 		DB:       store,
 		Streamer: s,
-		Server:   server.New(store, nil, s, log, cfg),
+		Server:   server.New(store, s, log, cfg),
 		Logger:   log,
 		Config:   cfg,
 	})
@@ -52,6 +52,7 @@ type ASHandler struct {
 	// &mu.
 	batchTaken  sync.Cond
 	batchFullCh chan struct{} // wakes the flush goroutine when batch is full
 	lastFlush   time.Time     // used only by the flush goroutine
 	// stopCh hands Stop's context to the flush goroutine. It holds one, so
 	// Stop does not wait for a write in progress to hand it over.
 	stopCh chan context.Context
@@ -69,27 +70,19 @@ type asnOp struct {
 // Stop when finished to ensure all pending operations are flushed and the
 // background goroutine is terminated.
 func NewASHandler(db database.Store, logger *logger.Logger) *ASHandler {
 	return newASHandler(db, logger, asnBatchTimeout)
 }
 // newASHandler is NewASHandler with the flush timer's interval, batchTimeout,
 // in place of asnBatchTimeout. A test that the timer must not disturb gives an
 // interval longer than the test runs.
 func newASHandler(
 	db database.Store, logger *logger.Logger, batchTimeout time.Duration,
 ) *ASHandler {
 	h := &ASHandler{
 		db:          db,
 		logger:      logger,
 		batch:       make([]asnOp, 0, asnBatchSize),
 		batchFullCh: make(chan struct{}, 1),
 		lastFlush:   time.Now(),
 		stopCh:      make(chan context.Context, 1),
 		done:        make(chan struct{}),
 	}
 	h.batchTaken.L = &h.mu
 	// Start the flush timer goroutine
-	go flushLoop(batchTimeout, h.batchFullCh, h.stopCh, h.done, h.flushBatch)
+	go h.flushLoop()
 	return h
 }
@@ -182,6 +175,33 @@ func (h *ASHandler) Stop(ctx context.Context) {
 	}
 }
 // flushLoop runs in a goroutine, the only one that writes the batch: it
 // flushes when the batch is full, periodically, and once more on Stop.
 func (h *ASHandler) flushLoop() {
 	defer close(h.done)
 	ticker := time.NewTicker(asnBatchTimeout)
 	defer ticker.Stop()
 	for {
 		select {
 		case <-ticker.C:
 			if time.Since(h.lastFlush) >= asnBatchTimeout {
 				h.flushBatch()
 			}
 		case <-h.batchFullCh:
 			h.flushBatch()
 		case ctx := <-h.stopCh:
 			// Final flush, unless the stop deadline has passed
 			if ctx.Err() == nil {
 				h.flushBatch()
 			}
 			return
 		}
 	}
 }
 // takeBatch returns the pending operations and leaves an empty batch in their
 // place for HandleMessage to fill. They count in writing until flushBatch has
 // written them.
@@ -209,24 +229,24 @@ func (h *ASHandler) flushBatch() {
 		return
 	}
-	// The earliest and the latest time the batch saw each AS. The batch holds
+	// Process ASNs first (deduped)
-	// several updates for an AS, from many peers, so a new AS is stored first
+	asnMap := make(map[int]time.Time)
 	// seen at the earliest of them and last seen at the latest.
 	asns := make(map[int]database.SeenTimes)
 	for _, op := range batch {
-		seen := asns[op.number]
+		if existing, ok := asnMap[op.number]; !ok || op.timestamp.After(existing) {
-		seen.Add(op.timestamp)
+			asnMap[op.number] = op.timestamp
-		asns[op.number] = seen
+		}
 	}
 	// Process all ASNs in a single batch transaction
-	err := h.db.GetOrCreateASNBatch(asns)
+	err := h.db.GetOrCreateASNBatch(asnMap)
 	if err != nil {
 		h.logger.Error("Failed to process ASN batch",
-			"error", err, "count", len(asns))
+			"error", err, "count", len(asnMap))
 	}
 	h.mu.Lock()
 	h.writing = 0
 	h.mu.Unlock()
 	h.lastFlush = time.Now()
 }
@@ -1,68 +0,0 @@
 package routewatch
 import (
 	"maps"
 	"slices"
 	"testing"
 	"git.eeqj.de/sneak/routewatch/internal/logger"
 )
 // TestASHandlerStoresTheEarliestAndLatestTimesOfANewAS handles two updates
 // whose path carries an AS the database does not hold yet, the second 5
 // seconds after the first, in one batch into a real database. The AS is stored
 // first seen at the time of the first update and last seen at the time of the
 // second.
 func TestASHandlerStoresTheEarliestAndLatestTimesOfANewAS(t *testing.T) {
 	t.Parallel()
 	db := newTestDatabase(t)
 	// Built without NewASHandler's flush goroutine, so the test flushes itself.
 	h := &ASHandler{db: db, logger: logger.New()}
 	first := peerAnnouncement(testPeerIP, testV4Prefix)
 	second := peerAnnouncement(testPeerIP, testV4Prefix)
 	second.ParsedTimestamp = first.ParsedTimestamp.Add(secondUpdateAfter)
 	h.HandleMessage(first)
 	h.HandleMessage(second)
 	h.flushBatch()
 	asn, _, err := db.GetAS(t.Context(), testASNA)
 	if err != nil {
 		t.Fatalf("GetAS(%d): %v", testASNA, err)
 	}
 	if !asn.FirstSeen.Equal(first.ParsedTimestamp) {
 		t.Errorf("first_seen of AS%d = %s, want %s", testASNA,
 			asn.FirstSeen, first.ParsedTimestamp)
 	}
 	if !asn.LastSeen.Equal(second.ParsedTimestamp) {
 		t.Errorf("last_seen of AS%d = %s, want %s", testASNA,
 			asn.LastSeen, second.ParsedTimestamp)
 	}
 }
 // TestASHandlerRecordsNothingFromAPathWithASZero handles an update whose AS
 // path holds AS 0 between two other ASes. RFC 7607 makes such a path
 // malformed, so neither AS is recorded.
 func TestASHandlerRecordsNothingFromAPathWithASZero(t *testing.T) {
 	t.Parallel()
 	store := newMockStore()
 	// Built without NewASHandler's flush goroutine, so the test flushes itself.
 	h := &ASHandler{db: store, logger: logger.New()}
 	msg := peerAnnouncement(testPeerIP, testV4Prefix)
 	msg.Path = decodePath(t, testASNA, 0, testASNB)
 	h.HandleMessage(msg)
 	h.flushBatch()
 	if len(store.ASNs) > 0 {
 		t.Errorf("ASes recorded = %v, want none",
 			slices.Sorted(maps.Keys(store.ASNs)))
 	}
 }
@@ -21,16 +21,10 @@ const (
 	minInterval = 1 * time.Second
 	// maxInterval is the maximum interval after failures (backoff cap).
-	maxInterval = time.Minute
+	maxInterval = 5 * time.Minute
-	// A failure multiplies the interval by backoffNumerator divided by
+	// backoffMultiplier is how much to multiply interval on failure.
-	// backoffDenominator, 1.5, up to maxInterval.
+	backoffMultiplier = 2
 	backoffNumerator   = 3
 	backoffDenominator = 2
 	// A success divides the interval by successDivisor, down to
 	// minInterval.
 	successDivisor = 2
 	// whoisStaleThreshold is how old WHOIS data can be before refresh.
 	whoisStaleThreshold = 30 * 24 * time.Hour // 30 days
@@ -59,8 +53,7 @@ type ASNFetcher struct {
 	currentInterval  time.Duration
 	consecutiveFails int
-	// hourly stats tracking; now is the clock, time.Now except in tests
+	// hourly stats tracking
 	now          func() time.Time
 	statsMu      sync.Mutex
 	successTimes []time.Time
 	errorTimes   []time.Time
@@ -68,17 +61,14 @@ type ASNFetcher struct {
 // NewASNFetcher creates a new ASN fetcher.
 func NewASNFetcher(db database.Store, logger *slog.Logger) *ASNFetcher {
 	logger = logger.With("component", "asn_fetcher")
 	return &ASNFetcher{
 		db:              db,
-		whoisClient:     whois.NewClient(logger),
+		whoisClient:     whois.NewClient(),
-		logger:          logger,
+		logger:          logger.With("component", "asn_fetcher"),
 		immediateQueue:  make(chan int, immediateQueueSize),
 		stopCh:          make(chan struct{}),
 		done:            make(chan struct{}),
 		currentInterval: baseInterval,
 		now:             time.Now,
 		successTimes:    make([]time.Time, 0),
 		errorTimes:      make([]time.Time, 0),
 	}
@@ -131,7 +121,7 @@ func (f *ASNFetcher) GetStats() server.ASNFetcherStats {
 	f.intervalMu.Unlock()
 	// Prune old entries and count
-	cutoff := f.now().Add(-statsWindow)
+	cutoff := time.Now().Add(-statsWindow)
 	f.successTimes = pruneOldTimes(f.successTimes, cutoff)
 	f.errorTimes = pruneOldTimes(f.errorTimes, cutoff)
@@ -143,15 +133,16 @@ func (f *ASNFetcher) GetStats() server.ASNFetcherStats {
 	}
 }
-// pruneOldTimes drops the times at or before cutoff from the front of times,
+// pruneOldTimes removes times older than cutoff and returns the pruned slice.
 // which holds times in the order they were recorded, and returns the rest. It
 // copies nothing, so it is cheap enough to run on every append.
 func pruneOldTimes(times []time.Time, cutoff time.Time) []time.Time {
-	for len(times) > 0 && !times[0].After(cutoff) {
+	result := make([]time.Time, 0, len(times))
-		times = times[1:]
+	for _, t := range times {
 		if t.After(cutoff) {
 			result = append(result, t)
 		}
 	}
-	return times
+	return result
 }
 // getInterval returns the current fetch interval.
@@ -168,7 +159,7 @@ func (f *ASNFetcher) recordSuccess() {
 	f.consecutiveFails = 0
 	// Decrease interval by half, but not below minimum
-	newInterval := max(f.currentInterval/successDivisor, minInterval)
+	newInterval := max(f.currentInterval/backoffMultiplier, minInterval)
 	if newInterval != f.currentInterval {
 		f.logger.Debug("Decreased fetch interval",
@@ -179,11 +170,9 @@ func (f *ASNFetcher) recordSuccess() {
 	}
 	f.intervalMu.Unlock()
-	// Record success time for stats, dropping those older than statsWindow
+	// Record success time for stats
 	f.statsMu.Lock()
-	now := f.now()
+	f.successTimes = append(f.successTimes, time.Now())
 	f.successTimes = pruneOldTimes(f.successTimes, now.Add(-statsWindow))
 	f.successTimes = append(f.successTimes, now)
 	f.statsMu.Unlock()
 }
@@ -192,9 +181,8 @@ func (f *ASNFetcher) recordFailure() {
 	f.intervalMu.Lock()
 	f.consecutiveFails++
-	// Exponential backoff: multiply by 1.5, capped at max
+	// Exponential backoff: multiply by 2, capped at max
-	newInterval := min(
+	newInterval := min(f.currentInterval*backoffMultiplier, maxInterval)
 		f.currentInterval*backoffNumerator/backoffDenominator, maxInterval)
 	if newInterval != f.currentInterval {
 		f.logger.Debug("Increased fetch interval due to failure",
@@ -206,11 +194,9 @@ func (f *ASNFetcher) recordFailure() {
 	}
 	f.intervalMu.Unlock()
-	// Record error time for stats, dropping those older than statsWindow
+	// Record error time for stats
 	f.statsMu.Lock()
-	now := f.now()
+	f.errorTimes = append(f.errorTimes, time.Now())
 	f.errorTimes = pruneOldTimes(f.errorTimes, now.Add(-statsWindow))
 	f.errorTimes = append(f.errorTimes, now)
 	f.statsMu.Unlock()
 }
@@ -120,58 +120,17 @@ func TestFetchAndUpdateKeepsTheRowWhenTheLookupFails(t *testing.T) {
 					"was stored", stats.NeverFetched)
 			}
 			want := baseInterval * backoffNumerator / backoffDenominator
 			got := f.GetStats()
-			if got.CurrentInterval != want || got.ConsecutiveFails != 1 {
+			if got.CurrentInterval != baseInterval*backoffMultiplier ||
 				got.ConsecutiveFails != 1 {
 				t.Errorf("interval %v after %d failures, want %v after 1",
-					got.CurrentInterval, got.ConsecutiveFails, want)
+					got.CurrentInterval, got.ConsecutiveFails,
 					baseInterval*backoffMultiplier)
 			}
 		})
 	}
 }
 // TestRecordStepsTheInterval has the fetcher fail from its base interval of
 // 15 seconds, then succeed. Each failure makes the interval 1.5 times as
 // long, up to one minute, and each success halves it, down to one second.
 func TestRecordStepsTheInterval(t *testing.T) {
 	t.Parallel()
 	f := NewASNFetcher(newMockStore(), logger.New().Logger)
 	for i, want := range []time.Duration{
 		22500 * time.Millisecond,
 		33750 * time.Millisecond,
 		50625 * time.Millisecond,
 		time.Minute,
 		time.Minute,
 	} {
 		f.recordFailure()
 		if got := f.getInterval(); got != want {
 			t.Errorf("interval after %d failures = %v, want %v",
 				i+1, got, want)
 		}
 	}
 	for i, want := range []time.Duration{
 		30 * time.Second,
 		15 * time.Second,
 		7500 * time.Millisecond,
 		3750 * time.Millisecond,
 		1875 * time.Millisecond,
 		time.Second,
 		time.Second,
 	} {
 		f.recordSuccess()
 		if got := f.getInterval(); got != want {
 			t.Errorf("interval after %d successes = %v, want %v",
 				i+1, got, want)
 		}
 	}
 }
 // TestFetchAndUpdateMarksAnASWithoutReferral looks up a private-use AS, which
 // IANA refers to no RIR. The AS must not be looked up again until it is
 // stale, and the lookup counts as neither a success nor a failure.
@@ -244,35 +203,3 @@ func TestASNFetcherStopReturnsByItsDeadline(t *testing.T) {
 		t.Fatal("the fetcher goroutine did not return after the lookup ended")
 	}
 }
 // TestRecordKeepsOnlyTheStatsWindow records a success and a failure every
 // second, by a clock the test sets, far longer than statsWindow, and never
 // asks for the stats. The fetcher must keep only the times within the last
 // statsWindow.
 func TestRecordKeepsOnlyTheStatsWindow(t *testing.T) {
 	t.Parallel()
 	const (
 		records = 100_000
 		step    = time.Second
 		want    = int(statsWindow / step)
 	)
 	clock := time.Now()
 	f := NewASNFetcher(newMockStore(), logger.New().Logger)
 	f.now = func() time.Time { return clock }
 	for range records {
 		clock = clock.Add(step)
 		f.recordSuccess()
 		f.recordFailure()
 	}
 	if len(f.successTimes) != want || len(f.errorTimes) != want {
 		t.Errorf("%d success and %d error times kept, want %d of each, "+
 			"those of the last %s", len(f.successTimes), len(f.errorTimes),
 			want, statsWindow)
 	}
 }
@@ -1,62 +0,0 @@
 package routewatch
 import (
 	"context"
 	"time"
 )
 // flushLoop is the flush goroutine of the prefix, AS and peer handlers. It is
 // the only goroutine that writes a handler's batch. flushBatch takes the batch
 // and writes it.
 //
 // flushLoop calls flushBatch on each tick of a timer, every batchTimeout. It
 // also calls it at once when batchFullCh wakes it. A full batch's write
 // restarts the timer, so the next tick comes batchTimeout after that write
 // began. When stopCh hands it Stop's context, it calls flushBatch once more,
 // unless the stop deadline has passed. Then it closes done and returns.
 func flushLoop(
 	batchTimeout time.Duration,
 	batchFullCh <-chan struct{},
 	stopCh <-chan context.Context,
 	done chan<- struct{},
 	flushBatch func(),
 ) {
 	defer close(done)
 	ticker := time.NewTicker(batchTimeout)
 	defer ticker.Stop()
 	for {
 		// Stop goes first. A write can run past the stop deadline while a full
 		// batch's wake-up or a tick waits beside Stop's context. The select
 		// below picks one of them at random, but past the deadline no flush
 		// may start.
 		select {
 		case ctx := <-stopCh:
 			// Final flush, unless the stop deadline has passed
 			if ctx.Err() == nil {
 				flushBatch()
 			}
 			return
 		default:
 		}
 		select {
 		case <-ticker.C:
 			flushBatch()
 		case <-batchFullCh:
 			// Reset also drops a tick that waits in ticker.C, so no timed
 			// write follows this one at once.
 			ticker.Reset(batchTimeout)
 			flushBatch()
 		case ctx := <-stopCh:
 			// Final flush, unless the stop deadline has passed
 			if ctx.Err() == nil {
 				flushBatch()
 			}
 			return
 		}
 	}
 }
@@ -4,18 +4,15 @@ import (
 	"bytes"
 	"context"
 	"encoding/json"
 	"fmt"
 	"log/slog"
 	"slices"
 	"sync"
 	"testing"
 	"testing/synctest"
 	"time"
 	"git.eeqj.de/sneak/routewatch/internal/database"
 	"git.eeqj.de/sneak/routewatch/internal/logger"
 	"git.eeqj.de/sneak/routewatch/internal/ristypes"
 	"git.eeqj.de/sneak/routewatch/internal/routetable"
 )
 const (
@@ -28,62 +25,10 @@ const (
 	stillWaitingAfter = 100 * time.Millisecond
 )
 // TestFlushLoopWritesOnEveryTick runs flushLoop in a synctest bubble, whose
 // clock is fake: time.Sleep there moves the clock on and returns at once. Each
 // write takes a tenth of the interval. Two timed writes must start one interval
 // apart. A full batch's write, which starts as the second timed write ends,
 // must be followed by a timed write one interval after it began.
 func TestFlushLoopWritesOnEveryTick(t *testing.T) {
 	t.Parallel()
 	synctest.Test(t, func(t *testing.T) {
 		const (
 			interval  = time.Second
 			writeTime = 100 * time.Millisecond
 		)
 		writeStarts := make(chan time.Time)
 		batchFullCh := make(chan struct{}, 1)
 		stopCh := make(chan context.Context, 1)
 		done := make(chan struct{})
 		go func() {
 			flushLoop(interval, batchFullCh, stopCh, done, func() {
 				writeStarts <- time.Now()
 				time.Sleep(writeTime)
 			})
 		}()
 		first := <-writeStarts
 		second := <-writeStarts
 		if gap := second.Sub(first); gap != interval {
 			t.Errorf("the second timed write started %s after the first, "+
 				"want %s", gap, interval)
 		}
 		batchFullCh <- struct{}{}
 		full := <-writeStarts
 		timed := <-writeStarts
 		if gap := timed.Sub(full); gap != interval {
 			t.Errorf("the timed write after a full batch's started %s after "+
 				"it, want %s", gap, interval)
 		}
 		stopCh <- t.Context()
 		<-writeStarts // Stop's last write
 		<-done
 	})
 }
 // blockingStore is a mockStore whose batch writes for the AS, peer and prefix
-// handlers and peering write wait until the test calls releaseWrites.
+// handlers, delete of a peer's routes and peering write wait until the test
-// writeStarted is closed when the first of them starts. It records what each
+// calls releaseWrites. writeStarted is closed when the first of them starts. It
-// batch write was given.
+// records what each batch write was given.
 type blockingStore struct {
 	*mockStore
@@ -109,19 +54,19 @@ func newBlockingStore() *blockingStore {
 	}
 }
-func (s *blockingStore) UpdatePrefixesBatch(prefixes map[string]time.Time) error {
+func (s *blockingStore) UpsertLiveRouteBatch(routes []*database.LiveRoute) error {
 	s.waitForRelease()
 	s.mu.Lock()
 	defer s.mu.Unlock()
-	for prefix := range prefixes {
+	for _, route := range routes {
-		s.prefixes[prefix] = true
+		s.prefixes[route.Prefix] = true
 	}
 	return nil
 }
-func (s *blockingStore) GetOrCreateASNBatch(asns map[int]database.SeenTimes) error {
+func (s *blockingStore) GetOrCreateASNBatch(asns map[int]time.Time) error {
 	s.waitForRelease()
 	s.mu.Lock()
 	defer s.mu.Unlock()
@@ -145,12 +90,16 @@ func (s *blockingStore) UpdatePeerBatch(peers map[string]database.PeerUpdate) er
 	return nil
 }
-func (s *blockingStore) RecordPeering(
+func (s *blockingStore) DeleteLiveRoutesOfPeer(peerIP string) (int, error) {
 	asA, asB int, seen database.SeenTimes,
 ) error {
 	s.waitForRelease()
-	return s.mockStore.RecordPeering(asA, asB, seen)
+	return s.mockStore.DeleteLiveRoutesOfPeer(peerIP)
 }
 func (s *blockingStore) RecordPeering(asA, asB int, ts time.Time) error {
 	s.waitForRelease()
 	return s.mockStore.RecordPeering(asA, asB, ts)
 }
 func (s *blockingStore) waitForRelease() {
@@ -170,7 +119,7 @@ func (s *blockingStore) releaseWrites() {
 type stopLog struct {
 	Msg       string `json:"msg"`
 	Updates   int    `json:"updates"`
-	TableChanges int    `json:"table_changes"`
+	PeersDown int    `json:"peers_down"`
 	Paths     int    `json:"paths"`
 }
@@ -215,10 +164,9 @@ func returnsInTime(f func()) bool {
 	}
 }
-// startBlockedWrite hands h the messages in fill and waits until h starts to
+// startBlockedWrite hands h the messages in fill, which fill its batch so that
-// write them to store. The prefix, AS and peer handlers start when fill fills
+// the handler writes it to store, and waits until that write starts. store
-// their batch, and the peering handler on its timer. store holds the write
+// holds it until the test calls releaseWrites.
 // until the test calls releaseWrites.
 func startBlockedWrite(
 	t *testing.T,
 	store *blockingStore,
@@ -241,7 +189,7 @@ func startBlockedWrite(
 	select {
 	case <-store.writeStarted:
 	case <-time.After(handleMessageTimeout):
-		t.Fatal("the handler did not start to write the messages")
+		t.Fatal("the handler did not write its full batch")
 	}
 }
@@ -321,7 +269,7 @@ func handleAtMaxBatchSize(
 }
 // stopWhileAWriteIsBlocked starts a blocked write with the messages in fill,
-// hands h the messages in extra, and stops h with a deadline that passes while
+// hands h the message extra, and stops h with a deadline that passes while
 // store holds the write. Stop must return all the same. Then it lets the write
 // finish and waits until done, closed when h's flush goroutine returns. Past
 // the deadline that goroutine skips its last write, so extra is not written,
@@ -335,7 +283,7 @@ func stopWhileAWriteIsBlocked(
 	},
 	done <-chan struct{},
 	fill []*ristypes.RISMessage,
-	extra ...*ristypes.RISMessage,
+	extra *ristypes.RISMessage,
 ) {
 	t.Helper()
@@ -344,10 +292,7 @@ func stopWhileAWriteIsBlocked(
 	defer store.releaseWrites()
 	startBlockedWrite(t, store, h, fill)
-
+	h.HandleMessage(extra)
 	for _, msg := range extra {
 		h.HandleMessage(msg)
 	}
 	ctx, cancel := context.WithTimeout(t.Context(), stopDeadline)
 	defer cancel()
@@ -366,11 +311,6 @@ func stopWhileAWriteIsBlocked(
 	}
 }
 // TestPrefixHandlerSkipsItsLastWriteAfterTheStopDeadline also checks the
 // routing table's changes: the flush whose prefix write is held wrote those of
 // the fill, so Stop must log the one of the extra prefix as not written. The
 // flush timer must not fire. A flush it started before the fill would be the
 // one held, and it would not have written the fill's change.
 func TestPrefixHandlerSkipsItsLastWriteAfterTheStopDeadline(t *testing.T) {
 	t.Parallel()
@@ -379,11 +319,12 @@ func TestPrefixHandlerSkipsItsLastWriteAfterTheStopDeadline(t *testing.T) {
 	var logs bytes.Buffer
 	store := newBlockingStore()
-	h := newPrefixHandler(store, newErrorLogger(&logs),
+	h := NewPrefixHandler(store, newErrorLogger(&logs))
 		routetable.New(routetable.Params{}), longerThanAnyTest)
 	fill := slices.Repeat([]string{testV4Prefix}, prefixBatchSize)
 	// The peer's session goes down first, so the write held is the delete of
 	// its routes, and Stop must log that peer down too.
 	stopWhileAWriteIsBlocked(t, store, h, h.done,
-		[]*ristypes.RISMessage{prefixAnnouncement(fill)},
+		[]*ristypes.RISMessage{sessionDown(), prefixAnnouncement(fill)},
 		prefixAnnouncement([]string{extraPrefix}))
 	store.mu.Lock()
@@ -394,75 +335,9 @@ func TestPrefixHandlerSkipsItsLastWriteAfterTheStopDeadline(t *testing.T) {
 	}
 	logged := lastLogged(t, &logs)
-	if logged.Updates != prefixBatchSize+1 || logged.TableChanges != 1 {
+	if logged.Updates != prefixBatchSize+1 || logged.PeersDown != 1 {
-		t.Errorf("Stop logged %d updates and %d table changes not written, "+
+		t.Errorf("Stop logged %d updates and %d peer downs not written, "+
-			"want %d and 1", logged.Updates, logged.TableChanges,
+			"want %d and 1", logged.Updates, logged.PeersDown, prefixBatchSize+1)
 			prefixBatchSize+1)
 	}
 }
 // TestPrefixHandlerSkipsAFullBatchAfterTheStopDeadline hands the prefix handler
 // a full batch while a write is held, so the batch's wake-up of the flush
 // goroutine waits. The stop deadline passes meanwhile. When the write ends, the
 // flush goroutine must stop instead of writing the batch.
 func TestPrefixHandlerSkipsAFullBatchAfterTheStopDeadline(t *testing.T) {
 	t.Parallel()
 	const extraPrefix = "198.51.100.0/24"
 	store := newBlockingStore()
 	h := NewPrefixHandler(store, logger.New(), routetable.New(routetable.Params{}))
 	fill := slices.Repeat([]string{testV4Prefix}, prefixBatchSize)
 	full := slices.Repeat([]string{extraPrefix}, prefixBatchSize)
 	stopWhileAWriteIsBlocked(t, store, h, h.done,
 		[]*ristypes.RISMessage{prefixAnnouncement(fill)},
 		prefixAnnouncement(full))
 	store.mu.Lock()
 	defer store.mu.Unlock()
 	if store.prefixes[extraPrefix] {
 		t.Errorf("%s was written after the stop deadline", extraPrefix)
 	}
 }
 // tableWriteBlockingStore is a blockingStore whose writes of the routing
 // table's changes also wait until the test calls releaseWrites.
 type tableWriteBlockingStore struct {
 	*blockingStore
 }
 func (s tableWriteBlockingStore) WriteRouteChanges(
 	changes []routetable.Change, newPeers map[string]uint,
 ) error {
 	s.waitForRelease()
 	return s.mockStore.WriteRouteChanges(changes, newPeers)
 }
 // TestPrefixHandlerStopCountsTheTableChangesOfAWriteInProgress holds the write
 // of the routing table's changes that a full batch starts, then hands the
 // prefix handler one more prefix and stops it with a deadline that passes
 // meanwhile. Stop must log as not written both the change the held write took
 // and the one since.
 func TestPrefixHandlerStopCountsTheTableChangesOfAWriteInProgress(t *testing.T) {
 	t.Parallel()
 	const extraPrefix = "198.51.100.0/24"
 	var logs bytes.Buffer
 	blocking := newBlockingStore()
 	h := NewPrefixHandler(tableWriteBlockingStore{blockingStore: blocking},
 		newErrorLogger(&logs), routetable.New(routetable.Params{}))
 	fill := slices.Repeat([]string{testV4Prefix}, prefixBatchSize)
 	stopWhileAWriteIsBlocked(t, blocking, h, h.done,
 		[]*ristypes.RISMessage{prefixAnnouncement(fill)},
 		prefixAnnouncement([]string{extraPrefix}))
 	if logged := lastLogged(t, &logs); logged.TableChanges != 2 {
 		t.Errorf("Stop logged %d table changes not written, want 2",
 			logged.TableChanges)
 	}
 }
@@ -476,7 +351,7 @@ func TestASHandlerSkipsItsLastWriteAfterTheStopDeadline(t *testing.T) {
 	var logs bytes.Buffer
 	store := newBlockingStore()
-	h := newASHandler(store, newErrorLogger(&logs), longerThanAnyTest)
+	h := NewASHandler(store, newErrorLogger(&logs))
 	fill := ristypes.ASPath{Sequence: slices.Repeat([]int{testASNA}, asnBatchSize)}
 	stopWhileAWriteIsBlocked(t, store, h, h.done,
 		[]*ristypes.RISMessage{{Path: fill}},
@@ -495,29 +370,6 @@ func TestASHandlerSkipsItsLastWriteAfterTheStopDeadline(t *testing.T) {
 	}
 }
 // TestASHandlerSkipsAFullBatchAfterTheStopDeadline hands the AS handler a full
 // batch while a write is held, so the batch's wake-up of the flush goroutine
 // waits. The stop deadline passes meanwhile. When the write ends, the flush
 // goroutine must stop instead of writing the batch.
 func TestASHandlerSkipsAFullBatchAfterTheStopDeadline(t *testing.T) {
 	t.Parallel()
 	store := newBlockingStore()
 	h := newASHandler(store, logger.New(), longerThanAnyTest)
 	fill := ristypes.ASPath{Sequence: slices.Repeat([]int{testASNA}, asnBatchSize)}
 	full := ristypes.ASPath{Sequence: slices.Repeat([]int{testASNB}, asnBatchSize)}
 	stopWhileAWriteIsBlocked(t, store, h, h.done,
 		[]*ristypes.RISMessage{{Path: fill}},
 		&ristypes.RISMessage{Path: full})
 	store.mu.Lock()
 	defer store.mu.Unlock()
 	if store.asns[testASNB] {
 		t.Errorf("AS%d was written after the stop deadline", testASNB)
 	}
 }
 func TestPeerHandlerSkipsItsLastWriteAfterTheStopDeadline(t *testing.T) {
 	t.Parallel()
@@ -526,7 +378,7 @@ func TestPeerHandlerSkipsItsLastWriteAfterTheStopDeadline(t *testing.T) {
 	var logs bytes.Buffer
 	store := newBlockingStore()
-	h := newPeerHandler(store, newErrorLogger(&logs), longerThanAnyTest)
+	h := NewPeerHandler(store, newErrorLogger(&logs))
 	stopWhileAWriteIsBlocked(t, store, h, h.done,
 		slices.Repeat([]*ristypes.RISMessage{{Peer: testPeerIP}}, peerBatchSize),
 		&ristypes.RISMessage{Peer: otherPeerIP})
@@ -544,30 +396,6 @@ func TestPeerHandlerSkipsItsLastWriteAfterTheStopDeadline(t *testing.T) {
 	}
 }
 // TestPeerHandlerSkipsAFullBatchAfterTheStopDeadline hands the peer handler a
 // full batch while a write is held, so the batch's wake-up of the flush
 // goroutine waits. The stop deadline passes meanwhile. When the write ends, the
 // flush goroutine must stop instead of writing the batch.
 func TestPeerHandlerSkipsAFullBatchAfterTheStopDeadline(t *testing.T) {
 	t.Parallel()
 	const otherPeerIP = "2001:db8:ffff::2"
 	store := newBlockingStore()
 	h := newPeerHandler(store, logger.New(), longerThanAnyTest)
 	stopWhileAWriteIsBlocked(t, store, h, h.done,
 		slices.Repeat([]*ristypes.RISMessage{{Peer: testPeerIP}}, peerBatchSize),
 		slices.Repeat([]*ristypes.RISMessage{{Peer: otherPeerIP}},
 			peerBatchSize)...)
 	store.mu.Lock()
 	defer store.mu.Unlock()
 	if store.peers[otherPeerIP] {
 		t.Errorf("peer %s was written after the stop deadline", otherPeerIP)
 	}
 }
 // TestPeeringHandlerStopCountsTheWriteInProgress hands a running peering
 // handler one AS path and stops it with a deadline that passes while store
 // holds Stop's last write, of that path's peering. Stop must log that path as
@@ -607,35 +435,6 @@ func TestPeeringHandlerStopCountsTheWriteInProgress(t *testing.T) {
 	}
 }
 // TestPeeringHandlerStartsNoWriteAfterTheStopDeadline has the peering handler's
 // timer start a write that store holds, and hands the handler one more AS path
 // meanwhile. The stop deadline passes, and a tick of the timer waits. When the
 // write ends, the processing goroutine must stop instead of writing the path.
 func TestPeeringHandlerStartsNoWriteAfterTheStopDeadline(t *testing.T) {
 	t.Parallel()
 	// The timer fires many times while Stop waits for its deadline.
 	const processInterval = 10 * time.Millisecond
 	store := newBlockingStore()
 	h := newPeeringHandler(store, logger.New(), processInterval)
 	stopWhileAWriteIsBlocked(t, store, h, h.done,
 		[]*ristypes.RISMessage{
 			{Path: ristypes.ASPath{Sequence: []int{testASNA, testASNB}}},
 		},
 		&ristypes.RISMessage{
 			Path: ristypes.ASPath{Sequence: []int{testASNC, testASND}},
 		})
 	store.mockStore.mu.Lock()
 	defer store.mockStore.mu.Unlock()
 	if store.Peerings[fmt.Sprintf("%d_%d", testASNC, testASND)] {
 		t.Errorf("the peering of AS%d and AS%d was written after the stop "+
 			"deadline", testASNC, testASND)
 	}
 }
 // prefixAnnouncement returns a message in which testPeerIP announces prefixes
 // with origin AS testASNA.
 func prefixAnnouncement(prefixes []string) *ristypes.RISMessage {
@@ -654,7 +453,7 @@ func TestPrefixHandlerHandlesMessagesWhileAWriteIsBlocked(t *testing.T) {
 	const extraPrefix = "198.51.100.0/24"
 	store := newBlockingStore()
-	h := NewPrefixHandler(store, logger.New(), routetable.New(routetable.Params{}))
+	h := NewPrefixHandler(store, logger.New())
 	fill := slices.Repeat([]string{testV4Prefix}, prefixBatchSize)
 	handleWhileAWriteIsBlocked(t, store, h,
 		[]*ristypes.RISMessage{prefixAnnouncement(fill)},
@@ -673,7 +472,7 @@ func TestASHandlerHandlesMessagesWhileAWriteIsBlocked(t *testing.T) {
 	t.Parallel()
 	store := newBlockingStore()
-	h := newASHandler(store, logger.New(), longerThanAnyTest)
+	h := NewASHandler(store, logger.New())
 	fill := ristypes.ASPath{Sequence: slices.Repeat([]int{testASNA}, asnBatchSize)}
 	handleWhileAWriteIsBlocked(t, store, h,
 		[]*ristypes.RISMessage{{Path: fill}},
@@ -694,7 +493,7 @@ func TestPeerHandlerHandlesMessagesWhileAWriteIsBlocked(t *testing.T) {
 	const otherPeerIP = "2001:db8:ffff::2"
 	store := newBlockingStore()
-	h := newPeerHandler(store, logger.New(), longerThanAnyTest)
+	h := NewPeerHandler(store, logger.New())
 	handleWhileAWriteIsBlocked(t, store, h,
 		slices.Repeat([]*ristypes.RISMessage{{Peer: testPeerIP}}, peerBatchSize),
 		&ristypes.RISMessage{Peer: otherPeerIP})
@@ -714,7 +513,7 @@ func TestPrefixHandlerWaitsAtTheMaximumBatchSize(t *testing.T) {
 	const extraPrefix = "198.51.100.0/24"
 	store := newBlockingStore()
-	h := NewPrefixHandler(store, logger.New(), routetable.New(routetable.Params{}))
+	h := NewPrefixHandler(store, logger.New())
 	fill := slices.Repeat([]string{testV4Prefix}, prefixBatchSize)
 	toMax := slices.Repeat([]string{testV4Prefix}, prefixBatchMaxSize)
 	handleAtMaxBatchSize(t, store, h,
@@ -735,7 +534,7 @@ func TestASHandlerWaitsAtTheMaximumBatchSize(t *testing.T) {
 	t.Parallel()
 	store := newBlockingStore()
-	h := newASHandler(store, logger.New(), longerThanAnyTest)
+	h := NewASHandler(store, logger.New())
 	fill := ristypes.ASPath{Sequence: slices.Repeat([]int{testASNA}, asnBatchSize)}
 	toMax := ristypes.ASPath{Sequence: slices.Repeat([]int{testASNA}, asnBatchMaxSize)}
 	handleAtMaxBatchSize(t, store, h,
@@ -752,17 +551,13 @@ func TestASHandlerWaitsAtTheMaximumBatchSize(t *testing.T) {
 	}
 }
 // TestPeerHandlerWaitsAtTheMaximumBatchSize must not have its flush timer fire.
 // A timer flush during the fill would take only part of it. The batch would
 // then reach its maximum size before the test's last message, and the test
 // would hang.
 func TestPeerHandlerWaitsAtTheMaximumBatchSize(t *testing.T) {
 	t.Parallel()
 	const otherPeerIP = "2001:db8:ffff::2"
 	store := newBlockingStore()
-	h := newPeerHandler(store, logger.New(), longerThanAnyTest)
+	h := NewPeerHandler(store, logger.New())
 	message := []*ristypes.RISMessage{{Peer: testPeerIP}}
 	handleAtMaxBatchSize(t, store, h,
 		slices.Repeat(message, peerBatchSize),
@@ -795,10 +590,7 @@ func TestHandlersWakeTheFlushGoroutineWhenTheBatchIsFull(t *testing.T) {
 			name:      "prefix",
 			batchSize: prefixBatchSize,
 			handle: func(n int) chan struct{} {
-				h := &PrefixHandler{
+				h := &PrefixHandler{batchFullCh: make(chan struct{}, 1)}
 					batchFullCh: make(chan struct{}, 1),
 					table:       routetable.New(routetable.Params{}),
 				}
 				h.HandleMessage(prefixAnnouncement(
 					slices.Repeat([]string{testV4Prefix}, n)))
@@ -37,8 +37,8 @@ const (
 // PeerHandler tracks BGP peers from UPDATE messages using batched operations.
 // It maintains a queue of peer updates and periodically flushes them to the database
-// in batches to improve performance. The handler writes one row per peer IP
+// in batches to improve performance. The handler deduplicates peer updates within
-// address for each batch, with the earliest and the latest time of its updates.
+// each batch, keeping only the most recent update for each peer IP address.
 type PeerHandler struct {
 	db     database.Store
 	logger *logger.Logger
@@ -56,6 +56,7 @@ type PeerHandler struct {
 	// is &mu.
 	batchTaken  sync.Cond
 	batchFullCh chan struct{} // wakes the flush goroutine when peerBatch is full
 	lastFlush   time.Time     // used only by the flush goroutine
 	// stopCh hands Stop's context to the flush goroutine. It holds one, so
 	// Stop does not wait for a write in progress to hand it over.
 	stopCh chan context.Context
@@ -74,27 +75,19 @@ type peerUpdate struct {
 // periodically flushes accumulated peer updates to the database. The handler
 // should be stopped by calling Stop when it is no longer needed.
 func NewPeerHandler(db database.Store, logger *logger.Logger) *PeerHandler {
 	return newPeerHandler(db, logger, peerBatchTimeout)
 }
 // newPeerHandler is NewPeerHandler with the flush timer's interval,
 // batchTimeout, in place of peerBatchTimeout. A test that the timer must not
 // disturb gives an interval longer than the test runs.
 func newPeerHandler(
 	db database.Store, logger *logger.Logger, batchTimeout time.Duration,
 ) *PeerHandler {
 	h := &PeerHandler{
 		db:          db,
 		logger:      logger,
 		peerBatch:   make([]peerUpdate, 0, peerBatchSize),
 		batchFullCh: make(chan struct{}, 1),
 		lastFlush:   time.Now(),
 		stopCh:      make(chan context.Context, 1),
 		done:        make(chan struct{}),
 	}
 	h.batchTaken.L = &h.mu
 	// Start the flush timer goroutine
-	go flushLoop(batchTimeout, h.batchFullCh, h.stopCh, h.done, h.flushBatch)
+	go h.flushLoop()
 	return h
 }
@@ -180,6 +173,33 @@ func (h *PeerHandler) Stop(ctx context.Context) {
 	}
 }
 // flushLoop runs in a goroutine, the only one that writes the batch: it
 // flushes when the batch is full, periodically, and once more on Stop.
 func (h *PeerHandler) flushLoop() {
 	defer close(h.done)
 	ticker := time.NewTicker(peerBatchTimeout)
 	defer ticker.Stop()
 	for {
 		select {
 		case <-ticker.C:
 			if time.Since(h.lastFlush) >= peerBatchTimeout {
 				h.flushBatch()
 			}
 		case <-h.batchFullCh:
 			h.flushBatch()
 		case ctx := <-h.stopCh:
 			// Final flush, unless the stop deadline has passed
 			if ctx.Err() == nil {
 				h.flushBatch()
 			}
 			return
 		}
 	}
 }
 // takeBatch returns the pending updates and leaves an empty batch in their
 // place for HandleMessage to fill. They count in writing until flushBatch has
 // written them.
@@ -207,31 +227,36 @@ func (h *PeerHandler) flushBatch() {
 		return
 	}
-	// The earliest and the latest time the batch saw each peer, with the peer
+	// Deduplicate by peer IP, keeping the latest update for each peer
-	// AS and message type of its latest update. The batch holds several
+	peerMap := make(map[string]peerUpdate)
 	// updates for a peer, so a new peer is stored first seen at the earliest of
 	// them and last seen at the latest.
 	peers := make(map[string]database.PeerUpdate)
 	for _, update := range batch {
-		peer, ok := peers[update.peerIP]
+		existing, ok := peerMap[update.peerIP]
-		if !ok || update.timestamp.After(peer.Seen.Last) {
+		if !ok || update.timestamp.After(existing.timestamp) {
-			peer.PeerIP = update.peerIP
+			peerMap[update.peerIP] = update
-			peer.PeerASN = update.peerASN
+		}
 			peer.MessageType = update.messageType
 	}
-		peer.Seen.Add(update.timestamp)
+	// Convert to database format
-		peers[update.peerIP] = peer
+	dbPeerMap := make(map[string]database.PeerUpdate)
 	for peerIP, update := range peerMap {
 		dbPeerMap[peerIP] = database.PeerUpdate{
 			PeerIP:      update.peerIP,
 			PeerASN:     update.peerASN,
 			MessageType: update.messageType,
 			Timestamp:   update.timestamp,
 		}
 	}
 	// Process all peers in a single batch transaction
-	err := h.db.UpdatePeerBatch(peers)
+	err := h.db.UpdatePeerBatch(dbPeerMap)
 	if err != nil {
 		h.logger.Error("Failed to process peer batch",
-			"error", err, "count", len(peers))
+			"error", err, "count", len(dbPeerMap))
 	}
 	h.mu.Lock()
 	h.writing = 0
 	h.mu.Unlock()
 	h.lastFlush = time.Now()
 }
@@ -1,59 +0,0 @@
 package routewatch
 import (
 	"testing"
 	"git.eeqj.de/sneak/routewatch/internal/database"
 	"git.eeqj.de/sneak/routewatch/internal/logger"
 )
 // peerBatchStore keeps the peers of the last UpdatePeerBatch call. The
 // database has no read of the peer table, so the peer handler's test checks
 // what the handler writes.
 type peerBatchStore struct {
 	*mockStore
 	peers map[string]database.PeerUpdate
 }
 func (s *peerBatchStore) UpdatePeerBatch(
 	peers map[string]database.PeerUpdate,
 ) error {
 	s.peers = peers
 	return nil
 }
 // TestPeerHandlerWritesTheEarliestAndLatestTimesOfANewPeer handles two updates
 // from one peer, the second 5 seconds after the first, in one batch. The peer
 // handler writes the peer first seen at the time of the first update and last
 // seen at the time of the second.
 func TestPeerHandlerWritesTheEarliestAndLatestTimesOfANewPeer(t *testing.T) {
 	t.Parallel()
 	store := &peerBatchStore{mockStore: newMockStore()}
 	// Built without NewPeerHandler's flush goroutine, so the test flushes
 	// itself.
 	h := &PeerHandler{db: store, logger: logger.New()}
 	first := peerAnnouncement(testPeerIP, testV4Prefix)
 	second := peerAnnouncement(testPeerIP, testV4Prefix)
 	second.ParsedTimestamp = first.ParsedTimestamp.Add(secondUpdateAfter)
 	h.HandleMessage(first)
 	h.HandleMessage(second)
 	h.flushBatch()
 	seen := store.peers[testPeerIP].Seen
 	if !seen.First.Equal(first.ParsedTimestamp) {
 		t.Errorf("first_seen of peer %s = %s, want %s", testPeerIP,
 			seen.First, first.ParsedTimestamp)
 	}
 	if !seen.Last.Equal(second.ParsedTimestamp) {
 		t.Errorf("last_seen of peer %s = %s, want %s", testPeerIP,
 			seen.Last, second.ParsedTimestamp)
 	}
 }
@@ -42,11 +42,10 @@ type PeeringHandler struct {
 	db     database.Store
 	logger *logger.Logger
-	// In-memory AS path tracking: each path, JSON-encoded, with the earliest
+	// In-memory AS path tracking
 	// and the latest time an update carried it.
 	mu           sync.Mutex
-	asPaths      map[string]database.SeenTimes
+	asPaths      map[string]time.Time // key is JSON-encoded AS path
-	droppedPaths int // paths dropped since the last run because the map was full
+	droppedPaths int                  // paths dropped because the map was full
 	// writing is how many paths processPeerings took from asPaths and has
 	// not finished writing the peerings of.
 	writing int
@@ -62,25 +61,16 @@ type PeeringHandler struct {
 // periodically processes accumulated AS paths into peering records. The
 // handler begins processing immediately upon creation.
 func NewPeeringHandler(db database.Store, logger *logger.Logger) *PeeringHandler {
 	return newPeeringHandler(db, logger, peeringProcessInterval)
 }
 // newPeeringHandler is NewPeeringHandler with the processing timer's interval,
 // processInterval, in place of peeringProcessInterval. A test gives a short
 // one to have the timer start a write.
 func newPeeringHandler(
 	db database.Store, logger *logger.Logger, processInterval time.Duration,
 ) *PeeringHandler {
 	h := &PeeringHandler{
 		db:      db,
 		logger:  logger,
-		asPaths: make(map[string]database.SeenTimes),
+		asPaths: make(map[string]time.Time),
 		stopCh:  make(chan context.Context, 1),
 		done:    make(chan struct{}),
 	}
 	// Start the periodic processing goroutine
-	go h.processLoop(processInterval)
+	go h.processLoop()
 	return h
 }
@@ -128,18 +118,16 @@ func (h *PeeringHandler) HandleMessage(msg *ristypes.RISMessage) {
 	key := string(pathJSON)
 	h.mu.Lock()
-	defer h.mu.Unlock()
+	if _, exists := h.asPaths[key]; exists {
-
+		// Already tracked: refresh its timestamp.
-	seen, exists := h.asPaths[key]
+		h.asPaths[key] = timestamp
-	if !exists && len(h.asPaths) >= maxTrackedPaths {
+	} else if len(h.asPaths) >= maxTrackedPaths {
 		// Map is full; drop this new path and count it.
 		h.droppedPaths++
-
+	} else {
-		return
+		h.asPaths[key] = timestamp
 	}
-
+	h.mu.Unlock()
 	seen.Add(timestamp)
 	h.asPaths[key] = seen
 }
 // ProcessPeeringsNow triggers immediate processing of all accumulated AS
@@ -172,29 +160,15 @@ func (h *PeeringHandler) Stop(ctx context.Context) {
 	}
 }
-// processLoop processes AS paths into peerings every processInterval, and once
+// processLoop runs periodically to process AS paths into peerings, and once
 // more on Stop.
-func (h *PeeringHandler) processLoop(processInterval time.Duration) {
+func (h *PeeringHandler) processLoop() {
 	defer close(h.done)
-	ticker := time.NewTicker(processInterval)
+	ticker := time.NewTicker(peeringProcessInterval)
 	defer ticker.Stop()
 	for {
 		// Stop goes first. A write can run past the stop deadline while a
 		// tick waits beside Stop's context. The select below picks one of
 		// them at random, but past the deadline no write may start.
 		select {
 		case ctx := <-h.stopCh:
 			// Final processing, unless the stop deadline has passed
 			if ctx.Err() == nil {
 				h.processPeerings()
 			}
 			return
 		default:
 		}
 		select {
 		case <-ticker.C:
 			h.processPeerings()
@@ -213,14 +187,12 @@ func (h *PeeringHandler) processLoop(processInterval time.Duration) {
 func (h *PeeringHandler) processPeerings() {
 	// Take the accumulated paths and replace the map with a fresh empty one
 	// under the lock. Each path is processed exactly once and the memory is
-	// released, so the map never grows past a single interval's traffic. The
+	// released, so the map never grows past a single interval's traffic.
 	// count of dropped paths starts again with the new map.
 	h.mu.Lock()
 	paths := h.asPaths
-	h.asPaths = make(map[string]database.SeenTimes)
+	h.asPaths = make(map[string]time.Time)
 	h.writing = len(paths)
 	dropped := h.droppedPaths
 	h.droppedPaths = 0
 	h.mu.Unlock()
 	if len(paths) == 0 {
@@ -232,13 +204,9 @@ func (h *PeeringHandler) processPeerings() {
 		low, high int
 	}
-	// The earliest and the latest time an update carried each peering. Several
+	peerings := make(map[peeringKey]time.Time)
 	// paths, each carried at several times, can hold a peering, so a new
 	// peering is stored first seen at the earliest of them and last seen at the
 	// latest.
 	peerings := make(map[peeringKey]database.SeenTimes)
-	for pathJSON, pathSeen := range paths {
+	for pathJSON, timestamp := range paths {
 		var path []int
 		err := json.Unmarshal([]byte(pathJSON), &path)
@@ -265,11 +233,10 @@ func (h *PeeringHandler) processPeerings() {
 			}
 			key := peeringKey{low: low, high: high}
-
+			// Update timestamp if this is newer
-			seen := peerings[key]
+			if existing, ok := peerings[key]; !ok || timestamp.After(existing) {
-			seen.Add(pathSeen.First)
+				peerings[key] = timestamp
-			seen.Add(pathSeen.Last)
+			}
 			peerings[key] = seen
 		}
 	}
@@ -277,8 +244,8 @@ func (h *PeeringHandler) processPeerings() {
 	start := time.Now()
 	successCount := 0
-	for key, seen := range peerings {
+	for key, ts := range peerings {
-		err := h.db.RecordPeering(key.low, key.high, seen)
+		err := h.db.RecordPeering(key.low, key.high, ts)
 		if err != nil {
 			h.logger.Error("Failed to record peering",
 				"as_a", key.low,
@@ -31,14 +31,12 @@ type recordingStore struct {
 	calls int
 }
-func (r *recordingStore) RecordPeering(
+func (r *recordingStore) RecordPeering(asA, asB int, ts time.Time) error {
 	asA, asB int, seen database.SeenTimes,
 ) error {
 	r.mu.Lock()
 	r.calls++
 	r.mu.Unlock()
-	return r.mockStore.RecordPeering(asA, asB, seen)
+	return r.mockStore.RecordPeering(asA, asB, ts)
 }
 func (r *recordingStore) callCount() int {
@@ -54,7 +52,7 @@ func newTestHandler(db database.Store) *PeeringHandler {
 	return &PeeringHandler{
 		db:      db,
 		logger:  logger.New(),
-		asPaths: make(map[string]database.SeenTimes),
+		asPaths: make(map[string]time.Time),
 	}
 }
@@ -153,43 +151,6 @@ func TestPeeringHandlerLeavesATrailingASSetOutOfThePeerings(t *testing.T) {
 	}
 }
 // TestPeeringHandlerRecordsNothingFromAPathWithASZero handles AS paths that
 // hold AS 0. RFC 7607 makes such a path malformed, so no peering is recorded
 // from it, not even one between two other ASes of the path.
 func TestPeeringHandlerRecordsNothingFromAPathWithASZero(t *testing.T) {
 	t.Parallel()
 	tests := []struct {
 		name string
 		path []any
 	}{
 		{name: "AS 0 between two ASes", path: []any{testASNA, 0, testASNB}},
 		{
 			name: "AS 0 after two ASes",
 			path: []any{testASNA, testASNB, 0, testASNC},
 		},
 	}
 	for _, tt := range tests {
 		t.Run(tt.name, func(t *testing.T) {
 			t.Parallel()
 			store := newMockStore()
 			h := newTestHandler(store)
 			h.HandleMessage(&ristypes.RISMessage{
 				Path:            decodePath(t, tt.path...),
 				ParsedTimestamp: time.Now().UTC(),
 			})
 			h.ProcessPeeringsNow()
 			if len(store.Peerings) > 0 {
 				t.Errorf("peerings recorded = %v, want none",
 					slices.Sorted(maps.Keys(store.Peerings)))
 			}
 		})
 	}
 }
 // TestPeeringHandlerProcessesEachRunAndEmpties verifies that a processing run
 // empties the path map (the swap) and that a path seen again after a run is
 // recorded in the next run too.
@@ -259,10 +220,10 @@ func TestPeeringHandlerCapDropsAndCounts(t *testing.T) {
 	existing := pathKey(t, testASNA, testASNB)
 	h.mu.Lock()
-	h.asPaths[existing] = database.SeenTimes{First: now, Last: now}
+	h.asPaths[existing] = now
 	for i := 0; len(h.asPaths) < maxTrackedPaths; i++ {
-		h.asPaths[strconv.Itoa(i)] = database.SeenTimes{First: now, Last: now}
+		h.asPaths[strconv.Itoa(i)] = now
 	}
 	h.mu.Unlock()
@@ -292,83 +253,11 @@ func TestPeeringHandlerCapDropsAndCounts(t *testing.T) {
 	}
 	h.mu.Lock()
-	gotSeen := h.asPaths[existing]
+	gotTS := h.asPaths[existing]
 	h.mu.Unlock()
-	if !gotSeen.Last.Equal(refreshed) {
+	if !gotTS.Equal(refreshed) {
-		t.Fatalf("existing path last seen not refreshed: want %v, got %v",
+		t.Fatalf("existing path timestamp not refreshed: want %v, got %v",
-			refreshed, gotSeen.Last)
+			refreshed, gotTS)
 	}
 }
 // TestPeeringHandlerRunResetsTheDroppedCount fills the map, has the handler
 // drop one path, and runs the processing. The count of dropped paths is the
 // run's own, so it is 0 again after the run.
 func TestPeeringHandlerRunResetsTheDroppedCount(t *testing.T) {
 	t.Parallel()
 	h := newTestHandler(newMockStore())
 	now := time.Now().UTC()
 	// Paths of one AS carry no peering, so the run records nothing.
 	h.mu.Lock()
 	for asn := 1; len(h.asPaths) < maxTrackedPaths; asn++ {
 		h.asPaths[pathKey(t, asn)] = database.SeenTimes{First: now, Last: now}
 	}
 	h.mu.Unlock()
 	handle(h, now, testASNA, testASNB)
 	if _, dropped := snapshot(h); dropped != 1 {
 		t.Fatalf("want dropped count 1 with the map full, got %d", dropped)
 	}
 	h.ProcessPeeringsNow()
 	if _, dropped := snapshot(h); dropped != 0 {
 		t.Errorf("want dropped count 0 after a run, got %d", dropped)
 	}
 }
 // TestPeeringHandlerStoresTheEarliestAndLatestTimesOfANewPeering handles two
 // updates whose path carries a peering the database does not hold yet, the
 // second 5 seconds after the first, in one run into a real database. The
 // peering is stored first seen at the time of the first update and last seen
 // at the time of the second.
 func TestPeeringHandlerStoresTheEarliestAndLatestTimesOfANewPeering(
 	t *testing.T,
 ) {
 	t.Parallel()
 	db := newTestDatabase(t)
 	h := newTestHandler(db)
 	first := peerAnnouncement(testPeerIP, testV4Prefix)
 	second := peerAnnouncement(testPeerIP, testV4Prefix)
 	second.ParsedTimestamp = first.ParsedTimestamp.Add(secondUpdateAfter)
 	h.HandleMessage(first)
 	h.HandleMessage(second)
 	h.ProcessPeeringsNow()
 	peers, err := db.GetASPeers(testASNA)
 	if err != nil {
 		t.Fatalf("GetASPeers(%d): %v", testASNA, err)
 	}
 	if len(peers) != 1 || peers[0].ASN != testASNB {
 		t.Fatalf("peers of AS%d = %+v, want AS%d alone", testASNA, peers,
 			testASNB)
 	}
 	if !peers[0].FirstSeen.Equal(first.ParsedTimestamp) {
 		t.Errorf("first_seen of peering AS%d-AS%d = %s, want %s", testASNA,
 			testASNB, peers[0].FirstSeen, first.ParsedTimestamp)
 	}
 	if !peers[0].LastSeen.Equal(second.ParsedTimestamp) {
 		t.Errorf("last_seen of peering AS%d-AS%d = %s, want %s", testASNA,
 			testASNB, peers[0].LastSeen, second.ParsedTimestamp)
 	}
 }
@@ -2,8 +2,10 @@ package routewatch
 import (
 	"context"
 	"net"
 	"net/netip"
 	"slices"
 	"strings"
 	"sync"
 	"time"
@@ -11,7 +13,6 @@ import (
 	"git.eeqj.de/sneak/routewatch/internal/logger"
 	"git.eeqj.de/sneak/routewatch/internal/metrics"
 	"git.eeqj.de/sneak/routewatch/internal/ristypes"
 	"git.eeqj.de/sneak/routewatch/internal/routetable"
 )
 const (
@@ -26,71 +27,63 @@ const (
 	prefixBatchSize = 25000
 	// prefixBatchMaxSize is the most prefix updates the batch holds while the
-	// flush goroutine writes the previous one: ten batches, about 15 MiB
+	// flush goroutine writes the previous one: ten batches, about 60 MiB
 	// (README "Memory"). At this size HandleMessage waits until the flush
-	// goroutine takes the batch.
+	// goroutine takes the batch. On top of these, the handler holds at most
 	// prefixBatchSize updates, about 6 MiB, that a flush kept for the peers
 	// whose route delete failed (held).
 	prefixBatchMaxSize = 250000
 	// prefixBatchTimeout is the maximum time to wait before flushing a batch
 	// DO NOT reduce this timeout - larger batches are more efficient
 	prefixBatchTimeout = 1 * time.Second
-	// maxTableChangesPerWrite is the most changed prefix and origin AS pairs
+	// IP version constants
-	// of the routing table that one flush writes; the rest wait for the next
+	ipv4Version = 4
-	// flushes. The change of one pair takes about 430 bytes of memory and 15
+	ipv6Version = 6
 	// microseconds to write. So a write holds about 9 MB and takes about a
 	// third of the one-second flush interval, which leaves the rest to the
 	// batch. The feed peaks at about 5,000 updates a second, each changing at
 	// most one pair. So the million pairs that a full-table peer's session
 	// going down changes are written in about a minute.
 	maxTableChangesPerWrite = 20000
 )
-// PrefixHandler keeps the routing table in memory current from the feed. It
+// PrefixHandler tracks BGP prefixes and maintains a live routing table in the
-// applies each update to the table as it handles it. An announcement gives
+// database. Routes are added on announcement and deleted on withdrawal, and all
-// the peer a route to the prefix. A withdrawal removes the peer's route, as
+// routes of a peer are deleted when its BGP session goes down.
 // does an announcement whose AS path is empty or holds AS 0 anywhere. A peer
 // whose BGP session goes down leaves every prefix.
 //
 // Each flush writes the table's changes to the database. It also stores each
 // prefix the updates name with the time it was first seen.
 type PrefixHandler struct {
 	db      database.Store
 	logger  *logger.Logger
 	metrics *metrics.Tracker
 	table   *routetable.Table
-	// Batching. mu guards batch, writing and writingTableChanges only: the
+	// Batching. mu guards batch, held, peersDown, writing and deleting only:
-	// flush goroutine takes them under mu and writes them after releasing
+	// the flush goroutine takes them under mu and writes them after releasing
 	// mu, so HandleMessage waits for a database write only while batch is at
 	// prefixBatchMaxSize.
 	mu    sync.Mutex
-	batch []seenPrefix
+	batch []prefixUpdate
 	// held holds the updates that the peers whose route delete failed in the
 	// last flush sent after their session went down, for the next flush to
 	// write after it retries the delete. They are not in batch, so they do
 	// not count toward a full batch: a delete that keeps failing is retried
 	// at the pace of the flush timer.
 	held []prefixUpdate
 	// peersDown holds, each once, the peers whose BGP session went down
 	// since the batch was taken, and those whose route delete failed in the
 	// last flush.
 	peersDown []string
 	// writing is how many updates the flush goroutine took and has not
 	// finished writing.
 	writing int
-	// writingTableChanges is how many changes the flush goroutine took from
+	// deleting is how many peers from peersDown the flush goroutine took and
-	// the routing table and has not finished writing.
+	// has not yet deleted the routes of.
-	writingTableChanges int
+	deleting int
 	// batchTaken is signalled when the flush goroutine takes batch; its L is
 	// &mu.
 	batchTaken  sync.Cond
 	batchFullCh chan struct{} // wakes the flush goroutine when batch is full
 	lastFlush   time.Time     // used only by the flush goroutine
 	// stopCh hands Stop's context to the flush goroutine. It holds one, so
 	// Stop does not wait for a write in progress to hand it over.
 	stopCh chan context.Context
 	done   chan struct{} // closed when the flush goroutine returns
 }
 // seenPrefix is what the batch keeps of an update: the prefix it names and its
 // time. A flush needs only these to store each new prefix's first-seen time.
 type seenPrefix struct {
 	prefix    string
 	timestamp time.Time
 }
 // prefixUpdate is one prefix of an update message, as applyToTable applies it
 // to the routing table.
 type prefixUpdate struct {
 	prefix      string
 	originASN   int
@@ -103,45 +96,21 @@ type prefixUpdate struct {
 	endsInSet bool
 }
-// announcesRoute says whether u gives the peer a route to the prefix: an
+// NewPrefixHandler creates a new batched prefix tracking handler
-// announcement whose path gives an origin, or ends in an AS set of several
+func NewPrefixHandler(db database.Store, logger *logger.Logger) *PrefixHandler {
 // members, which gives origin 0 (none). Any other update removes the peer's
 // route for the prefix: a withdrawal, or an announcement whose path is empty
 // or holds AS 0 anywhere (the decoder empties such a path). Such an
 // announcement replaces the peer's route, as any announcement does, with none
 // (RFC 7607 treats AS 0 in a path as a withdrawal).
 func (u prefixUpdate) announcesRoute() bool {
 	return u.messageType == "announcement" && (u.originASN > 0 || u.endsInSet)
 }
 // NewPrefixHandler creates a new batched prefix tracking handler, which applies
 // the updates to table, the routing table read from db at startup.
 func NewPrefixHandler(
 	db database.Store, logger *logger.Logger, table *routetable.Table,
 ) *PrefixHandler {
 	return newPrefixHandler(db, logger, table, prefixBatchTimeout)
 }
 // newPrefixHandler is NewPrefixHandler with the flush timer's interval,
 // batchTimeout, in place of prefixBatchTimeout. A test that the timer must not
 // disturb gives an interval longer than the test runs.
 func newPrefixHandler(
 	db database.Store, logger *logger.Logger, table *routetable.Table,
 	batchTimeout time.Duration,
 ) *PrefixHandler {
 	h := &PrefixHandler{
 		db:          db,
 		logger:      logger,
-		table:       table,
+		batch:       make([]prefixUpdate, 0, prefixBatchSize),
 		batch:       make([]seenPrefix, 0, prefixBatchSize),
 		batchFullCh: make(chan struct{}, 1),
 		lastFlush:   time.Now(),
 		stopCh:      make(chan context.Context, 1),
 		done:        make(chan struct{}),
 	}
 	h.batchTaken.L = &h.mu
 	// Start the flush timer goroutine
-	go flushLoop(batchTimeout, h.batchFullCh, h.stopCh, h.done, h.flushBatch)
+	go h.flushLoop()
 	return h
 }
@@ -170,7 +139,7 @@ func (h *PrefixHandler) QueueCapacity() int {
 func (h *PrefixHandler) HandleMessage(msg *ristypes.RISMessage) {
 	if msg.Type == ristypes.MessageTypeState {
 		if msg.State == ristypes.StateDown {
-			h.table.PeerDown(msg.Peer)
+			h.peerSessionDown(msg.Peer)
 		}
 		return
@@ -195,21 +164,18 @@ func (h *PrefixHandler) HandleMessage(msg *ristypes.RISMessage) {
 		h.batchTaken.Wait()
 	}
-	// Withdrawals are applied to the routing table before announcements, so
+	// Withdrawals are queued before announcements, because the batch keeps
-	// a message that lists a prefix as both withdrawn and announced keeps the
+	// each peer's last update for a prefix: a message that lists a prefix as
-	// route (RFC 4271 section 4.3). A withdrawal names only the prefix and
+	// both withdrawn and announced keeps the route (RFC 4271 section 4.3).
-	// peer: the message's AS path, and so its origin AS, belongs to the
+	// A withdrawal names only the prefix and peer: the message's AS path, and
-	// announced prefixes.
+	// so its origin AS, belongs to the announced prefixes.
 	for _, prefix := range msg.Withdrawals {
-		update := prefixUpdate{
+		h.batch = append(h.batch, prefixUpdate{
 			prefix:      canonicalPrefix(prefix),
 			peer:        msg.Peer,
 			messageType: "withdrawal",
 			timestamp:   timestamp,
-		}
+		})
 		h.batch = append(h.batch, seenPrefix{update.prefix, update.timestamp})
 		h.applyToTable(update)
 		// Record withdrawal in metrics
 		if h.metrics != nil {
 			h.metrics.RecordWithdrawal()
@@ -218,7 +184,7 @@ func (h *PrefixHandler) HandleMessage(msg *ristypes.RISMessage) {
 	for _, announcement := range msg.Announcements {
 		for _, prefix := range announcement.Prefixes {
-			update := prefixUpdate{
+			h.batch = append(h.batch, prefixUpdate{
 				prefix:      canonicalPrefix(prefix),
 				originASN:   originASN,
 				peer:        msg.Peer,
@@ -226,10 +192,7 @@ func (h *PrefixHandler) HandleMessage(msg *ristypes.RISMessage) {
 				timestamp:   timestamp,
 				path:        path,
 				endsInSet:   len(msg.Path.Set) > 0,
-			}
+			})
 			h.batch = append(h.batch, seenPrefix{update.prefix, update.timestamp})
 			h.applyToTable(update)
 			// Record announcement in metrics
 			if h.metrics != nil {
 				h.metrics.RecordAnnouncement()
@@ -248,13 +211,12 @@ func (h *PrefixHandler) HandleMessage(msg *ristypes.RISMessage) {
 	}
 }
-// Stop stops the flush goroutine, which makes one last flush before it returns,
+// Stop stops the flush goroutine, which writes the updates and peer downs the
-// and waits for it until ctx ends. That flush writes at most
+// handler holds before it returns, and waits for it until ctx ends. Once ctx
-// maxTableChangesPerWrite of the routing table's changes, and the prefixes of
+// has ended the flush goroutine skips that last write, and a write still
-// the updates the handler holds. Once ctx has ended the flush goroutine skips
+// running is lost when the process exits. A peer whose route delete fails in
-// that last flush, and a write still running is lost when the process exits. A
+// the last write is not retried either. Stop logs how many updates are not
-// failed write of the table's changes is not retried either. Stop logs how many
+// written and how many peer downs have not had their routes deleted.
 // updates and how many of the table's changes are not written.
 func (h *PrefixHandler) Stop(ctx context.Context) {
 	h.stopCh <- ctx
@@ -264,156 +226,335 @@ func (h *PrefixHandler) Stop(ctx context.Context) {
 	}
 	h.mu.Lock()
-	unwritten := h.writing + len(h.batch)
+	unwritten := h.writing + len(h.batch) + len(h.held)
-	tableChanges := h.writingTableChanges + h.table.ChangeCount()
+	peersDown := h.deleting + len(h.peersDown)
 	h.mu.Unlock()
-	if unwritten == 0 && tableChanges == 0 {
+	if unwritten == 0 && peersDown == 0 {
 		return
 	}
 	if ctx.Err() != nil {
 		h.logger.Error("Stop deadline passed before the prefix handler wrote "+
-			"its updates", "updates", unwritten, "table_changes", tableChanges)
+			"its updates", "updates", unwritten, "peers_down", peersDown)
 		return
 	}
-	h.logger.Error("The prefix handler stopped before it wrote everything",
+	h.logger.Error("The prefix handler stopped without deleting the routes "+
-		"updates", unwritten, "table_changes", tableChanges)
+		"of peers whose session went down", "updates", unwritten,
 		"peers_down", peersDown)
 }
-// takeBatch returns the pending updates and leaves an empty batch in their
+// peerSessionDown notes that the peer's BGP session went down, so that the next
-// place for HandleMessage to fill. The updates count in writing until
+// flush deletes all of the peer's live routes before it writes the batch. The
-// flushBatch has written them.
+// peer's updates still in the batch or held came before the down, which
-func (h *PrefixHandler) takeBatch() []seenPrefix {
+// replaces them, so they are dropped; updates the peer sends later stay in the
 // batch and are written after the delete. A peer already in peersDown is not
 // added again: one delete removes all of its routes.
 func (h *PrefixHandler) peerSessionDown(peer string) {
 	h.mu.Lock()
 	defer h.mu.Unlock()
-	if len(h.batch) == 0 {
+	isPeers := func(update prefixUpdate) bool { return update.peer == peer }
-		return nil
+	h.batch = slices.DeleteFunc(h.batch, isPeers)
 	h.held = slices.DeleteFunc(h.held, isPeers)
 	if !slices.Contains(h.peersDown, peer) {
 		h.peersDown = append(h.peersDown, peer)
 	}
 }
 // flushLoop runs in a goroutine, the only one that writes the batch: it
 // flushes when the batch is full, periodically, and once more on Stop.
 func (h *PrefixHandler) flushLoop() {
 	defer close(h.done)
 	ticker := time.NewTicker(prefixBatchTimeout)
 	defer ticker.Stop()
 	for {
 		select {
 		case <-ticker.C:
 			if time.Since(h.lastFlush) >= prefixBatchTimeout {
 				h.flushBatch()
 			}
 		case <-h.batchFullCh:
 			h.flushBatch()
 		case ctx := <-h.stopCh:
 			// Final flush, unless the stop deadline has passed
 			if ctx.Err() == nil {
 				h.flushBatch()
 			}
 			return
 		}
 	}
 }
 // takeBatch returns the pending updates, the held ones first, and the peers in
 // peersDown, and leaves an empty batch, no held updates and no peers in their
 // place for HandleMessage to fill. The updates count in writing until
 // flushBatch has written them, and the peers in deleting until their routes
 // are deleted.
 func (h *PrefixHandler) takeBatch() ([]prefixUpdate, []string) {
 	h.mu.Lock()
 	defer h.mu.Unlock()
 	if len(h.held) == 0 && len(h.batch) == 0 && len(h.peersDown) == 0 {
 		return nil, nil
 	}
 	batch, peersDown := h.batch, h.peersDown
 	if len(h.held) > 0 {
 		batch = slices.Concat(h.held, h.batch)
 	}
 	batch := h.batch
 	h.writing = len(batch)
-	h.batch = make([]seenPrefix, 0, prefixBatchSize)
+	h.deleting = len(peersDown)
 	h.held = nil
 	h.batch = make([]prefixUpdate, 0, prefixBatchSize)
 	h.peersDown = nil
 	h.batchTaken.Broadcast()
-	return batch
+	return batch, peersDown
 }
-// flushBatch writes the routing table's changes, then takes the pending batch
+// flushBatch takes the pending batch and writes it to the database, without
-// and stores the prefixes it names, without holding the mutex during the
+// holding the mutex during the write.
 // writes.
 func (h *PrefixHandler) flushBatch() {
-	h.writeTableChanges()
+	batch, peersDown := h.takeBatch()
-
+	if len(batch) == 0 && len(peersDown) == 0 {
 	batch := h.takeBatch()
 	if len(batch) == 0 {
 		return
 	}
 	startTime := time.Now()
 	batchSize := len(batch)
-	// Each prefix the batch names, announced or withdrawn, with the earliest
+	// The routes of a peer whose session went down are deleted first: the
-	// timestamp among its updates: the prefix tables store only first_seen,
+	// batch holds only the updates the peer sent after the down. A peer whose
-	// written when the prefix is new and never changed after.
+	// delete failed is kept, with those updates, for the next flush to retry.
-	prefixesToUpdate := make(map[string]time.Time)
+	failedPeers := h.deleteLiveRoutesOfPeers(peersDown)
 	if len(failedPeers) > 0 {
 		batch = h.keepForNextFlush(batch, failedPeers)
 	}
 	// For each prefix and peer, keep only the last update the feed delivered.
 	// Updates from different peers for the same prefix are all kept. Arrival
 	// order decides, not the timestamp: timestamps are whole seconds, so
 	// updates within one second carry the same one.
 	type prefixAndPeer struct{ prefix, peer string }
 	lastUpdates := make(map[prefixAndPeer]prefixUpdate)
 	for _, update := range batch {
 		lastUpdates[prefixAndPeer{update.prefix, update.peer}] = update
 	}
 	// Collect routes to upsert and delete
 	var (
 		routesToUpsert []*database.LiveRoute
 		routesToDelete []database.LiveRouteDeletion
 	)
 	// Collect unique prefixes to update
 	prefixesToUpdate := make(map[string]time.Time)
 	for _, update := range lastUpdates {
 		// Track prefix for both announcements and withdrawals
 		seen, exists := prefixesToUpdate[update.prefix]
-		if !exists || update.timestamp.Before(seen) {
+		if !exists || update.timestamp.After(seen) {
 			prefixesToUpdate[update.prefix] = update.timestamp
 		}
 		// An announcement is stored when its path gives an origin, or when it
 		// ends in an AS set of several members: that route is stored with
 		// origin 0 (none). An announcement with an empty path is not stored.
 		if update.messageType == "announcement" &&
 			(update.originASN > 0 || update.endsInSet) {
 			// Create live route for batch upsert
 			route := h.createLiveRoute(update)
 			if route != nil {
 				routesToUpsert = append(routesToUpsert, route)
 			}
 		} else if update.messageType == "withdrawal" {
 			// Parse CIDR to get IP version
 			_, ipVersion, err := parseCIDR(update.prefix)
 			if err != nil {
 				h.logger.Error("Failed to parse CIDR for withdrawal",
 					"prefix", update.prefix, "error", err)
 				continue
 			}
 			// Create deletion record for batch delete
 			routesToDelete = append(routesToDelete, database.LiveRouteDeletion{
 				Prefix:    update.prefix,
 				PeerIP:    update.peer,
 				IPVersion: ipVersion,
 			})
 		}
 	}
-	err := h.db.UpdatePrefixesBatch(prefixesToUpdate)
+	successCount := h.writeBatch(routesToUpsert, routesToDelete, prefixesToUpdate)
 	if err != nil {
 		h.logger.Error("Failed to update prefix batch",
 			"error", err, "count", len(prefixesToUpdate))
 	}
 	h.mu.Lock()
 	h.writing = 0
 	h.mu.Unlock()
 	elapsed := time.Since(startTime)
 	h.logger.Debug("Flushed prefix batch",
-		"batch_size", len(batch),
+		"batch_size", batchSize,
 		"peers_down", len(peersDown),
 		"unique_prefixes", len(prefixesToUpdate),
-		"duration_ms", time.Since(startTime).Milliseconds(),
+		"success", successCount,
 		"duration_ms", elapsed.Milliseconds(),
 	)
 	h.lastFlush = time.Now()
 }
-// applyToTable applies update to the routing table in memory: as an
+// deleteLiveRoutesOfPeers deletes all live routes of each of peers, the peers
-// announcement when it gives the peer a route, otherwise as a withdrawal. A
+// whose BGP session went down, and returns those whose delete failed. Most
-// prefix that does not parse is logged and left out. Each announcement counts
+// downs come from peers that have no routes, so only a delete that removed
-// in the IPv4 or IPv6 route update rate.
+// routes is logged. A peer whose delete succeeded no longer counts in deleting;
-func (h *PrefixHandler) applyToTable(update prefixUpdate) {
+// a failed one counts until keepForNextFlush puts it back in peersDown.
-	prefix, err := netip.ParsePrefix(update.prefix)
+func (h *PrefixHandler) deleteLiveRoutesOfPeers(peers []string) []string {
 	var failed []string
 	for _, peer := range peers {
 		deleted, err := h.db.DeleteLiveRoutesOfPeer(peer)
 		if err != nil {
-		h.logger.Error("Failed to parse prefix",
+			h.logger.Error(
-			"prefix", update.prefix, "error", err)
+				"Failed to delete the live routes of a peer whose session "+
 					"went down; the next flush retries",
 				"peer", peer, "routes_deleted", deleted, "error", err)
-		return
+			failed = append(failed, peer)
 			continue
 		}
 	if !update.announcesRoute() {
 		h.table.Withdraw(prefix, update.peer)
 		return
 	}
 	if h.metrics != nil {
 		if prefix.Addr().Is4() {
 			h.metrics.RecordIPv4Update()
 		} else {
 			h.metrics.RecordIPv6Update()
 		}
 	}
 	h.table.Announce(prefix, update.originASN, routetable.Route{
 		Peer:   update.peer,
 		ASPath: update.path,
 		Time:   update.timestamp,
 	})
 }
 // writeTableChanges writes at most maxTableChangesPerWrite changes of the
 // routing table in memory, and every peer the table numbered since the last
 // write.
 // When the write fails, they go back to the table, so that a later write writes
 // them again, each pair with its content then.
 func (h *PrefixHandler) writeTableChanges() {
 		h.mu.Lock()
-	changes, newPeers := h.table.TakeChanges(maxTableChangesPerWrite)
+		h.deleting--
 	h.writingTableChanges = len(changes)
 		h.mu.Unlock()
-	if len(changes) == 0 && len(newPeers) == 0 {
+		if deleted > 0 {
-		return
+			h.logger.Info(
 				"Deleted the live routes of a peer whose session went down",
 				"peer", peer, "routes", deleted)
 		}
 	}
-	err := h.db.WriteRouteChanges(changes, newPeers)
+	return failed
 }
 // keepForNextFlush puts the peers whose route delete failed back in peersDown,
 // and their updates from batch in held, so that the next flush retries each
 // delete before it writes the peer's updates; written now, they would be
 // deleted by the retry. The updates of a peer whose session went down again
 // since the batch was taken came before that down, so they are dropped, as
 // peerSessionDown drops them, and the peer is already in peersDown. It returns
 // the updates of the other peers, for this flush to write.
 //
 // While a delete keeps failing, the held updates would grow with every flush,
 // so only the last prefixBatchSize of them are kept and the older ones are
 // dropped. This never leaves in place a route the peer withdrew: a prefix with
 // a kept update keeps its last one, and the retry deletes all of the peer's
 // routes, so a prefix whose updates were all dropped has no route from the peer
 // until the peer announces it again.
 func (h *PrefixHandler) keepForNextFlush(
 	batch []prefixUpdate, failedPeers []string,
 ) []prefixUpdate {
 	var kept, toWrite []prefixUpdate
 	for _, update := range batch {
 		if slices.Contains(failedPeers, update.peer) {
 			kept = append(kept, update)
 		} else {
 			toWrite = append(toWrite, update)
 		}
 	}
 	h.mu.Lock()
 	defer h.mu.Unlock()
-	h.writingTableChanges = 0
+	kept = slices.DeleteFunc(kept, func(update prefixUpdate) bool {
 		return slices.Contains(h.peersDown, update.peer)
 	})
-	if err != nil {
+	if len(kept) > prefixBatchSize {
-		h.logger.Error("Failed to write the routing table's changes; the next "+
+		h.logger.Error(
-			"flush retries", "changes", len(changes), "new_peers", len(newPeers),
+			"Dropped the oldest updates of peers whose route delete failed",
-			"error", err)
+			"peers", failedPeers, "dropped", len(kept)-prefixBatchSize)
-		h.table.PutBackChanges(changes, newPeers)
+		// A copy, so that the dropped updates are freed.
 		kept = slices.Clone(kept[len(kept)-prefixBatchSize:])
 	}
 	// takeBatch left held empty, and only this flush fills it. The kept
 	// updates now count in held, not in writing, and the failed peers in
 	// peersDown, not in deleting.
 	h.held = kept
 	h.writing = len(toWrite)
 	h.deleting = 0
 	for _, peer := range failedPeers {
 		if !slices.Contains(h.peersDown, peer) {
 			h.peersDown = append(h.peersDown, peer)
 		}
 	}
 	return toWrite
 }
 // writeBatch writes the collected route upserts, route deletions and prefix
 // updates to the database and returns how many routes it wrote.
 func (h *PrefixHandler) writeBatch(
 	routesToUpsert []*database.LiveRoute,
 	routesToDelete []database.LiveRouteDeletion,
 	prefixesToUpdate map[string]time.Time,
 ) int {
 	successCount := 0
 	if len(routesToUpsert) > 0 {
 		err := h.db.UpsertLiveRouteBatch(routesToUpsert)
 		if err != nil {
 			h.logger.Error("Failed to upsert route batch",
 				"error", err, "count", len(routesToUpsert))
 		} else {
 			successCount += len(routesToUpsert)
 		}
 	}
 	if len(routesToDelete) > 0 {
 		err := h.db.DeleteLiveRouteBatch(routesToDelete)
 		if err != nil {
 			h.logger.Error("Failed to delete route batch",
 				"error", err, "count", len(routesToDelete))
 		} else {
 			successCount += len(routesToDelete)
 		}
 	}
 	// Update prefix tables
 	if len(prefixesToUpdate) > 0 {
 		err := h.db.UpdatePrefixesBatch(prefixesToUpdate)
 		if err != nil {
 			h.logger.Error("Failed to update prefix batch",
 				"error", err, "count", len(prefixesToUpdate))
 		}
 	}
 	return successCount
 }
 // canonicalPrefix returns prefix in the text form net/netip prints, the form
-// the prefix tables store and the IP lookup reads them in. The feed sends IPv6
+// the IP lookup builds when it looks a prefix up. The feed sends IPv6
 // announcements compressed ("2001:db8::/32") but IPv6 withdrawals uncompressed
-// ("2001:db8:0:0:0:0:0:0/32"). A prefix that does not parse is returned
+// ("2001:db8:0:0:0:0:0:0/32"); stored as received, a withdrawal would not match
-// unchanged, and applyToTable logs it.
+// the route its announcement stored. A prefix that does not parse is returned
 // unchanged, and the batch flush reports it.
 func canonicalPrefix(prefix string) string {
 	p, err := netip.ParsePrefix(prefix)
 	if err != nil {
@@ -422,3 +563,55 @@ func canonicalPrefix(prefix string) string {
 	return p.Masked().String()
 }
 // parseCIDR returns the mask length and the IP version of a prefix string
 func parseCIDR(prefix string) (int, int, error) {
 	_, ipNet, err := net.ParseCIDR(prefix)
 	if err != nil {
 		return 0, 0, err
 	}
 	ones, _ := ipNet.Mask.Size()
 	if strings.Contains(prefix, ":") {
 		return ones, ipv6Version, nil
 	}
 	return ones, ipv4Version, nil
 }
 // createLiveRoute creates a LiveRoute from a prefix update
 func (h *PrefixHandler) createLiveRoute(update prefixUpdate) *database.LiveRoute {
 	// Parse CIDR to get mask length
 	maskLength, ipVersion, err := parseCIDR(update.prefix)
 	if err != nil {
 		h.logger.Error("Failed to parse CIDR",
 			"prefix", update.prefix,
 			"error", err,
 		)
 		return nil
 	}
 	// Track route update metrics
 	if h.metrics != nil {
 		if ipVersion == ipv4Version {
 			h.metrics.RecordIPv4Update()
 		} else {
 			h.metrics.RecordIPv6Update()
 		}
 	}
 	// Create live route record
 	liveRoute := &database.LiveRoute{
 		Prefix:      update.prefix,
 		MaskLength:  maskLength,
 		IPVersion:   ipVersion,
 		OriginASN:   update.originASN,
 		PeerIP:      update.peer,
 		ASPath:      update.path,
 		NextHop:     update.peer, // Using peer as next hop
 		LastUpdated: update.timestamp,
 	}
 	return liveRoute
 }
@@ -1,607 +0,0 @@
 package routewatch
 import (
 	"bytes"
 	"encoding/json"
 	"errors"
 	"log/slog"
 	"net/netip"
 	"reflect"
 	"slices"
 	"strings"
 	"testing"
 	"time"
 	"git.eeqj.de/sneak/routewatch/internal/database"
 	"git.eeqj.de/sneak/routewatch/internal/logger"
 	"git.eeqj.de/sneak/routewatch/internal/ristypes"
 	"git.eeqj.de/sneak/routewatch/internal/routetable"
 )
 // More peers and prefixes for the tests of the routing table in memory.
 const (
 	secondPeerIP = "2001:db8:ffff::2"
 	thirdPeerIP  = "2001:db8:ffff::3"
 	fourthPeerIP = "192.0.2.4"
 	fifthPeerIP  = "192.0.2.5"
 	otherV4Prefix = "198.51.100.0/24"
 	setV4Prefix   = "203.0.113.0/24"
 	// firstManyPrefix is the first prefix announceManyPrefixes announces.
 	firstManyPrefix = "10.0.0.0/32"
 )
 // tableWriteTimeout is how long a test waits for the flush timer to write the
 // routing table's changes: a few ticks of it.
 const tableWriteTimeout = 5 * prefixBatchTimeout
 // tableCase is one test of the routing table in memory: the messages handed to
 // the prefix handler, and for each prefix the peers that carry it with each
 // origin AS after them.
 type tableCase struct {
 	name     string
 	messages []*ristypes.RISMessage
 	want     map[string]map[int][]string
 }
 // TestPrefixHandlerAppliesUpdatesToTheRoutingTable hands the prefix handler
 // announcements, withdrawals and a peer's session going down.
 func TestPrefixHandlerAppliesUpdatesToTheRoutingTable(t *testing.T) {
 	t.Parallel()
 	announceAndWithdraw := peerAnnouncement(testPeerIP, testV4Prefix)
 	announceAndWithdraw.Withdrawals = []string{testV4Prefix}
 	checkTableCases(t, []tableCase{
 		{
 			name:     "an announcement",
 			messages: []*ristypes.RISMessage{peerAnnouncement(testPeerIP, testV4Prefix)},
 			want:     map[string]map[int][]string{testV4Prefix: {testASNB: {testPeerIP}}},
 		},
 		{
 			name: "a withdrawal",
 			messages: []*ristypes.RISMessage{
 				peerAnnouncement(testPeerIP, testV4Prefix),
 				peerWithdrawal(testPeerIP, testV4Prefix),
 			},
 			want: map[string]map[int][]string{testV4Prefix: {}},
 		},
 		{
 			// RFC 4271 section 4.3: the announcement counts, not the withdrawal.
 			name:     "a message that announces and withdraws the prefix",
 			messages: []*ristypes.RISMessage{announceAndWithdraw},
 			want:     map[string]map[int][]string{testV4Prefix: {testASNB: {testPeerIP}}},
 		},
 		{
 			name: "a peer's session going down",
 			messages: []*ristypes.RISMessage{
 				peerAnnouncement(testPeerIP, testV4Prefix, testV6Prefix),
 				peerAnnouncement(secondPeerIP, testV4Prefix),
 				sessionDown(),
 			},
 			want: map[string]map[int][]string{
 				testV4Prefix: {testASNB: {secondPeerIP}},
 				testV6Prefix: {},
 			},
 		},
 		{
 			name: "an announcement after the peer's session went down",
 			messages: []*ristypes.RISMessage{
 				peerAnnouncement(testPeerIP, testV4Prefix),
 				sessionDown(),
 				peerAnnouncement(testPeerIP, otherV4Prefix),
 			},
 			want: map[string]map[int][]string{
 				testV4Prefix:  {},
 				otherV4Prefix: {testASNB: {testPeerIP}},
 			},
 		},
 	})
 }
 // TestPrefixHandlerAppliesAPathWithoutAnOriginToTheRoutingTable hands the
 // prefix handler announcements whose AS path gives no origin. One whose path
 // is empty or holds AS 0 removes the peer's route, as a withdrawal does; one
 // whose path ends in an AS set of several members is kept with origin 0.
 func TestPrefixHandlerAppliesAPathWithoutAnOriginToTheRoutingTable(t *testing.T) {
 	t.Parallel()
 	announceWithPath := func(path ristypes.ASPath) *ristypes.RISMessage {
 		msg := peerAnnouncement(testPeerIP, testV4Prefix)
 		msg.Path = path
 		return msg
 	}
 	checkTableCases(t, []tableCase{
 		{
 			name: "a path whose last AS is 0",
 			messages: []*ristypes.RISMessage{
 				peerAnnouncement(testPeerIP, testV4Prefix),
 				announceWithPath(ristypes.ASPath{Sequence: []int{testASNA, 0}}),
 			},
 			want: map[string]map[int][]string{testV4Prefix: {}},
 		},
 		{
 			name: "an empty path",
 			messages: []*ristypes.RISMessage{
 				peerAnnouncement(testPeerIP, testV4Prefix),
 				announceWithPath(ristypes.ASPath{}),
 			},
 			want: map[string]map[int][]string{testV4Prefix: {}},
 		},
 		{
 			name: "a path with AS 0 before its end",
 			messages: []*ristypes.RISMessage{
 				peerAnnouncement(testPeerIP, testV4Prefix),
 				announceWithPath(decodePath(t, testASNA, 0, testASNB)),
 			},
 			want: map[string]map[int][]string{testV4Prefix: {}},
 		},
 		{
 			name: "a path that ends in an AS set",
 			messages: []*ristypes.RISMessage{
 				announceWithPath(decodePath(t, testASNA, []int{testASNC, testASND})),
 			},
 			want: map[string]map[int][]string{testV4Prefix: {0: {testPeerIP}}},
 		},
 	})
 }
 // TestPrefixHandlerKeepsThePathOfAPathEndingInASet announces a prefix with AS
 // paths that end in an AS set. Any member of a set of several may be the
 // origin, so the routing table keeps the route with origin 0 (none); a set of
 // one member counts as that AS. The kept AS path lists the set's members after
 // the rest of the path.
 func TestPrefixHandlerKeepsThePathOfAPathEndingInASet(t *testing.T) {
 	t.Parallel()
 	tests := []struct {
 		name       string
 		path       []any
 		wantOrigin int
 		wantPath   []int
 	}{
 		{
 			name:     "a set of several members",
 			path:     []any{testASNA, testASNB, []int{testASNC, testASND}},
 			wantPath: []int{testASNA, testASNB, testASNC, testASND},
 		},
 		{
 			name:       "a set of one member",
 			path:       []any{testASNA, testASNB, []int{testASNC}},
 			wantOrigin: testASNC,
 			wantPath:   []int{testASNA, testASNB, testASNC},
 		},
 	}
 	for _, tt := range tests {
 		t.Run(tt.name, func(t *testing.T) {
 			t.Parallel()
 			msg := peerAnnouncement(testPeerIP, testV4Prefix)
 			msg.Path = decodePath(t, tt.path...)
 			h := prefixHandlerWithoutTimer(newMockStore())
 			h.HandleMessage(msg)
 			origins := h.table.Origins(netip.MustParsePrefix(testV4Prefix))
 			if len(origins) != 1 || origins[0].ASN != tt.wantOrigin ||
 				len(origins[0].Routes) != 1 ||
 				!slices.Equal(origins[0].Routes[0].ASPath, tt.wantPath) {
 				t.Errorf("Origins(%s) = %+v, want one route with origin AS%d "+
 					"and AS path %v", testV4Prefix, origins, tt.wantOrigin,
 					tt.wantPath)
 			}
 		})
 	}
 }
 // checkTableCases hands the messages of each case to a new prefix handler and
 // checks its routing table right after, with no flush.
 func checkTableCases(t *testing.T, tests []tableCase) {
 	t.Helper()
 	for _, tt := range tests {
 		t.Run(tt.name, func(t *testing.T) {
 			t.Parallel()
 			h := prefixHandlerWithoutTimer(newMockStore())
 			for _, msg := range tt.messages {
 				h.HandleMessage(msg)
 			}
 			for prefix, want := range tt.want {
 				got := tableOrigins(h.table, prefix)
 				if !reflect.DeepEqual(got, want) {
 					t.Errorf("peers of %s by origin AS = %v, want %v",
 						prefix, got, want)
 				}
 			}
 		})
 	}
 }
 // tableWritesStore is a real database that hands each write of the routing
 // table's changes to written once it is made.
 type tableWritesStore struct {
 	*database.Database
 	written chan []routetable.Change
 }
 func (s tableWritesStore) WriteRouteChanges(
 	changes []routetable.Change, newPeers map[string]uint,
 ) error {
 	err := s.Database.WriteRouteChanges(changes, newPeers)
 	s.written <- changes
 	return err
 }
 // TestPrefixHandlerWritesTheTableChangesEachSecond hands a running prefix
 // handler an announcement and then its withdrawal, each far short of a full
 // batch. The flush timer must write the change of each to the database.
 func TestPrefixHandlerWritesTheTableChangesEachSecond(t *testing.T) {
 	t.Parallel()
 	// The two writes the test waits for, and room for one more.
 	const writesBuffered = 3
 	store := tableWritesStore{
 		Database: newTestDatabase(t),
 		written:  make(chan []routetable.Change, writesBuffered),
 	}
 	h := NewPrefixHandler(store, logger.New(), routetable.New(routetable.Params{}))
 	defer h.Stop(t.Context())
 	prefix := netip.MustParsePrefix(testV4Prefix)
 	for _, step := range []struct {
 		msg         *ristypes.RISMessage
 		wantRemoved bool
 	}{
 		{msg: peerAnnouncement(testPeerIP, testV4Prefix)},
 		{msg: peerWithdrawal(testPeerIP, testV4Prefix), wantRemoved: true},
 	} {
 		h.HandleMessage(step.msg)
 		select {
 		case changes := <-store.written:
 			if len(changes) != 1 || changes[0].Prefix != prefix ||
 				changes[0].OriginASN != testASNB ||
 				changes[0].Removed != step.wantRemoved {
 				t.Fatalf("wrote %+v, want the pair of %s and AS%d with "+
 					"removed %t", changes, prefix, testASNB, step.wantRemoved)
 			}
 		case <-time.After(tableWriteTimeout):
 			t.Fatalf("the routing table's change was not written within %s",
 				tableWriteTimeout)
 		}
 	}
 }
 // errTestTableWrite is the error a test store's failing write of the routing
 // table's changes returns.
 var errTestTableWrite = errors.New("test: the write of the table's changes failed")
 // firstTableWriteFailsStore is a real database whose first write of the
 // routing table's changes fails, writing nothing. writes counts the writes
 // asked for.
 type firstTableWriteFailsStore struct {
 	*database.Database
 	writes int
 }
 func (s *firstTableWriteFailsStore) WriteRouteChanges(
 	changes []routetable.Change, newPeers map[string]uint,
 ) error {
 	s.writes++
 	if s.writes == 1 {
 		return errTestTableWrite
 	}
 	return s.Database.WriteRouteChanges(changes, newPeers)
 }
 // TestPrefixHandlerWritesAFailedTableWriteAgain runs two flushes into a
 // database whose first write of the routing table's changes fails. Before the
 // first, two new peers announce a prefix each; before the second, one of them
 // announces its prefix again with another path to the same origin AS. The
 // second write must hold the changes and new peers of the first, with the later
 // path, so the database holds the table that is in memory.
 func TestPrefixHandlerWritesAFailedTableWriteAgain(t *testing.T) {
 	t.Parallel()
 	db := newTestDatabase(t)
 	store := &firstTableWriteFailsStore{Database: db}
 	h := prefixHandlerWithoutTimer(store)
 	first := peerAnnouncement(testPeerIP, testV4Prefix)
 	h.HandleMessage(first)
 	h.HandleMessage(peerAnnouncement(secondPeerIP, otherV4Prefix))
 	h.flushBatch()
 	laterPath := []int{testASNC, testASNB}
 	later := peerAnnouncement(testPeerIP, testV4Prefix)
 	later.Path = ristypes.ASPath{Sequence: laterPath}
 	later.ParsedTimestamp = first.ParsedTimestamp.Add(secondUpdateAfter)
 	h.HandleMessage(later)
 	h.flushBatch()
 	if store.writes != 2 {
 		t.Fatalf("the store was asked for %d writes of the table's changes, "+
 			"want 2", store.writes)
 	}
 	read, err := db.ReadRouteTable(t.Context())
 	if err != nil {
 		t.Fatalf("ReadRouteTable: %v", err)
 	}
 	checkSameTable(t, read, h.table, testV4Prefix, otherV4Prefix)
 	origins := read.Origins(netip.MustParsePrefix(testV4Prefix))
 	if len(origins) != 1 || len(origins[0].Routes) != 1 ||
 		!slices.Equal(origins[0].Routes[0].ASPath, laterPath) {
 		t.Errorf("Origins(%s) = %+v, want one route with the path %v",
 			testV4Prefix, origins, laterPath)
 	}
 }
 // tableWriteSizesStore is a real database that records how many changes and
 // how many new peers each write of the routing table's changes holds.
 type tableWriteSizesStore struct {
 	*database.Database
 	changes  []int
 	newPeers []int
 }
 func (s *tableWriteSizesStore) WriteRouteChanges(
 	changes []routetable.Change, newPeers map[string]uint,
 ) error {
 	s.changes = append(s.changes, len(changes))
 	s.newPeers = append(s.newPeers, len(newPeers))
 	return s.Database.WriteRouteChanges(changes, newPeers)
 }
 // TestPrefixHandlerWritesManyTableChangesOverSeveralFlushes has one new peer
 // change one and a half times as many prefix and origin AS pairs as one write
 // takes, then flushes three times. The first write must hold as many pairs as
 // one write takes, and the peer. The second must hold the other pairs, and the
 // third flush must write nothing. The database must then hold the table in
 // memory.
 func TestPrefixHandlerWritesManyTableChangesOverSeveralFlushes(t *testing.T) {
 	t.Parallel()
 	const (
 		pairs   = maxTableChangesPerWrite * 3 / 2
 		flushes = 3
 	)
 	db := newTestDatabase(t)
 	store := &tableWriteSizesStore{Database: db}
 	h := prefixHandlerWithoutTimer(store)
 	announceManyPrefixes(h.table, pairs)
 	for range flushes {
 		h.flushBatch()
 	}
 	wantChanges := []int{maxTableChangesPerWrite, pairs - maxTableChangesPerWrite}
 	wantNewPeers := []int{1, 0}
 	if !slices.Equal(store.changes, wantChanges) ||
 		!slices.Equal(store.newPeers, wantNewPeers) {
 		t.Errorf("the writes held %v pairs and %v new peers, want %v and %v",
 			store.changes, store.newPeers, wantChanges, wantNewPeers)
 	}
 	read, err := db.ReadRouteTable(t.Context())
 	if err != nil {
 		t.Fatalf("ReadRouteTable: %v", err)
 	}
 	checkSameTable(t, read, h.table, firstManyPrefix)
 }
 // TestPrefixHandlerStopLogsTheTableChangesLeftUnwritten stops a prefix handler,
 // with no deadline, whose routing table holds more changed pairs than one write
 // takes. Its last flush writes one write's worth, so Stop must log the pairs
 // that no write took, and must not say that the stop deadline passed. The
 // flush timer must not fire, or its writes could leave no pairs for Stop to
 // log.
 func TestPrefixHandlerStopLogsTheTableChangesLeftUnwritten(t *testing.T) {
 	t.Parallel()
 	const pairs = maxTableChangesPerWrite + 1
 	var logs bytes.Buffer
 	store := &tableWriteSizesStore{Database: newTestDatabase(t)}
 	table := routetable.New(routetable.Params{})
 	announceManyPrefixes(table, pairs)
 	h := newPrefixHandler(store, newErrorLogger(&logs), table, longerThanAnyTest)
 	h.Stop(t.Context())
 	written := 0
 	for _, n := range store.changes {
 		written += n
 	}
 	logged := lastLogged(t, &logs)
 	if strings.Contains(logged.Msg, "deadline") {
 		t.Errorf("Stop logged %q although its deadline had not passed",
 			logged.Msg)
 	}
 	if logged.TableChanges != pairs-written {
 		t.Errorf("Stop logged %d table changes not written, want %d",
 			logged.TableChanges, pairs-written)
 	}
 }
 // readLog holds what readRouteTable logs.
 //
 //nolint:tagliatelle // field names are the keys readRouteTable logs
 type readLog struct {
 	Msg        string `json:"msg"`
 	Pairs      int    `json:"pairs"`
 	Peers      int    `json:"peers"`
 	DurationMs *int64 `json:"duration_ms"`
 }
 // TestARestartReadsTheRoutingTableBack runs announcements, a withdrawal and a
 // peer's session going down through a prefix handler into a database, then
 // reads the table back as startup does. The table read must answer as the one
 // in memory, and the log must give its pairs and peers. A new handler on the
 // table read then takes later updates and writes them as it stops: the
 // database must then hold what the first table holds after the same updates.
 func TestARestartReadsTheRoutingTableBack(t *testing.T) {
 	t.Parallel()
 	prefixes := []string{testV4Prefix, testV6Prefix, otherV4Prefix, setV4Prefix}
 	db := newTestDatabase(t)
 	h := prefixHandlerWithoutTimer(db)
 	viaOtherOrigin := peerAnnouncement(thirdPeerIP, testV4Prefix)
 	viaOtherOrigin.Path = ristypes.ASPath{Sequence: []int{testASNA, testASNC}}
 	endsInSet := peerAnnouncement(secondPeerIP, setV4Prefix)
 	endsInSet.Path = decodePath(t, testASNA, []int{testASNC, testASND})
 	for _, msg := range []*ristypes.RISMessage{
 		peerAnnouncement(testPeerIP, testV4Prefix, testV6Prefix),
 		peerAnnouncement(secondPeerIP, testV4Prefix),
 		viaOtherOrigin,
 		endsInSet,
 		peerAnnouncement(thirdPeerIP, otherV4Prefix),
 		peerWithdrawal(thirdPeerIP, otherV4Prefix),
 		peerAnnouncement(fourthPeerIP, otherV4Prefix),
 		sessionDownOf(fourthPeerIP),
 	} {
 		h.HandleMessage(msg)
 	}
 	h.flushBatch()
 	var logs bytes.Buffer
 	table, err := readRouteTable(db,
 		&logger.Logger{Logger: slog.New(slog.NewJSONHandler(&logs, nil))})
 	if err != nil {
 		t.Fatalf("readRouteTable: %v", err)
 	}
 	checkSameTable(t, table, h.table, prefixes...)
 	// testV4Prefix with two origin ASes, testV6Prefix and setV4Prefix; four
 	// peers, the last of which carries nothing.
 	const wantPairs, wantPeers = 4, 4
 	var logged readLog
 	err = json.Unmarshal(bytes.TrimSpace(logs.Bytes()), &logged)
 	if err != nil || logged.Pairs != wantPairs || logged.Peers != wantPeers ||
 		logged.DurationMs == nil {
 		t.Errorf("readRouteTable logged %q, want %d pairs, %d peers and the "+
 			"duration", logs.String(), wantPairs, wantPeers)
 	}
 	restarted := NewPrefixHandler(db, logger.New(), table)
 	for _, msg := range []*ristypes.RISMessage{
 		peerWithdrawal(testPeerIP, testV6Prefix),
 		sessionDownOf(secondPeerIP),
 		peerAnnouncement(fourthPeerIP, otherV4Prefix),
 		peerAnnouncement(fifthPeerIP, setV4Prefix),
 	} {
 		// The first handler only applies the updates to its table.
 		h.HandleMessage(msg)
 		restarted.HandleMessage(msg)
 	}
 	restarted.Stop(t.Context())
 	read, err := db.ReadRouteTable(t.Context())
 	if err != nil {
 		t.Fatalf("ReadRouteTable after the restart: %v", err)
 	}
 	checkSameTable(t, read, h.table, prefixes...)
 }
 // peerWithdrawal returns an UPDATE message in which peer withdraws prefixes.
 func peerWithdrawal(peer string, prefixes ...string) *ristypes.RISMessage {
 	return &ristypes.RISMessage{
 		Type:            ristypes.MessageTypeUpdate,
 		Peer:            peer,
 		ParsedTimestamp: time.Date(2026, 1, 2, 3, 4, 5, 0, time.UTC),
 		Withdrawals:     prefixes,
 	}
 }
 // announceManyPrefixes has testPeerIP announce n prefixes in table, with the
 // path of peerAnnouncement: the /32 of each address from firstManyPrefix on.
 func announceManyPrefixes(table *routetable.Table, n int) {
 	addr := netip.MustParsePrefix(firstManyPrefix).Addr()
 	route := routetable.Route{
 		Peer:   testPeerIP,
 		ASPath: []int{testASNA, testASNB},
 		Time:   time.Date(2026, 1, 2, 3, 4, 5, 0, time.UTC),
 	}
 	for range n {
 		table.Announce(netip.PrefixFrom(addr, addr.BitLen()), testASNB, route)
 		addr = addr.Next()
 	}
 }
 // sessionDownOf returns the STATE message that says the BGP session of peer
 // went down.
 func sessionDownOf(peer string) *ristypes.RISMessage {
 	return &ristypes.RISMessage{
 		Type:  ristypes.MessageTypeState,
 		Peer:  peer,
 		State: ristypes.StateDown,
 	}
 }
 // tableOrigins returns, for each origin AS of prefix in table, the peers that
 // carry the prefix with it.
 func tableOrigins(table *routetable.Table, prefix string) map[int][]string {
 	origins := make(map[int][]string)
 	for _, o := range table.Origins(netip.MustParsePrefix(prefix)) {
 		origins[o.ASN] = o.Peers
 	}
 	return origins
 }
 // checkSameTable checks that got answers as want does for each of prefixes, and
 // that the two tables have the same counts.
 func checkSameTable(
 	t *testing.T, got, want *routetable.Table, prefixes ...string,
 ) {
 	t.Helper()
 	for _, text := range prefixes {
 		prefix := netip.MustParsePrefix(text)
 		gotOrigins, wantOrigins := got.Origins(prefix), want.Origins(prefix)
 		if !reflect.DeepEqual(gotOrigins, wantOrigins) {
 			t.Errorf("Origins(%s) = %+v, want %+v", text, gotOrigins, wantOrigins)
 		}
 	}
 	gotCounts, wantCounts := got.Counts(), want.Counts()
 	if !reflect.DeepEqual(gotCounts, wantCounts) {
 		t.Errorf("Counts() = %+v, want %+v", gotCounts, wantCounts)
 	}
 }
@@ -1,397 +0,0 @@
 package server
 import (
 	"encoding/json"
 	"net/http"
 	"net/http/httptest"
 	"slices"
 	"strconv"
 	"strings"
 	"testing"
 	"time"
 	"git.eeqj.de/sneak/routewatch/internal/database"
 	"git.eeqj.de/sneak/routewatch/internal/ristypes"
 	"git.eeqj.de/sneak/routewatch/internal/routetable"
 )
 // The origin ASes in the routing table that newTwoOriginTable fills.
 const (
 	mostPeersASN  = 64500
 	fewerPeersASN = 64501
 	v6OriginASN   = 64502
 )
 // noKeptRoutePrefix is the prefix of newTwoOriginTable whose origin keeps no
 // route.
 const noKeptRoutePrefix = "198.51.100.0/24"
 // routeTimeFormat is how the pages write a route's time.
 const routeTimeFormat = "2006-01-02 15:04:05"
 // newTwoOriginTable returns a routing table that holds:
 //   - testPrefixV4 with two origin ASes. Peers 1, 2 and 3 carry it with
 //     mostPeersASN, which keeps the routes of peers 3 and 2. Peer 4 carries
 //     it with fewerPeersASN, in the prefix's newest route.
 //   - noKeptRoutePrefix with mostPeersASN. Only peer 7 carries it, and its
 //     route is not kept: peers 5 and 6, whose routes were, withdrew it.
 //   - testPrefixV6 with v6OriginASN.
 func newTwoOriginTable() *routetable.Table {
 	table := emptyTable()
 	for n := 1; n <= 3; n++ {
 		announce(table, testPrefixV4, mostPeersASN, testPeer(n), testRouteTime(n))
 	}
 	announce(table, testPrefixV4, fewerPeersASN, testPeer(4), testRouteTime(5))
 	announce(table, noKeptRoutePrefix, mostPeersASN, testPeer(5), testRouteTime(4))
 	announce(table, noKeptRoutePrefix, mostPeersASN, testPeer(6), testRouteTime(6))
 	announce(table, noKeptRoutePrefix, mostPeersASN, testPeer(7), testRouteTime(0))
 	withdraw(table, noKeptRoutePrefix, testPeer(5))
 	withdraw(table, noKeptRoutePrefix, testPeer(6))
 	announce(table, testPrefixV6, v6OriginASN, testPeerV6, testRouteTime(0))
 	return table
 }
 // get sends a GET for path through s's router and fails the test unless it
 // answers 200.
 func get(t *testing.T, s *Server, path string) *httptest.ResponseRecorder {
 	t.Helper()
 	rec := httptest.NewRecorder()
 	s.router.ServeHTTP(rec, httptest.NewRequestWithContext(
 		t.Context(), http.MethodGet, path, nil))
 	if rec.Code != http.StatusOK {
 		t.Fatalf("%s: status %d, want %d; body %s",
 			path, rec.Code, http.StatusOK, rec.Body)
 	}
 	return rec
 }
 // TestIPLookupGivesTheOriginMostPeersCarry looks up an address in a prefix
 // with two origin ASes, through each IP lookup route. The answer names the
 // origin AS that more peers carry, counts every peer, and gives the time of
 // the prefix's newest kept route. The prefix's first-seen time and the AS's
 // WHOIS details come from the database.
 func TestIPLookupGivesTheOriginMostPeersCarry(t *testing.T) {
 	t.Parallel()
 	s := newServerWithTable(t, newTwoOriginTable())
 	s.resolver = &fakeResolver{}
 	firstSeen := testRouteTime(-1)
 	err := s.db.UpdatePrefixesBatch(map[string]time.Time{testPrefixV4: firstSeen})
 	if err != nil {
 		t.Fatalf("UpdatePrefixesBatch: %v", err)
 	}
 	_, err = s.db.GetOrCreateASN(mostPeersASN, firstSeen)
 	if err != nil {
 		t.Fatalf("GetOrCreateASN: %v", err)
 	}
 	whois := &database.ASNWHOISUpdate{
 		ASN: mostPeersASN, ASName: "TEST-AS", CountryCode: "DE",
 	}
 	err = s.db.UpdateASNWHOIS(t.Context(), whois)
 	if err != nil {
 		t.Fatalf("UpdateASNWHOIS: %v", err)
 	}
 	// ownAddressPath looks up the request's own address, which httptest
 	// gives as addrInTestPrefixV4.
 	for _, path := range []string{
 		"/api/v1/ip/" + addrInTestPrefixV4, "/ip/" + addrInTestPrefixV4,
 		ownAddressPath,
 	} {
 		var body struct {
 			Data IPLookupResponse `json:"data"`
 		}
 		err := json.Unmarshal(get(t, s, path).Body.Bytes(), &body)
 		if err != nil || len(body.Data.Results) != 1 ||
 			body.Data.Results[0].IPInfo == nil {
 			t.Fatalf("%s: answer %+v (%v), want one result with a route",
 				path, body.Data, err)
 		}
 		got := body.Data.Results[0].IPInfo
 		if got.Netblock != testPrefixV4 || got.ASN != mostPeersASN ||
 			got.NumPeers != 4 || !got.LastSeen.Equal(testRouteTime(5)) ||
 			!got.FirstSeen.Equal(firstSeen) || got.ASName != whois.ASName ||
 			got.CountryCode != whois.CountryCode {
 			t.Errorf("%s: route %+v, want %s from AS%d, 4 peers, last seen %v, "+
 				"first seen %v, %s in %s", path, *got, testPrefixV4,
 				mostPeersASN, testRouteTime(5), firstSeen, whois.ASName,
 				whois.CountryCode)
 		}
 	}
 }
 // TestIPLookupAsksForNoWHOISLookupOfOriginZero checks that the IP lookup asks
 // for no WHOIS lookup of AS 0, which means no known origin. It asks for one of
 // an AS whose WHOIS details were never fetched or are stale, and not of one
 // whose details are fresh.
 func TestIPLookupAsksForNoWHOISLookupOfOriginZero(t *testing.T) {
 	t.Parallel()
 	fresh := time.Now().Add(-time.Hour)
 	stale := time.Now().Add(-2 * whoisStaleThreshold)
 	tests := []struct {
 		name   string
 		asInfo database.ASN
 		want   bool
 	}{
 		{"no known origin", database.ASN{ASN: ristypes.NoOrigin}, false},
 		{"details never fetched", database.ASN{ASN: mostPeersASN}, true},
 		{"stale details", database.ASN{ASN: mostPeersASN, WHOISUpdatedAt: &stale}, true},
 		{"fresh details", database.ASN{ASN: mostPeersASN, WHOISUpdatedAt: &fresh}, false},
 	}
 	for _, tt := range tests {
 		if got := needsWHOISRefresh(&tt.asInfo); got != tt.want {
 			t.Errorf("%s: needsWHOISRefresh = %t, want %t", tt.name, got, tt.want)
 		}
 	}
 }
 // prefixRoute is one route of the prefix API's answer. A field the answer
 // leaves out stays nil.
 //
 //nolint:tagliatelle // field names are the existing JSON API
 type prefixRoute struct {
 	OriginASN   int        `json:"origin_asn"`
 	PeerIP      string     `json:"peer_ip"`
 	ASPath      []int      `json:"as_path"`
 	NextHop     *string    `json:"next_hop"`
 	LastUpdated *time.Time `json:"last_updated"`
 }
 // TestPrefixAnswersListEveryPeer asks the prefix API and page for a prefix
 // with two origin ASes, and for one whose origin keeps no route. Each answer
 // lists every peer that carries the prefix, by origin AS. Only the kept routes
 // have an AS path, a next hop and a time, newest first. The other peers follow
 // without them.
 func TestPrefixAnswersListEveryPeer(t *testing.T) {
 	t.Parallel()
 	s := newServerWithTable(t, newTwoOriginTable())
 	// keptAt[peer] is the time of the peer's kept route; a peer not in it is
 	// listed without a route.
 	keptAt := map[string]time.Time{
 		testPeer(3): testRouteTime(3),
 		testPeer(2): testRouteTime(2),
 		testPeer(4): testRouteTime(5),
 	}
 	tests := []struct {
 		prefix      string
 		wantPeers   []string
 		wantOrigins []int
 	}{
 		{
 			testPrefixV4,
 			[]string{testPeer(3), testPeer(2), testPeer(1), testPeer(4)},
 			[]int{mostPeersASN, mostPeersASN, mostPeersASN, fewerPeersASN},
 		},
 		{noKeptRoutePrefix, []string{testPeer(7)}, []int{mostPeersASN}},
 	}
 	for _, tt := range tests {
 		//nolint:tagliatelle // field names are the existing JSON API
 		var body struct {
 			Data struct {
 				Routes      []prefixRoute `json:"routes"`
 				PeerCount   int           `json:"peer_count"`
 				OriginCount int           `json:"origin_count"`
 			} `json:"data"`
 		}
 		path := "/api/v1/prefix/" + tt.prefix
 		err := json.Unmarshal(get(t, s, path).Body.Bytes(), &body)
 		if err != nil {
 			t.Fatalf("%s: decoding the answer: %v", path, err)
 		}
 		wantOriginCount := len(slices.Compact(slices.Clone(tt.wantOrigins)))
 		if body.Data.PeerCount != len(tt.wantPeers) ||
 			body.Data.OriginCount != wantOriginCount {
 			t.Errorf("%s: %d peers and %d origins, want %d and %d", path,
 				body.Data.PeerCount, body.Data.OriginCount, len(tt.wantPeers),
 				wantOriginCount)
 		}
 		checkPrefixRoutes(t, path, body.Data.Routes, tt.wantPeers, tt.wantOrigins,
 			keptAt)
 		checkPrefixPage(t, s, tt.prefix, tt.wantPeers, keptAt)
 	}
 }
 // checkPrefixRoutes checks that routes come from wantPeers, in that order,
 // with wantOrigins as their origin ASes. The route of a peer in keptAt must
 // have an AS path, the peer as next hop, and the time keptAt gives. Any other
 // route must have none of the three.
 func checkPrefixRoutes(
 	t *testing.T, path string, routes []prefixRoute, wantPeers []string,
 	wantOrigins []int, keptAt map[string]time.Time,
 ) {
 	t.Helper()
 	if len(routes) != len(wantPeers) {
 		t.Fatalf("%s: routes %+v, want one each from %v", path, routes, wantPeers)
 	}
 	for i, route := range routes {
 		if route.PeerIP != wantPeers[i] || route.OriginASN != wantOrigins[i] {
 			t.Errorf("%s: route %d from %s with AS%d, want from %s with AS%d",
 				path, i, route.PeerIP, route.OriginASN, wantPeers[i], wantOrigins[i])
 		}
 		at, kept := keptAt[route.PeerIP]
 		if !kept {
 			if route.ASPath != nil || route.NextHop != nil || route.LastUpdated != nil {
 				t.Errorf("%s: route from %s is not kept but has %+v",
 					path, route.PeerIP, route)
 			}
 			continue
 		}
 		if route.ASPath == nil || route.NextHop == nil ||
 			*route.NextHop != route.PeerIP || route.LastUpdated == nil ||
 			!route.LastUpdated.Equal(at) {
 			t.Errorf("%s: kept route from %s is %+v, want its AS path, the peer "+
 				"as next hop and the time %v", path, route.PeerIP, route, at)
 		}
 	}
 }
 // checkPrefixPage checks that the page of prefix shows each of wantPeers, the
 // time of each kept route among them, and no time that was never set.
 func checkPrefixPage(
 	t *testing.T, s *Server, prefix string, wantPeers []string,
 	keptAt map[string]time.Time,
 ) {
 	t.Helper()
 	path := "/prefix/" + prefix
 	page := get(t, s, path).Body.String()
 	for _, peer := range wantPeers {
 		want := `<td class="peer-ip">` + peer + `</td>`
 		if !strings.Contains(page, want) {
 			t.Errorf("%s does not list the peer %s", path, peer)
 		}
 		at, kept := keptAt[peer]
 		if kept && !strings.Contains(page, at.Format(routeTimeFormat)) {
 			t.Errorf("%s does not show the time %v of the route from %s",
 				path, at, peer)
 		}
 	}
 	if strings.Contains(page, zeroDate) {
 		t.Errorf("%s shows the date %s", path, zeroDate)
 	}
 }
 // TestASAnswersGiveEachPrefixItsNewestKeptRoute asks the AS API and page for
 // mostPeersASN. Its prefixes are testPrefixV4, whose newest kept route with
 // that origin AS is peer 3's, and noKeptRoutePrefix, which keeps no route. The
 // first has that route's time. The second is listed without a time.
 func TestASAnswersGiveEachPrefixItsNewestKeptRoute(t *testing.T) {
 	t.Parallel()
 	s := newServerWithTable(t, newTwoOriginTable())
 	path := "/api/v1/as/" + strconv.Itoa(mostPeersASN)
 	//nolint:tagliatelle // field names are the existing JSON API
 	var body struct {
 		Data struct {
 			IPv4Prefixes []struct {
 				Prefix      string     `json:"prefix"`
 				LastUpdated *time.Time `json:"last_updated"`
 			} `json:"ipv4_prefixes"`
 		} `json:"data"`
 	}
 	err := json.Unmarshal(get(t, s, path).Body.Bytes(), &body)
 	if err != nil {
 		t.Fatalf("%s: decoding the answer: %v", path, err)
 	}
 	prefixes := body.Data.IPv4Prefixes
 	if len(prefixes) != 2 || prefixes[0].Prefix != testPrefixV4 ||
 		prefixes[0].LastUpdated == nil ||
 		!prefixes[0].LastUpdated.Equal(testRouteTime(3)) ||
 		prefixes[1].Prefix != noKeptRoutePrefix || prefixes[1].LastUpdated != nil {
 		t.Errorf("%s: prefixes %+v, want %s updated %v and %s without a time",
 			path, prefixes, testPrefixV4, testRouteTime(3), noKeptRoutePrefix)
 	}
 	path = "/as/" + strconv.Itoa(mostPeersASN)
 	page := get(t, s, path).Body.String()
 	for _, want := range []string{
 		testPrefixV4, noKeptRoutePrefix, testRouteTime(3).Format(routeTimeFormat),
 	} {
 		if !strings.Contains(page, want) {
 			t.Errorf("%s does not show %s", path, want)
 		}
 	}
 	if strings.Contains(page, zeroDate) {
 		t.Errorf("%s shows the date %s", path, zeroDate)
 	}
 }
 // TestPrefixLengthPagesShowTheOriginMostPeersCarry asks for the IPv4 /24
 // page and the IPv6 /32 page. The first lists both /24 prefixes with
 // mostPeersASN, the origin AS more peers carry testPrefixV4 with, and gives
 // noKeptRoutePrefix no age. The second lists testPrefixV6.
 func TestPrefixLengthPagesShowTheOriginMostPeersCarry(t *testing.T) {
 	t.Parallel()
 	s := newServerWithTable(t, newTwoOriginTable())
 	page := get(t, s, prefixLengthPagePath).Body.String()
 	for _, want := range []string{
 		">" + testPrefixV4 + "<", ">" + noKeptRoutePrefix + "<",
 		`href="/as/` + strconv.Itoa(mostPeersASN) + `"`,
 	} {
 		if !strings.Contains(page, want) {
 			t.Errorf("%s does not show %s", prefixLengthPagePath, want)
 		}
 	}
 	if strings.Contains(page, `href="/as/`+strconv.Itoa(fewerPeersASN)+`"`) {
 		t.Errorf("%s links to AS%d, which fewer peers carry",
 			prefixLengthPagePath, fewerPeersASN)
 	}
 	const noAge = `<td class="age"></td>`
 	if strings.Count(page, noAge) != 1 {
 		t.Errorf("%s gives %d prefixes no age, want 1 (%s)",
 			prefixLengthPagePath, strings.Count(page, noAge), noKeptRoutePrefix)
 	}
 	const v6PagePath = "/prefixlength6/32"
 	page = get(t, s, v6PagePath).Body.String()
 	if !strings.Contains(page, ">"+testPrefixV6+"<") ||
 		!strings.Contains(page, `href="/as/`+strconv.Itoa(v6OriginASN)+`"`) {
 		t.Errorf("%s does not show %s with AS%d", v6PagePath, testPrefixV6,
 			v6OriginASN)
 	}
 }
@@ -11,12 +11,11 @@ import (
 )
 // The addresses the forwarding tests use: the client a proxy names in
-// X-Forwarded-For, the range of trusted proxies, a peer inside it, and a peer
+// X-Forwarded-For, a peer inside the trusted range of
-// outside it, which lies in testPrefixV4 so that an IP lookup of it finds a
+// TestRealIPMiddlewareTrustsOnlyConfiguredProxies, and a peer outside it,
-// route.
+// which lies in testPrefixV4 so that an IP lookup of it finds a route.
 const (
 	forwardedClient   = "203.0.113.9"
 	trustedProxyRange = "10.0.0.0/8"
 	trustedPeer       = "10.0.0.2:1234"
 	untrustedPeerAddr = "192.0.2.1"
 	untrustedPeer     = untrustedPeerAddr + ":1234"
@@ -190,7 +189,7 @@ func TestForwardedForFromUntrustedPeerIsIgnored(t *testing.T) {
 func TestRealIPMiddlewareTrustsOnlyConfiguredProxies(t *testing.T) {
 	t.Parallel()
-	trusted := []netip.Prefix{netip.MustParsePrefix(trustedProxyRange)}
+	trusted := []netip.Prefix{netip.MustParsePrefix("10.0.0.0/8")}
 	tests := []struct {
 		name         string
@@ -1,67 +0,0 @@
 package server
 import (
 	"errors"
 	"time"
 )
 var (
 	// ErrInvalidIP says that an IP address is malformed. The IP lookup returns
 	// it.
 	ErrInvalidIP = errors.New("invalid IP address")
 	// ErrNoRoute says that the routing table has no route for an address, a
 	// prefix or an AS. The lookups return it.
 	ErrNoRoute = errors.New("no route found")
 )
 // LiveRoute represents a route in the live routing table. JSON leaves out an
 // empty AS path, next hop or time: the routing table in memory keeps them only
 // for the two newest routes of each prefix and origin AS.
 //
 //nolint:tagliatelle // field names are the existing JSON API
 type LiveRoute struct {
 	Prefix      string    `json:"prefix"`
 	MaskLength  int       `json:"mask_length"`
 	IPVersion   int       `json:"ip_version"`
 	OriginASN   int       `json:"origin_asn"`
 	PeerIP      string    `json:"peer_ip"`
 	ASPath      []int     `json:"as_path,omitempty"`
 	NextHop     string    `json:"next_hop,omitempty"`
 	LastUpdated time.Time `json:"last_updated,omitzero"`
 }
 // PrefixDistribution represents the distribution of prefixes by mask length
 //
 //nolint:tagliatelle // field names are the existing JSON API
 type PrefixDistribution struct {
 	MaskLength int `json:"mask_length"`
 	Count      int `json:"count"`
 }
 // IPInfo represents comprehensive IP information for the /ip endpoint
 //
 //nolint:tagliatelle // field names are the existing JSON API
 type IPInfo struct {
 	IP         string `json:"ip"`
 	Netblock   string `json:"netblock"`
 	MaskLength int    `json:"mask_length"`
 	IPVersion  int    `json:"ip_version"`
 	NumPeers   int    `json:"num_peers"`
 	// AS information
 	ASN         int    `json:"asn"`
 	ASName      string `json:"as_name,omitempty"`
 	Handle      string `json:"handle,omitempty"`
 	Description string `json:"description,omitempty"`
 	OrgName     string `json:"org_name,omitempty"`
 	OrgID       string `json:"org_id,omitempty"`
 	Address     string `json:"address,omitempty"`
 	CountryCode string `json:"country_code,omitempty"`
 	AbuseEmail  string `json:"abuse_email,omitempty"`
 	RIR         string `json:"rir,omitempty"`
 	// Timestamps. LastSeen is zero, and left out of JSON, when the prefix
 	// keeps no route.
 	FirstSeen time.Time `json:"first_seen"`
 	LastSeen  time.Time `json:"last_seen,omitzero"`
 	// Indicates if WHOIS data needs refresh (not serialized)
 	NeedsWHOISRefresh bool `json:"-"`
 }
@@ -14,8 +14,8 @@ const (
 	notFoundMessage         = "Not found"
 	methodNotAllowedMessage = "Method not allowed"
-	// jsonRoutesAllow is the Allow header of their 405 answer: every one of
+	// jsonRoutesAllow is the Allow header of their 405 answer: they are all
-	// them takes GET and HEAD, and no other method.
+	// GET routes, and GetHead serves HEAD on them as GET.
 	jsonRoutesAllow = "GET, HEAD"
 )
@@ -72,9 +72,6 @@ func (s *Server) setupRoutes() {
 		r.NotFound(jsonNotFound)
 		r.MethodNotAllowed(jsonMethodNotAllowed)
 		r.Get("/", s.handleIPInfo())       // Client IP
 		// GetHead does not reach this route: mounting the group registers
 		// /ip and /ip/ for every method, so HEAD arrives here as HEAD.
 		r.Head("/", s.handleIPInfo())
 		r.Get("/{addr}", s.handleIPInfo()) // Specified IP
 	})
@@ -87,7 +84,6 @@ func (s *Server) setupRoutes() {
 		r.Get("/ip/{ip}", s.handleIPLookup())
 		r.Get("/as/{asn}", s.handleASDetailJSON())
 		r.Get("/prefix/{prefix}/{len}", s.handlePrefixDetailJSON())
 		r.Get("/search/as", s.handleASSearch())
 	})
 	s.router = r
@@ -7,17 +7,16 @@ import (
 	"testing"
 )
-// TestRoutesAnswerHEAD sends HEAD for a page and JSON routes through the
+// TestRoutesAnswerHEAD sends HEAD for a page and a JSON route through the
-// server's router and checks that each answers as GET does. /ip and /ip/, the
+// server's router and checks that each answers as GET does. Before the fix
-// lookup of the caller's own address, are in the list because chi's GetHead
+// every route answered HEAD with 405
 // does not reach them. Before the fix every route answered HEAD with 405
 // (https://git.eeqj.de/sneak/routewatch/issues/111).
 func TestRoutesAnswerHEAD(t *testing.T) {
 	t.Parallel()
 	s := newServerWithTestRoutes(t)
-	for _, path := range []string{"/", statsPath, "/ip", "/ip/"} {
+	for _, path := range []string{"/", statsPath} {
 		rec := httptest.NewRecorder()
 		s.router.ServeHTTP(rec, httptest.NewRequestWithContext(
 			t.Context(), http.MethodHead, path, nil))
@@ -1,12 +1,4 @@
-// Package server serves RouteWatch's web pages and JSON API:
+// Package server provides HTTP endpoints for status monitoring and statistics
 //   - the home page, the status figures and the health check
 //   - the AS, prefix and prefix length pages, and the JSON answers behind them
 //   - the IP lookups
 //   - the AS name search
 //
 // Every route it shows comes from the routing table in memory. AS names,
 // WHOIS details and the times a prefix and an AS were first seen come from
 // the database.
 package server
 import (
@@ -19,11 +11,9 @@ import (
 	"strconv"
 	"time"
 	"git.eeqj.de/sneak/routewatch/internal/blocklist"
 	"git.eeqj.de/sneak/routewatch/internal/config"
 	"git.eeqj.de/sneak/routewatch/internal/database"
 	"git.eeqj.de/sneak/routewatch/internal/logger"
 	"git.eeqj.de/sneak/routewatch/internal/routetable"
 	"git.eeqj.de/sneak/routewatch/internal/streamer"
 	"github.com/go-chi/chi/v5"
 )
@@ -42,13 +32,6 @@ type ASNFetcher interface {
 	GetStats() ASNFetcherStats
 }
 // Blocklists tells which public blocklists list an address, from copies it
 // keeps in memory, as *blocklist.Blocklists does.
 type Blocklists interface {
 	Lookup(addr netip.Addr) []blocklist.Listing
 	ShortestInterval() time.Duration
 }
 // dnsResolver looks up the addresses of host names and the names of addresses
 // in DNS, as *net.Resolver does.
 type dnsResolver interface {
@@ -60,13 +43,11 @@ type dnsResolver interface {
 type Server struct {
 	router     *chi.Mux
 	db         database.Store
 	table      *routetable.Table
 	streamer   *streamer.Streamer
 	logger     *logger.Logger
 	port       int
 	srv        *http.Server
 	asnFetcher ASNFetcher
 	blocklists Blocklists
 	// trustedProxies are the reverse proxies whose X-Forwarded-For header
 	// RealIPMiddleware believes
@@ -77,18 +58,15 @@ type Server struct {
 	resolver dnsResolver
 }
-// New creates a new HTTP server that reads routes from table, the routing
+// New creates a new HTTP server
 // table that the prefix handler keeps current.
 func New(
 	db database.Store,
 	table *routetable.Table,
 	streamer *streamer.Streamer,
 	logger *logger.Logger,
 	cfg *config.Config,
 ) *Server {
 	s := &Server{
 		db:             db,
 		table:          table,
 		streamer:       streamer,
 		logger:         logger,
 		port:           cfg.Port,
@@ -161,14 +139,7 @@ func (s *Server) Stop(ctx context.Context) error {
 	return nil
 }
-// SetASNFetcher sets the ASN WHOIS fetcher for on-demand lookups. Call it
+// SetASNFetcher sets the ASN WHOIS fetcher for on-demand lookups.
 // before Start: the handlers read the fetcher without a lock.
 func (s *Server) SetASNFetcher(fetcher ASNFetcher) {
 	s.asnFetcher = fetcher
 }
 // SetBlocklists sets the blocklists the IP lookups report. Call it before
 // Start: the handlers read the blocklists without a lock.
 func (s *Server) SetBlocklists(blocklists Blocklists) {
 	s.blocklists = blocklists
 }
@@ -34,7 +34,7 @@ func TestStartFailsWhenPortIsHeld(t *testing.T) {
 	port := addr.Port
 	log := logger.New()
-	s := server.New(nil, nil, streamer.New(log, metrics.New()), log,
+	s := server.New(nil, streamer.New(log, metrics.New()), log,
 		&config.Config{Port: port})
 	defer func() { _ = s.Stop(context.Background()) }()
@@ -106,12 +106,12 @@ type RawMessageHandler func(line string)
 // handlerMetrics tracks performance metrics for a handler
 type handlerMetrics struct {
 	processedCount     uint64        // Total messages processed
-	droppedCount       atomic.Uint64 // Total messages dropped; not under mu
+	droppedCount       uint64        // Total messages dropped
 	totalTime          time.Duration // Total processing time (for average calculation)
 	minTime            time.Duration // Minimum processing time
 	maxTime            time.Duration // Maximum processing time
 	queueHighWaterMark int           // Maximum queue length seen
-	mu                 sync.Mutex    // Protects the other metrics
+	mu                 sync.Mutex    // Protects the metrics
 }
 // handlerInfo wraps a handler with its queue and metrics
@@ -371,7 +371,7 @@ func (s *Streamer) GetHandlerStats() []HandlerStats {
 			QueueCapacity:      cap(info.queue),
 			QueueHighWaterMark: info.metrics.queueHighWaterMark,
 			ProcessedCount:     info.metrics.processedCount,
-			DroppedCount:       info.metrics.droppedCount.Load(),
+			DroppedCount:       info.metrics.droppedCount,
 			MinProcessTime:     info.metrics.minTime,
 			MaxProcessTime:     info.metrics.maxTime,
 		}
@@ -488,7 +488,7 @@ func (s *Streamer) logMetrics() {
 				"queue_len", len(info.queue),
 				"queue_cap", cap(info.queue),
 				"processed", info.metrics.processedCount,
-				"dropped", info.metrics.droppedCount.Load(),
+				"dropped", info.metrics.droppedCount,
 				"avg_time", avgTime,
 				"min_time", info.metrics.minTime,
 				"max_time", info.metrics.maxTime,
@@ -858,7 +858,7 @@ func (s *Streamer) dispatchMessage(
 		}
 		if !s.queueMessage(info, msg) {
-			info.metrics.droppedCount.Add(1)
+			atomic.AddUint64(&info.metrics.droppedCount, 1)
 			s.totalDropped.Add(1)
 			continue
@@ -621,68 +621,6 @@ func TestStreamReadsLongLine(t *testing.T) {
 	}
 }
 // blockedHandler wants UPDATE messages, has room on its queue for one, and
 // does not return from HandleMessage until release is closed.
 type blockedHandler struct {
 	release chan struct{}
 }
 func (blockedHandler) WantsMessage(messageType string) bool {
 	return messageType == ristypes.MessageTypeUpdate
 }
 func (blockedHandler) QueueCapacity() int { return 1 }
 func (h blockedHandler) HandleMessage(*ristypes.RISMessage) { <-h.release }
 // TestHandlerStatsReadWhileMessagesAreDropped has the server send a few UPDATE
 // lines to a blockedHandler, so the read loop drops all but the one the
 // handler holds and the one on its queue, while the test reads the handler's
 // statistics. The drop count must reach the number dropped, and the race
 // detector must find the count read and written safely.
 func TestHandlerStatsReadWhileMessagesAreDropped(t *testing.T) {
 	t.Parallel()
 	const (
 		lines       = 5
 		wantDropped = lines - 2
 		maxWait     = 5 * time.Second
 	)
 	srv := httptest.NewServer(http.HandlerFunc(
 		func(w http.ResponseWriter, r *http.Request) {
 			_, _ = io.WriteString(w, strings.Repeat(updateLine, lines))
 			flush(w)
 			<-r.Context().Done()
 		}))
 	defer srv.Close()
 	s := New(logger.New(), metrics.New())
 	s.url = srv.URL
 	handler := blockedHandler{release: make(chan struct{})}
 	s.RegisterHandler(handler)
 	err := s.Start(t.Context())
 	if err != nil {
 		t.Fatalf("Start returned error: %v", err)
 	}
 	defer s.Stop(t.Context())
 	defer close(handler.release)
 	// The test polls instead of waiting for a signal from the read loop: a
 	// signal would order the drops before the reads here, and the race
 	// detector would have nothing to report.
 	deadline := time.Now().Add(maxWait)
 	for s.GetHandlerStats()[0].DroppedCount < wantDropped {
 		if time.Now().After(deadline) {
 			t.Fatalf("fewer than %d messages counted as dropped within %s",
 				wantDropped, maxWait)
 		}
 	}
 }
 // TestPeerCountCountsEveryPeerHeardFrom has the server send an UPDATE from
 // stateDownPeer and a KEEPALIVE from another peer, with no OPEN from either,
 // and then a message that ends stateDownPeer's session: a NOTIFICATION, or a
@@ -126,26 +126,6 @@
            margin: 0;
            color: #2c3e50;
        }
        /* A click on a prefix list's heading folds or unfolds the list. Not
           every browser shows its own marker on a flex element, so the page
           hides it and draws a triangle before the heading. The triangle
           points down while the list is open. */
        summary.prefix-header {
            cursor: pointer;
            list-style: none;
        }
        summary.prefix-header::-webkit-details-marker {
            display: none;
        }
        summary.prefix-header h2::before {
            content: "\25B8";
            display: inline-block;
            margin-right: 10px;
            transition: transform 0.2s;
        }
        details[open] > summary.prefix-header h2::before {
            transform: rotate(90deg);
        }
        .prefix-count {
            background: #e74c3c;
            color: white;
@@ -253,20 +233,18 @@
                <div class="info-label">Peer ASNs</div>
                <div class="info-value">{{.PeerCount}}</div>
            </div>
            {{if not .ASN.FirstSeen.IsZero}}
            <div class="info-card">
                <div class="info-label">First Seen</div>
                <div class="info-value">{{.ASN.FirstSeen.Format "2006-01-02"}}</div>
            </div>
            {{end}}
        </div>
        {{if .IPv4Prefixes}}
-        <details class="prefix-section" open>
+        <div class="prefix-section">
-            <summary class="prefix-header">
+            <div class="prefix-header">
                <h2>IPv4 Prefixes</h2>
                <span class="prefix-count">{{.IPv4Count}}</span>
-            </summary>
+            </div>
            <table class="prefix-table">
                <thead>
                    <tr>
@@ -281,21 +259,21 @@
                    <tr>
                        <td><a href="{{.Prefix | prefixURL}}" class="prefix-link">{{.Prefix}}</a></td>
                        <td>/{{.MaskLength}}</td>
-                        <td>{{if not .LastUpdated.IsZero}}{{.LastUpdated.Format "2006-01-02 15:04:05"}}{{end}}</td>
+                        <td>{{.LastUpdated.Format "2006-01-02 15:04:05"}}</td>
-                        <td class="age">{{if not .LastUpdated.IsZero}}{{.LastUpdated | timeSince}}{{end}}</td>
+                        <td class="age">{{.LastUpdated | timeSince}}</td>
                    </tr>
                    {{end}}
                </tbody>
            </table>
-        </details>
+        </div>
        {{end}}
        {{if .IPv6Prefixes}}
-        <details class="prefix-section" open>
+        <div class="prefix-section">
-            <summary class="prefix-header">
+            <div class="prefix-header">
                <h2>IPv6 Prefixes</h2>
                <span class="prefix-count">{{.IPv6Count}}</span>
-            </summary>
+            </div>
            <table class="prefix-table">
                <thead>
                    <tr>
@@ -310,13 +288,13 @@
                    <tr>
                        <td><a href="{{.Prefix | prefixURL}}" class="prefix-link">{{.Prefix}}</a></td>
                        <td>/{{.MaskLength}}</td>
-                        <td>{{if not .LastUpdated.IsZero}}{{.LastUpdated.Format "2006-01-02 15:04:05"}}{{end}}</td>
+                        <td>{{.LastUpdated.Format "2006-01-02 15:04:05"}}</td>
-                        <td class="age">{{if not .LastUpdated.IsZero}}{{.LastUpdated | timeSince}}{{end}}</td>
+                        <td class="age">{{.LastUpdated | timeSince}}</td>
                    </tr>
                    {{end}}
                </tbody>
            </table>
-        </details>
+        </div>
        {{end}}
        {{if eq .TotalCount 0}}
@@ -107,15 +107,9 @@
        .stat-card.connected .stat-value {
            color: #27ae60;
        }
-        .stat-card.disconnected .stat-value,
+        .stat-card.disconnected .stat-value {
        .stale {
            color: #e74c3c;
        }
        /* The card has no room beside "Connected", so the spinner and "stale" go under it */
        #freshness {
            display: block;
            font-size: 20px;
        }
        /* Search section */
        .search-section {
@@ -180,38 +174,6 @@
        #asname-results .search-message {
            font-size: 13px;
        }
        #asname-results .error {
            color: #c00;
        }
        .asname-list {
            list-style: none;
            margin: 12px 0 0 0;
            padding: 0;
            max-height: 400px;
            overflow-y: auto;
        }
        .asname-list li {
            border-bottom: 1px solid #eee;
        }
        .asname-list a {
            display: block;
            padding: 8px 4px;
            color: #2c3e50;
            text-decoration: none;
            font-size: 14px;
        }
        .asname-list a:hover {
            background: #f5f5f5;
        }
        .asname-list .asn {
            font-weight: 600;
            color: #3498db;
        }
        .asname-list .description {
            display: block;
            color: #7f8c8d;
            font-size: 12px;
        }
        /* IP Lookup result */
        .ip-result {
@@ -239,8 +201,7 @@
            cursor: pointer;
            font-size: 12px;
        }
-        .ip-result pre,
+        .ip-result pre {
        #ip-api pre {
            background: #2c3e50;
            color: #ecf0f1;
            padding: 16px;
@@ -252,30 +213,18 @@
            max-height: 400px;
            overflow-y: auto;
        }
-        .ip-result .error,
+        .ip-result .error {
        #ip-api .error {
            background: #fee;
            color: #c00;
            padding: 12px;
            border-radius: 6px;
            font-size: 14px;
        }
-        .ip-result .loading,
+        .ip-result .loading {
        #ip-api .loading {
            color: #7f8c8d;
            font-style: italic;
        }
        /* IP information API card: the command, then its answer */
        #ip-api p {
            margin: 0;
            color: #7f8c8d;
            font-size: 14px;
        }
        #ip-api pre {
            margin-top: 12px;
        }
        /* Footer */
        .footer {
            margin-top: 40px;
@@ -316,10 +265,7 @@
    <main class="main-content">
        <div class="stats-grid">
            <div class="stat-card" id="status-card">
-                <div class="stat-value">
+                <div class="stat-value" id="stat-status">-</div>
                    <span id="stat-status">-</span>
                    <span id="freshness"></span>
                </div>
                <div class="stat-label">Status</div>
            </div>
            <div class="stat-card">
@@ -360,7 +306,7 @@
                    <input type="text" id="asname-input" placeholder="e.g., Google, Cloudflare" autocomplete="off">
                    <button type="submit">Search</button>
                </form>
-                <p class="search-hint">Search for autonomous systems by organization name or handle</p>
+                <p class="search-hint">Search for autonomous systems by organization name</p>
                <div id="asname-results"></div>
            </div>
@@ -380,13 +326,6 @@
                </div>
            </div>
        </div>
        <div class="search-card" id="ip-api">
            <h2>IP Information API</h2>
            <p>The API answers what RouteWatch knows about an IP address, such as its AS number and country. <code>/ip/</code> with no address answers for the caller's own address.</p>
            <pre id="ip-api-command" data-client-ip="{{.ClientIP}}"></pre>
            <pre id="ip-api-answer" class="loading">Loading...</pre>
        </div>
    </main>
    <footer class="footer">
@@ -398,44 +337,6 @@
    </footer>
    <script nonce="{{.CSPNonce}}">
        // The stats are fetched every REFRESH_PERIOD_MS. Next to the status, a
        // spinner turns one frame each time an answer counts more messages
        // than the one before. After STALE_AFTER_REFRESHES refreshes without
        // such an answer, the spinner gives way to "stale" and the time since.
        const REFRESH_PERIOD_MS = 5000;
        const STALE_AFTER_REFRESHES = 3;
        const MS_PER_SECOND = 1000;
        const SPINNER_FRAMES = ['⠋', '⠙', '⠹', '⠸', '⠼', '⠴', '⠦', '⠧', '⠇', '⠏'];
        const SPINNER_COLOURS = ['#e74c3c', '#e67e22', '#f1c40f', '#27ae60', '#3498db', '#9b59b6'];
        let spinnerFrame = 0;
        let lastMessageCount = null;
        let lastFreshAt = Date.now();
        // Turn the spinner when the message count has risen since the last answer.
        function noteMessageCount(count) {
            if (lastMessageCount !== null && count > lastMessageCount) {
                spinnerFrame = (spinnerFrame + 1) % SPINNER_FRAMES.length;
                lastFreshAt = Date.now();
            }
            lastMessageCount = count;
            showFreshness();
        }
        function showFreshness() {
            const freshness = document.getElementById('freshness');
            const sinceFreshMs = Date.now() - lastFreshAt;
            const stale = sinceFreshMs >= STALE_AFTER_REFRESHES * REFRESH_PERIOD_MS;
            freshness.classList.toggle('stale', stale);
            if (stale) {
                freshness.textContent = 'stale for ' + Math.floor(sinceFreshMs / MS_PER_SECOND) + 's';
                freshness.style.color = '';
                return;
            }
            freshness.textContent = SPINNER_FRAMES[spinnerFrame];
            freshness.style.color = SPINNER_COLOURS[spinnerFrame % SPINNER_COLOURS.length];
        }
        function formatNumber(num) {
            if (num >= 1000000) {
                return (num / 1000000).toFixed(1) + 'M';
@@ -457,7 +358,6 @@
                    const statusEl = document.getElementById('stat-status');
                    statusEl.textContent = data.connected ? 'Connected' : 'Disconnected';
                    statusCard.className = 'stat-card ' + (data.connected ? 'connected' : 'disconnected');
                    noteMessageCount(data.total_messages);
                    document.getElementById('stat-routes').textContent = formatNumber(data.live_routes);
                    document.getElementById('stat-asns').textContent = formatNumber(data.asns);
@@ -468,7 +368,7 @@
                    }
                    const totalUpdates = data.ipv4_updates_per_sec + data.ipv6_updates_per_sec;
-                    document.getElementById('stat-updates').textContent = Math.round(totalUpdates).toLocaleString();
+                    document.getElementById('stat-updates').textContent = totalUpdates.toFixed(1);
                })
                .catch(() => {
                    document.getElementById('stat-status').textContent = 'Error';
@@ -487,82 +387,24 @@
            }
        });
-        // AS name search. The handles and descriptions come from outside data,
+        // AS name search
        // so the results are built with textContent, never innerHTML.
        const asNameResults = document.getElementById('asname-results');
        // Replace the search results with one line of text.
        function showASNameMessage(text, className) {
            const line = document.createElement('p');
            line.className = className;
            line.textContent = text;
            asNameResults.replaceChildren(line);
        }
        // List the matches of a search answer, each as a link to its AS page,
        // and say how many more matched than the answer holds.
        function showASNameMatches(data) {
            if (data.total === 0) {
                showASNameMessage('No AS matches "' + data.query + '".', 'search-message');
                return;
            }
            const list = document.createElement('ul');
            list.className = 'asname-list';
            for (const match of data.results) {
                const asn = document.createElement('span');
                asn.className = 'asn';
                asn.textContent = 'AS' + match.asn;
                const description = document.createElement('span');
                description.className = 'description';
                description.textContent = match.description;
                const link = document.createElement('a');
                link.href = '/as/' + match.asn;
                link.append(asn, ' ' + match.handle, description);
                const item = document.createElement('li');
                item.append(link);
                list.append(item);
            }
            asNameResults.replaceChildren(list);
            const more = data.total - data.results.length;
            if (more > 0) {
                const line = document.createElement('p');
                line.className = 'search-message';
                line.textContent = more.toLocaleString() + ' more matched. Narrow the search to see them.';
                asNameResults.append(line);
            }
        }
        document.getElementById('asname-form').addEventListener('submit', function(e) {
            e.preventDefault();
            const query = document.getElementById('asname-input').value.trim();
            if (!query) return;
-            // A number, or AS and a number, opens that AS's page
+            const resultsDiv = document.getElementById('asname-results');
-            const asn = query.replace(/^AS/i, '');
+            resultsDiv.innerHTML = '<p class="loading">Searching...</p>';
-            if (/^\d+$/.test(asn)) {
+
-                window.location.href = '/as/' + asn;
+            // Use a simple client-side search against the asinfo data
            // For now, redirect to AS page if it looks like an ASN
            if (/^\d+$/.test(query)) {
                window.location.href = '/as/' + query;
                return;
            }
-            showASNameMessage('Searching...', 'loading');
+            // Show a message that server-side search is coming
-
+            resultsDiv.innerHTML = '<p class="search-message">AS name search coming soon. For now, try an AS number.</p>';
            fetch('/api/v1/search/as?q=' + encodeURIComponent(query))
                .then(response => response.json())
                .then(response => {
                    if (response.status === 'error') {
                        showASNameMessage('Error: ' + response.error.msg, 'error');
                    } else {
                        showASNameMatches(response.data);
                    }
                })
                .catch(error => {
                    showASNameMessage('Error: ' + error.message, 'error');
                });
        });
        // IP lookup
@@ -604,33 +446,9 @@
            document.getElementById('ip-input').value = '';
        });
-        // IP information API card: show the curl command that asks /ip/ about
+        // Initial load and refresh stats every 5 seconds
        // the visitor's own address, then make that same request and show the
        // JSON it answers, an error answer included. The answer holds outside
        // data, so it is set with textContent, never innerHTML.
        const ipAPICommand = document.getElementById('ip-api-command');
        const ipAPIAnswer = document.getElementById('ip-api-answer');
        const ipAPIURL = window.location.origin + '/ip/' + ipAPICommand.dataset.clientIp;
        ipAPICommand.textContent = 'curl ' + ipAPIURL;
        fetch(ipAPIURL)
            .then(response => response.json())
            .then(answer => {
                ipAPIAnswer.className = '';
                ipAPIAnswer.textContent = JSON.stringify(answer, null, 2);
            })
            .catch(error => {
                ipAPIAnswer.className = 'error';
                ipAPIAnswer.textContent = 'Error: ' + error.message;
            });
        // Initial load and refresh stats every REFRESH_PERIOD_MS. The freshness
        // check runs every second on its own, so a request that never returns
        // still turns the spinner into "stale".
        updateStats();
-        setInterval(updateStats, REFRESH_PERIOD_MS);
+        setInterval(updateStats, 5000);
        setInterval(showFreshness, MS_PER_SECOND);
    </script>
 </body>
 </html>
@@ -329,8 +329,8 @@
                        <td class="peer-ip">{{.PeerIP}}</td>
                        <td class="as-path">{{range $i, $as := .ASPathWithHandle}}{{if $i}} → {{end}}<a href="/as/{{$as.ASN}}" class="as-link">{{if $as.Handle}}{{$as.Handle}}{{else}}AS{{$as.ASN}}{{end}}</a>{{end}}</td>
                        <td class="peer-ip">{{.NextHop}}</td>
-                        <td>{{if not .LastUpdated.IsZero}}{{.LastUpdated.Format "2006-01-02 15:04:05"}}{{end}}</td>
+                        <td>{{.LastUpdated.Format "2006-01-02 15:04:05"}}</td>
-                        <td class="age">{{if not .LastUpdated.IsZero}}{{.LastUpdated | timeSince}}{{end}}</td>
+                        <td class="age">{{.LastUpdated | timeSince}}</td>
                    </tr>
                    {{end}}
                </tbody>
@@ -126,8 +126,7 @@
        .connected {
            color: #22c55e;
        }
-        .disconnected,
+        .disconnected {
        .stale {
            color: #ef4444;
        }
        .error {
@@ -181,10 +180,7 @@
            <h2>RouteWatch</h2>
            <div class="metric">
                <span class="metric-label">Status</span>
                <span>
                <span class="metric-value" id="connected">-</span>
                    <span class="metric-value" id="freshness"></span>
                </span>
            </div>
            <div class="metric">
                <span class="metric-label">Uptime</span>
@@ -235,8 +231,8 @@
                <span class="metric-value" id="withdrawals">-</span>
            </div>
            <div class="metric">
-                <span class="metric-label">Route Churn/min</span>
+                <span class="metric-label">Route Churn/sec</span>
-                <span class="metric-value" id="route_churn_per_min">-</span>
+                <span class="metric-value" id="route_churn_per_sec">-</span>
            </div>
            <div class="metric">
                <span class="metric-label">Total Data</span>
@@ -318,10 +314,6 @@
                <span class="metric-label">IPv6 Routes</span>
                <span class="metric-value" id="ipv6_routes">-</span>
            </div>
            <div class="metric">
                <span class="metric-label">Origins Without a Kept Route</span>
                <span class="metric-value" id="origins_without_kept_route">-</span>
            </div>
            <div class="metric">
                <span class="metric-label">IPv4 Updates/sec</span>
                <span class="metric-value" id="ipv4_updates_per_sec">-</span>
@@ -394,44 +386,6 @@
    </div>
    <script nonce="{{.CSPNonce}}">
        // The stats are fetched every REFRESH_PERIOD_MS. Next to the status, a
        // spinner turns one frame each time an answer counts more messages
        // than the one before. After STALE_AFTER_REFRESHES refreshes without
        // such an answer, the spinner gives way to "stale" and the time since.
        const REFRESH_PERIOD_MS = 2000;
        const STALE_AFTER_REFRESHES = 3;
        const MS_PER_SECOND = 1000;
        const SPINNER_FRAMES = ['⠋', '⠙', '⠹', '⠸', '⠼', '⠴', '⠦', '⠧', '⠇', '⠏'];
        const SPINNER_COLOURS = ['#e74c3c', '#e67e22', '#f1c40f', '#27ae60', '#3498db', '#9b59b6'];
        let spinnerFrame = 0;
        let lastMessageCount = null;
        let lastFreshAt = Date.now();
        // Turn the spinner when the message count has risen since the last answer.
        function noteMessageCount(count) {
            if (lastMessageCount !== null && count > lastMessageCount) {
                spinnerFrame = (spinnerFrame + 1) % SPINNER_FRAMES.length;
                lastFreshAt = Date.now();
            }
            lastMessageCount = count;
            showFreshness();
        }
        function showFreshness() {
            const freshness = document.getElementById('freshness');
            const sinceFreshMs = Date.now() - lastFreshAt;
            const stale = sinceFreshMs >= STALE_AFTER_REFRESHES * REFRESH_PERIOD_MS;
            freshness.classList.toggle('stale', stale);
            if (stale) {
                freshness.textContent = 'stale for ' + Math.floor(sinceFreshMs / MS_PER_SECOND) + 's';
                freshness.style.color = '';
                return;
            }
            freshness.textContent = SPINNER_FRAMES[spinnerFrame];
            freshness.style.color = SPINNER_COLOURS[spinnerFrame % SPINNER_COLOURS.length];
        }
        function formatBytes(bytes) {
            if (bytes === 0) return '0 B';
            const k = 1024;
@@ -557,7 +511,7 @@
            document.getElementById('messages_per_sec').textContent = '-';
            document.getElementById('announcements').textContent = '-';
            document.getElementById('withdrawals').textContent = '-';
-            document.getElementById('route_churn_per_min').textContent = '-';
+            document.getElementById('route_churn_per_sec').textContent = '-';
            document.getElementById('total_wire_bytes').textContent = '-';
            document.getElementById('wire_mbits_per_sec').textContent = '-';
            document.getElementById('gc_num').textContent = '-';
@@ -575,7 +529,6 @@
            document.getElementById('live_routes').textContent = '-';
            document.getElementById('ipv4_routes').textContent = '-';
            document.getElementById('ipv6_routes').textContent = '-';
            document.getElementById('origins_without_kept_route').textContent = '-';
            document.getElementById('ipv4_updates_per_sec').textContent = '-';
            document.getElementById('ipv6_updates_per_sec').textContent = '-';
            document.getElementById('oldest_route').textContent = '-';
@@ -616,7 +569,6 @@
                    const connectedEl = document.getElementById('connected');
                    connectedEl.textContent = data.connected ? 'Connected' : 'Disconnected';
                    connectedEl.className = 'metric-value ' + (data.connected ? 'connected' : 'disconnected');
                    noteMessageCount(data.total_messages);
                    // Update all metrics
                    document.getElementById('uptime').textContent = data.uptime;
@@ -626,7 +578,7 @@
                    document.getElementById('connection_duration').textContent = data.connection_duration;
                    document.getElementById('reconnect_count').textContent = formatNumber(data.reconnect_count);
                    document.getElementById('total_messages').textContent = formatNumber(data.total_messages);
-                    document.getElementById('messages_per_sec').textContent = formatNumber(Math.round(data.messages_per_sec));
+                    document.getElementById('messages_per_sec').textContent = data.messages_per_sec.toFixed(1);
                    document.getElementById('total_wire_bytes').textContent = formatBytes(data.total_wire_bytes);
                    document.getElementById('wire_mbits_per_sec').textContent = data.wire_mbits_per_sec.toFixed(2) + ' Mbps';
                    document.getElementById('asns').textContent = formatNumber(data.asns);
@@ -639,9 +591,8 @@
                    document.getElementById('live_routes').textContent = formatNumber(data.live_routes);
                    document.getElementById('ipv4_routes').textContent = formatNumber(data.ipv4_routes);
                    document.getElementById('ipv6_routes').textContent = formatNumber(data.ipv6_routes);
-                    document.getElementById('origins_without_kept_route').textContent = formatNumber(data.origins_without_kept_route);
+                    document.getElementById('ipv4_updates_per_sec').textContent = data.ipv4_updates_per_sec.toFixed(1);
-                    document.getElementById('ipv4_updates_per_sec').textContent = formatNumber(Math.round(data.ipv4_updates_per_sec));
+                    document.getElementById('ipv6_updates_per_sec').textContent = data.ipv6_updates_per_sec.toFixed(1);
                    document.getElementById('ipv6_updates_per_sec').textContent = formatNumber(Math.round(data.ipv6_updates_per_sec));
                    document.getElementById('oldest_route').textContent = formatRelativeTime(data.oldest_route);
                    document.getElementById('newest_route').textContent = formatRelativeTime(data.newest_route);
@@ -650,7 +601,7 @@
                        document.getElementById('bgp_peer_count').textContent = formatNumber(data.stream.bgp_peer_count);
                        document.getElementById('announcements').textContent = formatNumber(data.stream.announcements);
                        document.getElementById('withdrawals').textContent = formatNumber(data.stream.withdrawals);
-                        document.getElementById('route_churn_per_min').textContent = formatNumber(data.stream.route_churn_per_min);
+                        document.getElementById('route_churn_per_sec').textContent = data.stream.route_churn_per_sec.toFixed(1);
                    }
                    // Update GC stats
@@ -692,12 +643,9 @@
                });
        }
-        // Update immediately and then every REFRESH_PERIOD_MS. The freshness
+        // Update immediately and then every 2 seconds
        // check runs every second on its own, so a request that never returns
        // still turns the spinner into "stale".
        updateStatus();
-        setInterval(updateStatus, REFRESH_PERIOD_MS);
+        setInterval(updateStatus, 2000);
        setInterval(showFreshness, MS_PER_SECOND);
    </script>
    </main>
@@ -7,9 +7,9 @@ import (
 	"net/url"
 	"strings"
 	"sync"
 	"time"
 	"git.eeqj.de/sneak/routewatch/internal/version"
 	"github.com/dustin/go-humanize"
 )
 //go:embed index.html
@@ -48,7 +48,48 @@ var (
 	once sync.Once
 )
-const cidrPartCount = 2 // A CIDR has two parts: prefix and length
+const (
 	hoursPerDay   = 24
 	daysPerMonth  = 30
 	cidrPartCount = 2 // A CIDR has two parts: prefix and length
 )
 // timeSince returns a human-readable duration since the given time
 func timeSince(t time.Time) string {
 	duration := time.Since(t)
 	if duration < time.Minute {
 		return "just now"
 	}
 	if duration < time.Hour {
 		minutes := int(duration.Minutes())
 		if minutes == 1 {
 			return "1 minute ago"
 		}
 		return duration.Truncate(time.Minute).String() + " ago"
 	}
 	if duration < hoursPerDay*time.Hour {
 		hours := int(duration.Hours())
 		if hours == 1 {
 			return "1 hour ago"
 		}
 		return duration.Truncate(time.Hour).String() + " ago"
 	}
 	days := int(duration.Hours() / hoursPerDay)
 	if days == 1 {
 		return "1 day ago"
 	}
 	if days < daysPerMonth {
 		return duration.Truncate(hoursPerDay*time.Hour).String() + " ago"
 	}
 	return t.Format("2006-01-02")
 }
 // prefixURL generates a URL path for a prefix in CIDR notation.
 // Takes a prefix like "192.168.1.0/24" and returns "/prefix/192.168.1.0/24"
@@ -72,7 +113,7 @@ func initTemplates() {
 	// Create common template functions
 	funcs := template.FuncMap{
-		"timeSince":       humanize.Time,
+		"timeSince":       timeSince,
 		"urlEncode":       url.QueryEscape,
 		"prefixURL":       prefixURL,
 		"appName":         func() string { return version.Name },
@@ -1,182 +0,0 @@
 package templates_test
 import (
 	"bytes"
 	"html/template"
 	"strings"
 	"testing"
 	"git.eeqj.de/sneak/routewatch/internal/database"
 	"git.eeqj.de/sneak/routewatch/internal/server"
 	"git.eeqj.de/sneak/routewatch/internal/templates"
 )
 // renderPage renders a page with the data every page needs, and the visitor's
 // address, which the home page also needs.
 func renderPage(t *testing.T, tmpl *template.Template) string {
 	t.Helper()
 	var page bytes.Buffer
 	err := tmpl.Execute(&page, struct{ CSPNonce, ClientIP string }{})
 	if err != nil {
 		t.Fatalf("rendering the page: %v", err)
 	}
 	return page.String()
 }
 // TestFooterLicense renders the home and status pages and expects each footer
 // to name the licence in LICENSE, MIT, and not WTFPL.
 func TestFooterLicense(t *testing.T) {
 	t.Parallel()
 	const (
 		license      = "MIT"
 		wrongLicense = "WTFPL"
 	)
 	pages := map[string]*template.Template{
 		"index":  templates.IndexTemplate(),
 		"status": templates.StatusTemplate(),
 	}
 	for name, tmpl := range pages {
 		t.Run(name, func(t *testing.T) {
 			t.Parallel()
 			_, footer, found := strings.Cut(renderPage(t, tmpl), "<footer")
 			if !found {
 				t.Fatal("the page has no footer")
 			}
 			footer, _, _ = strings.Cut(footer, "</footer>")
 			if !strings.Contains(footer, license) {
 				t.Errorf("footer does not name %s: %q", license, footer)
 			}
 			if strings.Contains(footer, wrongLicense) {
 				t.Errorf("footer names %s: %q", wrongLicense, footer)
 			}
 		})
 	}
 }
 // TestFreshnessIndicator renders the home and status pages and expects each to
 // have, right after the status element, the element where the page's script
 // shows its spinner or "stale".
 func TestFreshnessIndicator(t *testing.T) {
 	t.Parallel()
 	pages := map[string]struct {
 		tmpl      *template.Template
 		status    string
 		indicator string
 	}{
 		"index": {
 			tmpl:      templates.IndexTemplate(),
 			status:    `<span id="stat-status">-</span>`,
 			indicator: `<span id="freshness"></span>`,
 		},
 		"status": {
 			tmpl:      templates.StatusTemplate(),
 			status:    `<span class="metric-value" id="connected">-</span>`,
 			indicator: `<span class="metric-value" id="freshness"></span>`,
 		},
 	}
 	for name, page := range pages {
 		t.Run(name, func(t *testing.T) {
 			t.Parallel()
 			_, afterStatus, found := strings.Cut(renderPage(t, page.tmpl), page.status)
 			if !found {
 				t.Fatalf("the page has no status element %s", page.status)
 			}
 			if !strings.HasPrefix(strings.TrimSpace(afterStatus), page.indicator) {
 				t.Errorf("the status element is not followed by %s", page.indicator)
 			}
 		})
 	}
 }
 // TestASDetailPrefixListsFold renders the AS page with one IPv4 and one IPv6
 // prefix. It expects each prefix list inside its own <details> element that
 // starts open and whose <summary> holds the list's heading, so that a click on
 // the heading folds the list.
 func TestASDetailPrefixListsFold(t *testing.T) {
 	t.Parallel()
 	const (
 		asn      = 64500
 		prefixV4 = "192.0.2.0/24"
 		prefixV6 = "2001:db8::/32"
 	)
 	ipv4 := []server.LiveRoute{{Prefix: prefixV4}}
 	ipv6 := []server.LiveRoute{{Prefix: prefixV6}}
 	// The fields the AS page handler gives the template.
 	data := struct {
 		ASN          *database.ASN
 		IPv4Prefixes []server.LiveRoute
 		IPv6Prefixes []server.LiveRoute
 		TotalCount   int
 		IPv4Count    int
 		IPv6Count    int
 		Peers        []database.ASPeer
 		PeerCount    int
 		CSPNonce     string
 	}{
 		ASN:          &database.ASN{ASN: asn},
 		IPv4Prefixes: ipv4,
 		IPv6Prefixes: ipv6,
 		TotalCount:   len(ipv4) + len(ipv6),
 		IPv4Count:    len(ipv4),
 		IPv6Count:    len(ipv6),
 	}
 	var rendered bytes.Buffer
 	err := templates.ASDetailTemplate().Execute(&rendered, data)
 	if err != nil {
 		t.Fatalf("rendering the page: %v", err)
 	}
 	page := rendered.String()
 	lists := []struct{ heading, prefix string }{
 		{"IPv4 Prefixes", prefixV4},
 		{"IPv6 Prefixes", prefixV6},
 	}
 	for _, list := range lists {
 		before, _, found := strings.Cut(page, list.prefix)
 		if !found {
 			t.Fatalf("the page does not list %s", list.prefix)
 		}
 		// The list's section starts at the last <details before its prefix.
 		start := strings.LastIndex(before, "<details")
 		if start < 0 || strings.Contains(before[start:], "</details>") {
 			t.Errorf("%s: the list is not inside a <details> element", list.heading)
 			continue
 		}
 		tag, section, _ := strings.Cut(before[start:], ">")
 		if !strings.Contains(tag, " open") {
 			t.Errorf("%s: the <details> element does not start open: %s>",
 				list.heading, tag)
 		}
 		_, summary, _ := strings.Cut(section, "<summary")
 		summary, _, _ = strings.Cut(summary, "</summary>")
 		if !strings.Contains(summary, list.heading) {
 			t.Errorf("%s: the <summary> does not hold the heading", list.heading)
 		}
 	}
 }
@@ -19,8 +19,8 @@ const (
 	Author = "@sneak"
 	// AuthorURL is the author's website
 	AuthorURL = "https://sneak.berlin"
-	// License is the program license, as LICENSE grants it
+	// License is the program license
-	License = "MIT"
+	License = "WTFPL"
 	// RepoURL is the git repository URL
 	RepoURL = "https://git.eeqj.de/sneak/routewatch"
 )
@@ -7,15 +7,10 @@ import (
 	"errors"
 	"fmt"
 	"io"
 	"log/slog"
 	"net"
 	"regexp"
 	"strings"
 	"sync"
 	"time"
 	"unicode/utf8"
 	"golang.org/x/text/encoding/charmap"
 )
 // Timeout constants for WHOIS queries.
@@ -31,18 +26,10 @@ const maxAnswerSize = 1 << 20
 // Parsing constants.
 const (
 	keyValueParts       = 2 // Expected parts when splitting "key: value"
 	lacnicDateFormatLen = 8 // Length of YYYYMMDD date format
 )
 // The classes of the two objects that describe an AS in an answer from
 // RIPE, APNIC or AFRINIC, and the key of the aut-num object's line that
 // gives the ID of the AS's organisation object.
 const (
 	autNumClass       = "aut-num"
 	organisationClass = "organisation"
 	orgKey            = "org"
 )
 // WHOIS server addresses.
 const (
 	whoisServerIANA    = "whois.iana.org:43"
@@ -51,32 +38,8 @@ const (
 	whoisServerAPNIC   = "whois.apnic.net:43"
 	whoisServerLACNIC  = "whois.lacnic.net:43"
 	whoisServerAFRINIC = "whois.afrinic.net:43"
 	// NIC.br registers Brazil's ASes under LACNIC.
 	whoisServerNICbr = "whois.registro.br:43"
 )
 // nicbrHeader starts the copyright notice at the top of NIC.br's WHOIS
 // answers. LACNIC's answer for an AS that NIC.br registers is NIC.br's, and
 // carries the same notice:
 //
 //	% Copyright (c) Nic.br - Use of this data is governed by the Use and
 //	% Privacy Policy at https://registro.br/upp . Distribution,
 const nicbrHeader = "% Copyright (c) Nic.br"
 // nicbrLimitReached is in the line that marks NIC.br's reduced answer to a
 // client over its query limit. NIC.br publishes no limit. Its Use and
 // Privacy Policy, https://registro.br/upp, says only that it restricts
 // queries to stop the data being taken in bulk.
 const nicbrLimitReached = "Query rate limit exceeded"
 // NICbrSkipTime is how long the client stops asking NIC.br after NIC.br
 // answers that the client is over its query limit. NIC.br publishes
 // neither the limit nor how long it lasts. An hour outlasts a limit
 // counted per minute or per hour. The ASes looked up meanwhile get
 // NIC.br's fields when they are next refreshed.
 const NICbrSkipTime = time.Hour
 // RIR identifiers.
 const (
 	RIRARIN   = "ARIN"
@@ -86,31 +49,6 @@ const (
 	RIRAFRNIC = "AFRINIC"
 )
 // noPersonalFlag keeps person and role objects out of an answer. The
 // organisation object stays in it. RIPE counts the person and role objects
 // it returns against a daily limit per IP address. Role objects for abuse
 // contacts do not count. RIPE refuses an address for good that passes the
 // limit too often:
 // https://docs.db.ripe.net/Types-of-Queries/Access-Control-for-Queries/
 //
 // RIPE documents the flag here:
 // https://docs.db.ripe.net/Types-of-Queries/Referenced-Objects-in-Query-Response/
 // APNIC and AFRINIC list it in their answers to the query "help". AFRINIC
 // sends readers to that answer for its full list of flags:
 // https://afrinic.net/whois-getting-started
 const noPersonalFlag = "--no-personal"
 // The error lines with which RIPE's database software refuses a query:
 // access denied to the client's IP address, and that address's limit
 // reached. APNIC and AFRINIC run the same software. The lines are listed
 // under "Access Errors" on this page, whose URL is split over two lines:
 // https://docs.db.ripe.net/Appendices/
 // Appendix-C--RIPE-Database-Query-Server-Response-Codes-and-Messages/
 const (
 	accessDeniedError = "%ERROR:201:"
 	accessLimitError  = "%ERROR:202:"
 )
 // Errors LookupASN returns when a WHOIS answer has nothing to store.
 var (
 	// ErrNoReferral is returned when IANA refers the AS to no RIR, as it
@@ -120,7 +58,6 @@ var (
 	errNoASBlock = errors.New("IANA answered with neither a referral " +
 		"nor an AS block")
 	errNoFields       = errors.New("RIR answered with no WHOIS fields")
 	errRefused        = errors.New("RIR refused the query")
 	errUnknownServer  = errors.New("IANA refers the AS to a server no RIR runs")
 	errAnswerTooLarge = errors.New("WHOIS answer reached the size cap")
 )
@@ -149,42 +86,21 @@ type Client struct {
 	// host:port. NewClient sets a net.Dialer's; tests replace it to reach
 	// local servers instead.
 	DialContext func(ctx context.Context, network, address string) (net.Conn, error)
 	// Now returns the current time. NewClient sets time.Now; tests replace
 	// it to move the clock.
 	Now func() time.Time
 	logger *slog.Logger
 	// mu guards nicbrSkipUntil.
 	mu sync.Mutex
 	// nicbrSkipUntil is when the client next asks NIC.br, after NIC.br
 	// answered that the client is over its query limit.
 	nicbrSkipUntil time.Time
 }
-// NewClient creates a new WHOIS client that logs to logger.
+// NewClient creates a new WHOIS client.
-func NewClient(logger *slog.Logger) *Client {
+func NewClient() *Client {
 	dialer := &net.Dialer{Timeout: dialTimeout}
-	return &Client{
+	return &Client{DialContext: dialer.DialContext}
 		DialContext: dialer.DialContext,
 		Now:         time.Now,
 		logger:      logger,
 	}
 }
 // LookupASN asks IANA which RIR holds the given ASN, asks that RIR, and
-// returns what the RIR's answer says. When LACNIC's answer is NIC.br's, it
+// returns what the RIR's answer says. It returns ErrNoReferral when IANA
-// returns what NIC.br's own server says instead, unless that query fails or
+// refers the AS to no RIR, and another error when a query fails, when IANA's
-// is skipped, as askNICbr says.
+// answer has neither a referral nor the AS's block, when IANA refers the AS
-//
+// to a server none of the five RIRs run, or when the RIR's answer carries
-// It returns ErrNoReferral when IANA refers the AS to no RIR, and another
+// none of ASNInfo's fields, as a refusal of service does.
 // error when the query to IANA or to the RIR fails, when the RIR refuses
 // it, when IANA's answer has neither a referral nor the AS's block, when
 // IANA refers the AS to a server none of the five RIRs run, or when the
 // answer carries none of ASNInfo's fields.
 func (c *Client) LookupASN(ctx context.Context, asn int) (*ASNInfo, error) {
 	// Query IANA first to find the authoritative RIR
 	query := fmt.Sprintf("AS%d", asn)
@@ -211,82 +127,23 @@ func (c *Client) LookupASN(ctx context.Context, asn int) (*ASNInfo, error) {
 	}
 	// Query the authoritative RIR
-	rirResp, err := c.queryRIR(ctx, whoisServer, rirQuery(rir, query))
+	rirResp, err := c.query(ctx, whoisServer, query)
 	if err != nil {
 		return nil, fmt.Errorf("RIR query failed: %w", err)
 	}
-	// The fields never come from IANA's answer, which describes the block
+	// The fields come from the RIR's answer alone: IANA's describes the
-	// the AS is in.
+	// block the AS is in.
 	info := c.parseResponse(asn, rir, rirResp)
 	if rir == RIRLACNIC && strings.Contains(rirResp, nicbrHeader) {
 		info = c.askNICbr(ctx, query, info)
 	}
 	if info.isEmpty() {
 		return nil, fmt.Errorf("%s from %s: %w", query, whoisServer, errNoFields)
 	}
-	info.RawResponse = ianaResp + "\n" + info.RawResponse
+	info.RawResponse = ianaResp + "\n" + rirResp
 	return info, nil
 }
 // askNICbr asks NIC.br's server about an AS whose answer from LACNIC is
 // NIC.br's, and returns what NIC.br's answer says. LACNIC replaces each
 // accented letter in such an answer with U+FFFD. NIC.br's own server keeps
 // them, in Latin-1.
 //
 // askNICbr returns lacnicInfo, what LACNIC's answer says, and logs a
 // warning when the query fails, when NIC.br sends the reduced answer for a
 // client over its limit, or when NIC.br's answer carries none of ASNInfo's
 // fields. After the reduced answer, it returns lacnicInfo without asking
 // NIC.br until NICbrSkipTime has passed.
 func (c *Client) askNICbr(
 	ctx context.Context, asQuery string, lacnicInfo *ASNInfo,
 ) *ASNInfo {
 	asn := lacnicInfo.ASN
 	c.mu.Lock()
 	skipping := c.Now().Before(c.nicbrSkipUntil)
 	c.mu.Unlock()
 	if skipping {
 		return lacnicInfo
 	}
 	answer, err := c.query(ctx, whoisServerNICbr, asQuery)
 	if err != nil {
 		c.logger.Warn("NIC.br query failed, keeping LACNIC's fields",
 			"asn", asn, "error", err)
 		return lacnicInfo
 	}
 	if strings.Contains(answer, nicbrLimitReached) {
 		c.mu.Lock()
 		c.nicbrSkipUntil = c.Now().Add(NICbrSkipTime)
 		c.mu.Unlock()
 		c.logger.Warn("NIC.br answered that the client is over its query "+
 			"limit, keeping LACNIC's fields and skipping NIC.br",
 			"asn", asn, "skip_for", NICbrSkipTime)
 		return lacnicInfo
 	}
 	info := c.parseResponse(asn, RIRLACNIC, answer)
 	if info.isEmpty() {
 		c.logger.Warn("NIC.br answered with no WHOIS fields, "+
 			"keeping LACNIC's fields", "asn", asn)
 		return lacnicInfo
 	}
 	return info
 }
 // isEmpty reports whether info holds none of the fields a WHOIS answer
 // fills, as when the answer is only comment and error lines.
 func (info *ASNInfo) isEmpty() bool {
@@ -297,41 +154,8 @@ func (info *ASNInfo) isEmpty() bool {
 		info.RegDate == nil && info.LastMod == nil
 }
-// rirQuery returns the query sent to rir's server for asQuery, an AS
+// query performs a raw WHOIS query to the specified server. An answer that
-// number such as "AS3333". RIPE, APNIC and AFRINIC are asked to keep person
+// reaches maxAnswerSize is an error.
 // and role objects out of the answer.
 func rirQuery(rir, asQuery string) string {
 	switch rir {
 	case RIRRIPE, RIRAPNIC, RIRAFRNIC:
 		return noPersonalFlag + " " + asQuery
 	default:
 		return asQuery
 	}
 }
 // queryRIR sends query to an RIR's server and returns the answer. An answer
 // holding an error line with which the server refuses the query is an
 // error, and the error holds that line.
 func (c *Client) queryRIR(
 	ctx context.Context, server, query string,
 ) (string, error) {
 	answer, err := c.query(ctx, server, query)
 	if err != nil {
 		return "", err
 	}
 	for line := range strings.SplitSeq(answer, "\n") {
 		if strings.HasPrefix(line, accessDeniedError) ||
 			strings.HasPrefix(line, accessLimitError) {
 			return "", fmt.Errorf("%w: %s", errRefused, line)
 		}
 	}
 	return answer, nil
 }
 // query performs a raw WHOIS query to the specified server and returns the
 // answer in UTF-8. An answer that reaches maxAnswerSize is an error.
 func (c *Client) query(ctx context.Context, server, query string) (string, error) {
 	conn, err := c.DialContext(ctx, "tcp", server)
 	if err != nil {
@@ -378,25 +202,7 @@ func (c *Client) query(ctx context.Context, server, query string) (string, error
 		return "", fmt.Errorf("read response: %w", errAnswerTooLarge)
 	}
-	return toUTF8(sb.String())
+	return sb.String(), nil
 }
 // toUTF8 returns a WHOIS answer in UTF-8. An answer that is valid UTF-8 is
 // returned as it is. Any other answer is decoded as Latin-1, which RIPE,
 // APNIC and NIC.br send. LACNIC, ARIN and AFRINIC send UTF-8. RIPE's
 // database working group lists the five RIRs here:
 // https://www.ripe.net/ripe/mail/archives/db-wg/2024-May/008075.html
 func toUTF8(answer string) (string, error) {
 	if utf8.ValidString(answer) {
 		return answer, nil
 	}
 	decoded, err := charmap.ISO8859_1.NewDecoder().String(answer)
 	if err != nil {
 		return "", fmt.Errorf("decode Latin-1 answer: %w", err)
 	}
 	return decoded, nil
 }
 // parseIANAReferral extracts the RIR and WHOIS server from an IANA response.
@@ -432,9 +238,7 @@ func (c *Client) parseIANAReferral(response string) (string, string, error) {
 	return "", "", nil
 }
-// parseResponse extracts ASN information from a WHOIS response. Of an
+// parseResponse extracts ASN information from a WHOIS response.
 // answer from RIPE, APNIC or AFRINIC it reads only the lines asObjectLines
 // returns. Of an answer from ARIN or LACNIC it reads every line.
 func (c *Client) parseResponse(asn int, rir, response string) *ASNInfo {
 	info := &ASNInfo{
 		ASN:         asn,
@@ -443,15 +247,26 @@ func (c *Client) parseResponse(asn int, rir, response string) *ASNInfo {
 	}
 	lines := strings.Split(response, "\n")
 	if rir == RIRRIPE || rir == RIRAPNIC || rir == RIRAFRNIC {
 		lines = asObjectLines(lines)
 	}
 	var addressLines []string
 	for _, line := range lines {
-		key, value, ok := splitField(line)
+		line = strings.TrimSpace(line)
-		if !ok || value == "" {
+		if line == "" || strings.HasPrefix(line, "%") ||
 			strings.HasPrefix(line, "#") {
 			continue
 		}
 		// Split on first colon
 		parts := strings.SplitN(line, ":", keyValueParts)
 		if len(parts) != keyValueParts {
 			continue
 		}
 		key := strings.TrimSpace(strings.ToLower(parts[0]))
 		value := strings.TrimSpace(parts[1])
 		if value == "" {
 			continue
 		}
@@ -478,72 +293,6 @@ func (c *Client) parseResponse(asn int, rir, response string) *ASNInfo {
 	return info
 }
 // splitField splits a "key: value" line of a WHOIS answer into its key, in
 // lower case, and its value. The third result is false for a line that
 // holds no field: a blank line, a comment line or a line without a colon.
 func splitField(line string) (string, string, bool) {
 	line = strings.TrimSpace(line)
 	if strings.HasPrefix(line, "%") || strings.HasPrefix(line, "#") {
 		return "", "", false
 	}
 	key, value, ok := strings.Cut(line, ":")
 	return strings.ToLower(strings.TrimSpace(key)), strings.TrimSpace(value), ok
 }
 // asObjectLines returns the lines of the aut-num object in an answer from
 // RIPE, APNIC or AFRINIC, followed by the lines of the organisation object
 // whose ID the aut-num object gives on its "org:" line. The answer's other
 // objects are left out. RIPE and APNIC start their answer with the
 // as-block object of the block the AS is in, whose dates are not the AS's.
 //
 // These answers are in RPSL. A blank line ends an object. An object's first
 // line has the object's class as its key and the object's ID as its value,
 // as in "organisation: ORG-APNI1-AP".
 func asObjectLines(lines []string) []string {
 	var autNum []string
 	// The lines of each organisation object, by its ID.
 	organisations := make(map[string][]string)
 	// The class and ID of the object the line is in, "" between objects.
 	var class, id string
 	// The ID of the organisation object the aut-num object refers to.
 	var orgID string
 	for _, line := range lines {
 		if strings.TrimSpace(line) == "" {
 			class = ""
 			continue
 		}
 		key, value, ok := splitField(line)
 		if !ok {
 			continue
 		}
 		if class == "" {
 			class, id = key, value
 		}
 		switch class {
 		case autNumClass:
 			autNum = append(autNum, line)
 			if key == orgKey {
 				orgID = value
 			}
 		case organisationClass:
 			organisations[id] = append(organisations[id], line)
 		}
 	}
 	return append(autNum, organisations[orgID]...)
 }
 // setResponseField stores the value of one "key: value" line of a WHOIS
 // response in info, keeping the first value seen for each field.
 func (c *Client) setResponseField(info *ASNInfo, key, value string) {
@@ -2,21 +2,15 @@ package whois_test
 import (
 	"bufio"
 	"bytes"
 	"context"
 	"encoding/json"
 	"errors"
 	"io"
 	"log/slog"
 	"maps"
 	"net"
 	"slices"
 	"strings"
 	"sync"
 	"syscall"
 	"testing"
 	"time"
 	"unicode/utf8"
 	"git.eeqj.de/sneak/routewatch/internal/whois"
 )
@@ -27,20 +21,8 @@ const (
 	ripeServer = "whois.ripe.net:43"
 )
-// testASN is the AS the tests look up, and asQuery the query for it.
+// testASN is the AS the tests look up.
-const (
+const testASN = 3333
 	testASN = 3333
 	asQuery = "AS3333"
 )
 // The fake servers' answers are keyed by a server's address, a space and a
 // query. These are the keys of the queries LookupASN sends for testASN:
 // IANA's, then RIPE's, which asks RIPE to leave out person and role
 // objects.
 const (
 	ianaQuery = ianaServer + " " + asQuery
 	ripeQuery = ripeServer + " --no-personal " + asQuery
 )
 // ianaReferral is IANA's answer for an AS in a block it gave to RIPE.
 const ianaReferral = `% IANA WHOIS server
@@ -54,163 +36,27 @@ changed:      2002-09-01
 source:       IANA
 `
-// lacnicReferral is IANA's answer for an AS in a block it gave to LACNIC,
+// ripeRecord is RIPE's answer for the AS.
 // shortened to the referral.
 const lacnicReferral = "refer:        whois.lacnic.net\n"
 // ripeRecord is RIPE's answer for the AS when asked to leave out person and
 // role objects. It starts with the as-block object of the block the AS is
 // in. Then come the abuse address as a comment, the AS's object and the
 // organisation object it refers to.
 const ripeRecord = `% This is the RIPE Database query service.
 % The objects are in RPSL format.
 % Note: --no-personal means ALL personal data has been filtered from this output.
 % Information related to 'AS3209 - AS3353'
 as-block:       AS3209 - AS3353
 descr:          RIPE NCC ASN block
 remarks:        These AS Numbers are assigned to network operators
 remarks:        in the RIPE NCC service region.
 mnt-by:         RIPE-NCC-HM-MNT
 created:        2018-11-22T15:27:19Z
 last-modified:  2018-11-22T15:27:19Z
 source:         RIPE
 % Information related to 'AS3333'
 % Abuse contact for 'AS3333' is 'abuse@ripe.net'
 aut-num:        AS3333
 as-name:        RIPE-NCC-AS
 org:            ORG-RIEN1-RIPE
 admin-c:        BRD-RIPE
 tech-c:         OPS4-RIPE
 abuse-c:        OPS4-RIPE
 mnt-by:         RIPE-NCC-MNT
 created:        2002-09-17T13:08:32Z
 last-modified:  2024-01-09T08:55:41Z
 source:         RIPE
 organisation:   ORG-RIEN1-RIPE
 org-name:       Reseaux IP Europeens Network Coordination Centre (RIPE NCC)
 country:        NL
 org-type:       RIR
 address:        P.O. Box 10096
 address:        1001EB Amsterdam
 abuse-c:        OPS4-RIPE
 created:        2012-03-09T13:08:29Z
 last-modified:  2024-03-26T10:55:38Z
 source:         RIPE
 `
 // The error lines with which RIPE refuses a query: access denied to the
 // host, and the host's limit on returned objects reached.
 const (
 	ripeAccessDenied = "%ERROR:201: access denied for 192.0.2.1"
 	ripeLimitReached = "%ERROR:202: access control limit reached"
 )
 // ripeRefusal is RIPE's answer to a host it no longer serves.
 const ripeRefusal = `% This is the RIPE Database query service.
 % The objects are in RPSL format.
 %
-` + ripeAccessDenied + `
+%ERROR:201: access denied for 192.0.2.1
 %
 % Sorry, access from your host has been permanently
 % denied because of a repeated excessive querying.
 `
 // apnicAfrinicRecord is the answer of APNIC or AFRINIC for the AS when asked
 // to leave out person and role objects. Like RIPE's, it holds the abuse
 // address as a comment, the AS's object and the organisation object.
 const apnicAfrinicRecord = `% Abuse contact for 'AS3333' is 'abuse@example.net'
 aut-num:        AS3333
 as-name:        EXAMPLE-AS
 org:            ORG-EXAMPLE1
 admin-c:        EX1-TEST
 last-modified:  2026-08-26T00:40:00Z
 organisation:   ORG-EXAMPLE1
 org-name:       Example Networks
 country:        ZA
 address:        1 Example Road
 `
 // apnicServer is APNIC's WHOIS server, and apnicASN an AS that APNIC holds.
 const (
 	apnicServer = "whois.apnic.net:43"
 	apnicASN    = 4608
 )
 // The keys of the queries LookupASN sends for apnicASN: IANA's, then
 // APNIC's, which asks APNIC to leave out person and role objects.
 const (
 	apnicIANAQuery = ianaServer + " AS4608"
 	apnicQuery     = apnicServer + " --no-personal AS4608"
 )
 // apnicRecord is APNIC's answer for apnicASN when asked to leave out person
 // and role objects, shortened. It starts with the as-block object of the
 // block the AS is in. Then come the abuse address as a comment, the AS's
 // object, and the irt and organisation objects it refers to.
 const apnicRecord = `% [whois.apnic.net]
 % Whois data copyright terms    http://www.apnic.net/db/dbcopyright.html
 % Note: --no-personal means ALL personal data has been filtered from this output.
 % Information related to 'AS4608 - AS4865'
 as-block:       AS4608 - AS4865
 descr:          APNIC ASN block
 remarks:        These AS numbers are further assigned by APNIC
 remarks:        to APNIC members and end-users in the APNIC region
 mnt-by:         APNIC-HM
 mnt-lower:      APNIC-HM
 last-modified:  2019-05-20T03:52:26Z
 source:         APNIC
 % Information related to 'AS4608'
 % Abuse contact for 'AS4608' is 'abuse@apnic.net'
 aut-num:        AS4608
 as-name:        APNIC-SERVICES
 descr:          Asia Pacific Network Information Centre
 country:        AU
 org:            ORG-APNI1-AP
 admin-c:        AIC1-AP
 abuse-c:        AA1589-AP
 mnt-by:         APNIC-HM
 mnt-irt:        IRT-APNIC-IS-AP
 last-modified:  2026-08-26T00:40:00Z
 source:         APNIC
 irt:            IRT-APNIC-IS-AP
 address:        South Brisbane, Australia
 e-mail:         helpdesk@apnic.net
 abuse-mailbox:  abuse@apnic.net
 mnt-by:         MAINT-APNIC-IS-AP
 last-modified:  2025-11-18T00:27:08Z
 source:         APNIC
 organisation:   ORG-APNI1-AP
 org-name:       Asia Pacific Network Information Centre
 org-type:       LIR
 country:        AU
 address:        PO Box 3646
 address:        South Brisbane, QLD 4101,
 address:        Australia
 e-mail:         noc@apnic.net
 mnt-by:         APNIC-HM
 last-modified:  2026-08-24T12:58:43Z
 source:         APNIC
 % This query was served by the APNIC Whois Service version 1.88.48 (WHOIS-UK2)
 `
 // ianaPrivateUse is IANA's answer for a private-use AS: its block and no
 // referral.
 const ianaPrivateUse = `% IANA WHOIS server
@@ -234,29 +80,20 @@ const fillerLine = "remarks:        and more\n"
 const endlessAnswerSize = 4 << 20
 // fakeServers returns a DialContext for a whois.Client that connects to a
-// fake server at each address answers names. Each key of answers is a
+// fake server for each address in answers, which reads the query and sends
-// server's address, a space and a query, and its value is that server's
+// answers[address]. Connecting to any other address is refused.
 // answer to that query. A server reads one query and sends its answer, or
 // nothing for a query it has no answer for. Connecting to any other address
 // is refused.
 func fakeServers(
 	t *testing.T, answers map[string]string,
 ) func(context.Context, string, string) (net.Conn, error) {
 	t.Helper()
 	addresses := make(map[string]bool)
 	for key := range answers {
 		address, _, _ := strings.Cut(key, " ")
 		addresses[address] = true
 	}
 	var servers sync.WaitGroup
 	t.Cleanup(servers.Wait)
 	return func(_ context.Context, _, address string) (net.Conn, error) {
-		if !addresses[address] {
+		answer, ok := answers[address]
 		if !ok {
 			return nil, syscall.ECONNREFUSED
 		}
@@ -265,8 +102,7 @@ func fakeServers(
 		servers.Go(func() {
 			defer func() { _ = server.Close() }()
-			query, _ := bufio.NewReader(server).ReadString('\n')
+			_, _ = bufio.NewReader(server).ReadString('\n')
 			answer := answers[address+" "+strings.TrimSpace(query)]
 			_, _ = io.WriteString(server, answer)
 		})
@@ -280,48 +116,31 @@ func lookUp(
 ) (*whois.ASNInfo, error) {
 	t.Helper()
-	client := whois.NewClient(slog.New(slog.DiscardHandler))
+	client := whois.NewClient()
 	client.DialContext = fakeServers(t, answers)
 	return client.LookupASN(t.Context(), testASN)
 }
-// TestLookupASNReadsTheRIRAnswer looks up an AS IANA refers to RIPE. RIPE
+// TestLookupASNReadsTheRIRAnswer looks up an AS IANA refers to RIPE. The
-// answers only a query that leaves out person and role objects, and its
+// fields come from RIPE's answer, the last-modified date included: IANA's
-// answer to that still fills the AS's fields: the abuse address from the
+// "changed:" line dates its block, not the AS.
 // comment line, and the organisation's name and country from its object.
 // The dates are the AS's. IANA's "changed:" line dates the AS's block, and
 // so do the dates of the as-block object at the start of RIPE's answer.
 func TestLookupASNReadsTheRIRAnswer(t *testing.T) {
 	t.Parallel()
 	info, err := lookUp(t, map[string]string{
-		ianaQuery: ianaReferral,
+		ianaServer: ianaReferral,
-		ripeQuery: ripeRecord,
+		ripeServer: ripeRecord,
 	})
 	if err != nil {
 		t.Fatalf("LookupASN: %v", err)
 	}
-	got := []string{
+	if info.ASName != "RIPE-NCC-AS" || info.OrgID != "ORG-RIEN1-RIPE" ||
-		info.ASName, info.OrgID, info.OrgName, info.CountryCode,
+		info.RIR != whois.RIRRIPE {
-		info.AbuseEmail, info.RIR,
+		t.Errorf("LookupASN = AS name %q, org %q, RIR %q; "+
-	}
+			"want RIPE-NCC-AS, ORG-RIEN1-RIPE, RIPE",
-	want := []string{
+			info.ASName, info.OrgID, info.RIR)
 		"RIPE-NCC-AS", "ORG-RIEN1-RIPE",
 		"Reseaux IP Europeens Network Coordination Centre (RIPE NCC)", "NL",
 		"abuse@ripe.net", whois.RIRRIPE,
 	}
 	if !slices.Equal(got, want) {
 		t.Errorf("LookupASN = AS name, org ID, org name, country, abuse "+
 			"address, RIR %q; want %q", got, want)
 	}
 	wantRegDate := time.Date(2002, 9, 17, 13, 8, 32, 0, time.UTC)
 	if info.RegDate == nil || !info.RegDate.Equal(wantRegDate) {
 		t.Errorf("LookupASN registered = %v, want %v",
 			info.RegDate, wantRegDate)
 	}
 	wantLastMod := time.Date(2024, 1, 9, 8, 55, 41, 0, time.UTC)
@@ -331,460 +150,6 @@ func TestLookupASNReadsTheRIRAnswer(t *testing.T) {
 	}
 }
 // TestLookupASNReadsOnlyTheASAndItsOrganisation looks up an AS at APNIC,
 // whose answer starts with the as-block object of the block the AS is in.
 // The last-modified date is the aut-num object's, not the block's. The
 // address is the organisation object's alone, without the irt object's.
 func TestLookupASNReadsOnlyTheASAndItsOrganisation(t *testing.T) {
 	t.Parallel()
 	client := whois.NewClient(slog.New(slog.DiscardHandler))
 	client.DialContext = fakeServers(t, map[string]string{
 		apnicIANAQuery: "refer:        whois.apnic.net\n",
 		apnicQuery:     apnicRecord,
 	})
 	info, err := client.LookupASN(t.Context(), apnicASN)
 	if err != nil {
 		t.Fatalf("LookupASN: %v", err)
 	}
 	wantLastMod := time.Date(2026, 8, 26, 0, 40, 0, 0, time.UTC)
 	if info.LastMod == nil || !info.LastMod.Equal(wantLastMod) {
 		t.Errorf("LookupASN last modified = %v, want %v",
 			info.LastMod, wantLastMod)
 	}
 	got := []string{
 		info.ASName, info.OrgID, info.OrgName, info.CountryCode,
 		info.Address, info.AbuseEmail,
 	}
 	want := []string{
 		"APNIC-SERVICES", "ORG-APNI1-AP",
 		"Asia Pacific Network Information Centre", "AU",
 		"PO Box 3646\nSouth Brisbane, QLD 4101,\nAustralia", "abuse@apnic.net",
 	}
 	if !slices.Equal(got, want) {
 		t.Errorf("LookupASN = AS name, org ID, org name, country, address, "+
 			"abuse address %q; want %q", got, want)
 	}
 }
 // TestLookupASNAsksAPNICAndAFRINICToLeaveOutPersonalData looks up an AS at
 // APNIC and at AFRINIC. Each answers only a query that leaves out person
 // and role objects, as RIPE does. That one answer still holds the
 // organisation object, so the organisation's name and country are filled.
 func TestLookupASNAsksAPNICAndAFRINICToLeaveOutPersonalData(t *testing.T) {
 	t.Parallel()
 	for _, server := range []string{"whois.apnic.net", "whois.afrinic.net"} {
 		t.Run(server, func(t *testing.T) {
 			t.Parallel()
 			address := server + ":43"
 			info, err := lookUp(t, map[string]string{
 				ianaQuery:                             "refer:        " + server + "\n",
 				address + " --no-personal " + asQuery: apnicAfrinicRecord,
 			})
 			if err != nil {
 				t.Fatalf("LookupASN: %v", err)
 			}
 			got := []string{
 				info.ASName, info.OrgName, info.CountryCode, info.AbuseEmail,
 			}
 			want := []string{
 				"EXAMPLE-AS", "Example Networks", "ZA", "abuse@example.net",
 			}
 			if !slices.Equal(got, want) {
 				t.Errorf("LookupASN = AS name, org name, country, abuse "+
 					"address %q; want %q", got, want)
 			}
 		})
 	}
 }
 // The name of an organisation with accented letters, in Latin-1, one byte for
 // each letter, and in UTF-8.
 const (
 	latin1OrgName = "Fundaci\xf3n Ra\xedces de Espa\xf1a"
 	utf8OrgName   = "Fundación Raíces de España"
 )
 // TestLookupASNStoresAnswersInUTF8 looks up an AS at RIPE, which answers in
 // Latin-1, and at LACNIC, which answers in UTF-8. Both answers give the
 // organisation's name with its accented letters in UTF-8, in the parsed field
 // and in the stored answer. Before the fix the Latin-1 answer was kept as
 // received, which is not valid UTF-8.
 func TestLookupASNStoresAnswersInUTF8(t *testing.T) {
 	t.Parallel()
 	for name, answers := range map[string]map[string]string{
 		"RIPE in Latin-1": {
 			ianaQuery: ianaReferral,
 			ripeQuery: "aut-num:        AS3333\n" +
 				"org-name:       " + latin1OrgName + "\n",
 		},
 		"LACNIC in UTF-8": {
 			ianaQuery: lacnicReferral,
 			"whois.lacnic.net:43 " + asQuery: "aut-num:     AS3333\n" +
 				"owner:       " + utf8OrgName + "\n",
 		},
 	} {
 		t.Run(name, func(t *testing.T) {
 			t.Parallel()
 			info, err := lookUp(t, answers)
 			if err != nil {
 				t.Fatalf("LookupASN: %v", err)
 			}
 			if info.OrgName != utf8OrgName {
 				t.Errorf("LookupASN org name = %q, want %q",
 					info.OrgName, utf8OrgName)
 			}
 			if !utf8.ValidString(info.RawResponse) ||
 				!strings.Contains(info.RawResponse, utf8OrgName) {
 				t.Errorf("LookupASN answer = %q, want UTF-8 holding %q",
 					info.RawResponse, utf8OrgName)
 			}
 		})
 	}
 }
 // lacnicServer is LACNIC's WHOIS server and nicbrServer NIC.br's, which
 // registers Brazil's ASes under LACNIC. brazilASN is one of those ASes.
 const (
 	lacnicServer = "whois.lacnic.net:43"
 	nicbrServer  = "whois.registro.br:43"
 	brazilASN    = 52751
 )
 // The keys of the queries LookupASN sends for brazilASN: IANA's, LACNIC's,
 // then NIC.br's.
 const (
 	brazilIANAQuery   = ianaServer + " AS52751"
 	brazilLACNICQuery = lacnicServer + " AS52751"
 	brazilNICbrQuery  = nicbrServer + " AS52751"
 )
 // The name of brazilASN's organisation in three forms: as LACNIC sends it,
 // with each accented letter replaced by U+FFFD; as NIC.br sends it, in
 // Latin-1; and in UTF-8.
 const (
 	lacnicBrazilOrgName = "Brasrede Telecomunica\U0000FFFD\U0000FFFDes LTDA"
 	nicbrBrazilOrgName  = "Brasrede Telecomunica\xe7\xf5es LTDA"
 	brazilOrgName       = "Brasrede Telecomunicações LTDA"
 )
 // nicbrCopyright is the copyright notice at the top of NIC.br's answers.
 const nicbrCopyright = "% Copyright (c) Nic.br - " +
 	"Use of this data is governed by the Use and\n" +
 	"% Privacy Policy at https://registro.br/upp . Distribution,\n" +
 	"% commercialization, reproduction, and use for advertising or similar\n" +
 	"% purposes are expressly prohibited.\n"
 // lacnicBrazilRecord is LACNIC's answer for brazilASN, recorded on
 // 2026-10-26. It is NIC.br's answer, which LACNIC passes on after a line
 // of its own and a space. It is shortened. The client's address is a
 // documentation address. The contact's name, the contact's object and the
 // footer are left out.
 const lacnicBrazilRecord = "% IP Client: 192.0.2.1\n" +
 	" " + nicbrCopyright + `% 2026-10-26T23:12:22-03:00 - 192.0.2.1
 aut-num:     AS52751
 owner:       ` + lacnicBrazilOrgName + `
 owner-c:     AVL217
 routing-c:   AVL217
 abuse-c:     AVL217
 created:     20120829
 changed:     20130306
 inetnum:     177.38.152.0/21
 inetnum:     2804:b34::/32
 inetnum:     191.243.4.0/22
 inetnum:     131.72.248.0/22
 inetnum:     138.94.228.0/22
 inetnum:     170.233.8.0/22
 inetnum:     170.246.4.0/22
 `
 // nicbrRecord is NIC.br's answer for brazilASN, in Latin-1, recorded on
 // 2026-10-26 and shortened as lacnicBrazilRecord is.
 const nicbrRecord = nicbrCopyright + `% 2026-10-26T23:14:41-03:00 - 192.0.2.1
 aut-num:     AS52751
 owner:       ` + nicbrBrazilOrgName + `
 owner-c:     AVL217
 routing-c:   AVL217
 abuse-c:     AVL217
 created:     20120829
 changed:     20130306
 inetnum:     177.38.152.0/21
 inetnum:     2804:b34::/32
 inetnum:     191.243.4.0/22
 inetnum:     131.72.248.0/22
 inetnum:     138.94.228.0/22
 inetnum:     170.233.8.0/22
 inetnum:     170.246.4.0/22
 `
 // nicbrOverLimit stands for NIC.br's answer for brazilASN to a client over
 // its query limit, and is not recorded. Such an answer leaves information
 // out, here the owner, and says so in its first line.
 const nicbrOverLimit = `% Query rate limit exceeded. Reduced information.
 aut-num:     AS52751
 created:     20120829
 changed:     20130306
 `
 // newNICbrClient returns a client whose fake servers send answers and
 // whose logger writes JSON lines to logs. It adds one to *nicbrAsks each
 // time it connects to NIC.br's server.
 func newNICbrClient(
 	t *testing.T, answers map[string]string, logs io.Writer, nicbrAsks *int,
 ) *whois.Client {
 	t.Helper()
 	dial := fakeServers(t, answers)
 	client := whois.NewClient(slog.New(slog.NewJSONHandler(logs, nil)))
 	client.DialContext = func(
 		ctx context.Context, network, address string,
 	) (net.Conn, error) {
 		if address == nicbrServer {
 			*nicbrAsks++
 		}
 		return dial(ctx, network, address)
 	}
 	return client
 }
 // lookUpBrazilianAS looks brazilASN up with fake servers sending answers,
 // and reports whether the client connected to NIC.br's server.
 func lookUpBrazilianAS(
 	t *testing.T, answers map[string]string,
 ) (*whois.ASNInfo, bool, error) {
 	t.Helper()
 	nicbrAsks := 0
 	client := newNICbrClient(t, answers, io.Discard, &nicbrAsks)
 	info, err := client.LookupASN(t.Context(), brazilASN)
 	return info, nicbrAsks > 0, err
 }
 // TestLookupASNTakesABrazilianASFromNICbr looks up an AS that NIC.br
 // registers. LACNIC's answer is NIC.br's with each accented letter replaced
 // by U+FFFD, so the client also asks NIC.br's server, which answers in
 // Latin-1. The organisation's name has its accented letters, in the parsed
 // field and in the stored answer.
 func TestLookupASNTakesABrazilianASFromNICbr(t *testing.T) {
 	t.Parallel()
 	info, _, err := lookUpBrazilianAS(t, map[string]string{
 		brazilIANAQuery:   lacnicReferral,
 		brazilLACNICQuery: lacnicBrazilRecord,
 		brazilNICbrQuery:  nicbrRecord,
 	})
 	if err != nil {
 		t.Fatalf("LookupASN: %v", err)
 	}
 	if info.OrgName != brazilOrgName || info.RIR != whois.RIRLACNIC {
 		t.Errorf("LookupASN org name, RIR = %q, %q; want %q, %q",
 			info.OrgName, info.RIR, brazilOrgName, whois.RIRLACNIC)
 	}
 	if !strings.Contains(info.RawResponse, brazilOrgName) {
 		t.Errorf("LookupASN answer = %q, want one holding %q",
 			info.RawResponse, brazilOrgName)
 	}
 	wantRegDate := time.Date(2012, 8, 29, 0, 0, 0, 0, time.UTC)
 	if info.RegDate == nil || !info.RegDate.Equal(wantRegDate) {
 		t.Errorf("LookupASN registered = %v, want %v",
 			info.RegDate, wantRegDate)
 	}
 }
 // TestLookupASNAsksNICbrOnlyForItsASes looks up an AS at LACNIC whose
 // answer does not carry NIC.br's copyright notice, as for an AS that LACNIC
 // registers itself. The client does not connect to NIC.br's server, which
 // would answer with a record, and keeps LACNIC's fields.
 func TestLookupASNAsksNICbrOnlyForItsASes(t *testing.T) {
 	t.Parallel()
 	info, askedNICbr, err := lookUpBrazilianAS(t, map[string]string{
 		brazilIANAQuery: lacnicReferral,
 		brazilLACNICQuery: "aut-num:     AS52751\n" +
 			"owner:       " + utf8OrgName + "\n",
 		brazilNICbrQuery: nicbrRecord,
 	})
 	if err != nil {
 		t.Fatalf("LookupASN: %v", err)
 	}
 	if askedNICbr {
 		t.Error("LookupASN asked NIC.br's server about an AS whose " +
 			"answer from LACNIC is not NIC.br's")
 	}
 	if info.OrgName != utf8OrgName {
 		t.Errorf("LookupASN org name = %q, want LACNIC's %q",
 			info.OrgName, utf8OrgName)
 	}
 }
 // TestLookupASNKeepsLACNICsAnswerWhenNICbrFails looks up an AS that NIC.br
 // registers when NIC.br's server refuses the connection, sends nothing, or
 // sends the reduced answer for a client over its query limit. The client
 // asks NIC.br, and the lookup still succeeds with LACNIC's fields. The
 // client logs one warning, which names the AS and the reason.
 func TestLookupASNKeepsLACNICsAnswerWhenNICbrFails(t *testing.T) {
 	t.Parallel()
 	for name, test := range map[string]struct {
 		nicbrAnswer map[string]string
 		reason      string
 	}{
 		"connection refused": {
 			nicbrAnswer: map[string]string{},
 			reason:      syscall.ECONNREFUSED.Error(),
 		},
 		"no answer": {
 			nicbrAnswer: map[string]string{brazilNICbrQuery: ""},
 			reason:      "no WHOIS fields",
 		},
 		"over the query limit": {
 			nicbrAnswer: map[string]string{brazilNICbrQuery: nicbrOverLimit},
 			reason:      "over its query limit",
 		},
 	} {
 		t.Run(name, func(t *testing.T) {
 			t.Parallel()
 			answers := map[string]string{
 				brazilIANAQuery:   lacnicReferral,
 				brazilLACNICQuery: lacnicBrazilRecord,
 			}
 			maps.Copy(answers, test.nicbrAnswer)
 			var logs bytes.Buffer
 			nicbrAsks := 0
 			client := newNICbrClient(t, answers, &logs, &nicbrAsks)
 			info, err := client.LookupASN(t.Context(), brazilASN)
 			if err != nil {
 				t.Fatalf("LookupASN: %v", err)
 			}
 			if nicbrAsks == 0 {
 				t.Error("LookupASN did not ask NIC.br's server")
 			}
 			if info.OrgName != lacnicBrazilOrgName {
 				t.Errorf("LookupASN org name = %q, want LACNIC's %q",
 					info.OrgName, lacnicBrazilOrgName)
 			}
 			var logged struct {
 				Level string `json:"level"`
 				ASN   int    `json:"asn"`
 			}
 			err = json.Unmarshal(logs.Bytes(), &logged)
 			if err != nil {
 				t.Fatalf("want one log line, got %q: %v", logs.String(), err)
 			}
 			if logged.Level != slog.LevelWarn.String() ||
 				logged.ASN != brazilASN ||
 				!strings.Contains(logs.String(), test.reason) {
 				t.Errorf("logged %q, want a warning for AS%d holding %q",
 					logs.String(), brazilASN, test.reason)
 			}
 		})
 	}
 }
 // TestLookupASNSkipsNICbrAfterItsLimit looks up an AS that NIC.br
 // registers three times with one client, while NIC.br answers that the
 // client is over its query limit. The first lookup asks NIC.br. The
 // second, a second before NICbrSkipTime has passed, does not. The third,
 // once NICbrSkipTime has passed, asks again. Each keeps LACNIC's fields.
 func TestLookupASNSkipsNICbrAfterItsLimit(t *testing.T) {
 	t.Parallel()
 	nicbrAsks := 0
 	client := newNICbrClient(t, map[string]string{
 		brazilIANAQuery:   lacnicReferral,
 		brazilLACNICQuery: lacnicBrazilRecord,
 		brazilNICbrQuery:  nicbrOverLimit,
 	}, io.Discard, &nicbrAsks)
 	start := time.Date(2026, 10, 27, 0, 0, 0, 0, time.UTC)
 	now := start
 	client.Now = func() time.Time { return now }
 	for _, step := range []struct {
 		after    time.Duration
 		wantAsks int
 	}{
 		{after: 0, wantAsks: 1},
 		{after: whois.NICbrSkipTime - time.Second, wantAsks: 1},
 		{after: whois.NICbrSkipTime, wantAsks: 2},
 	} {
 		now = start.Add(step.after)
 		info, err := client.LookupASN(t.Context(), brazilASN)
 		if err != nil {
 			t.Fatalf("LookupASN after %v: %v", step.after, err)
 		}
 		if nicbrAsks != step.wantAsks {
 			t.Errorf("after %v NIC.br's server was asked %d times, want %d",
 				step.after, nicbrAsks, step.wantAsks)
 		}
 		if info.OrgName != lacnicBrazilOrgName {
 			t.Errorf("LookupASN after %v org name = %q, want LACNIC's %q",
 				step.after, info.OrgName, lacnicBrazilOrgName)
 		}
 	}
 }
 // TestLookupASNReportsARefusal looks up an AS IANA refers to RIPE when RIPE
 // refuses the query, with each of the error lines RIPE refuses with. The
 // error holds RIPE's line, so the log says why the lookup failed.
 func TestLookupASNReportsARefusal(t *testing.T) {
 	t.Parallel()
 	for _, line := range []string{ripeAccessDenied, ripeLimitReached} {
 		t.Run(line, func(t *testing.T) {
 			t.Parallel()
 			_, err := lookUp(t, map[string]string{
 				ianaQuery: ianaReferral,
 				ripeQuery: "% This is the RIPE Database query service.\n" +
 					line + "\n",
 			})
 			if err == nil || !strings.Contains(err.Error(), line) {
 				t.Errorf("LookupASN error = %v, want one holding %q",
 					err, line)
 			}
 		})
 	}
 }
 // TestLookupASNFailsWhenTheRIRGivesNoAnswer looks up an AS IANA refers to
 // RIPE when RIPE's server refuses the connection, and when it answers only
 // with an error. Neither is a lookup that found the AS.
@@ -792,8 +157,8 @@ func TestLookupASNFailsWhenTheRIRGivesNoAnswer(t *testing.T) {
 	t.Parallel()
 	for name, answers := range map[string]map[string]string{
-		"connection refused": {ianaQuery: ianaReferral},
+		"connection refused": {ianaServer: ianaReferral},
-		"only an error":      {ianaQuery: ianaReferral, ripeQuery: ripeRefusal},
+		"only an error":      {ianaServer: ianaReferral, ripeServer: ripeRefusal},
 	} {
 		t.Run(name, func(t *testing.T) {
 			t.Parallel()
@@ -812,7 +177,7 @@ func TestLookupASNFailsWhenTheRIRGivesNoAnswer(t *testing.T) {
 func TestLookupASNReportsNoReferral(t *testing.T) {
 	t.Parallel()
-	_, err := lookUp(t, map[string]string{ianaQuery: ianaPrivateUse})
+	_, err := lookUp(t, map[string]string{ianaServer: ianaPrivateUse})
 	if !errors.Is(err, whois.ErrNoReferral) {
 		t.Errorf("LookupASN error = %v, want ErrNoReferral", err)
 	}
@@ -824,7 +189,7 @@ func TestLookupASNReportsNoReferral(t *testing.T) {
 func TestLookupASNFailsWhenIANAAnswersNoBlock(t *testing.T) {
 	t.Parallel()
-	_, err := lookUp(t, map[string]string{ianaQuery: ianaNoObject})
+	_, err := lookUp(t, map[string]string{ianaServer: ianaNoObject})
 	if err == nil || errors.Is(err, whois.ErrNoReferral) {
 		t.Errorf("LookupASN error = %v, want one that is not ErrNoReferral",
 			err)
@@ -841,8 +206,8 @@ func TestLookupASNFailsWhenTheRIRAnswerDoesNotEnd(t *testing.T) {
 		strings.Repeat(fillerLine, endlessAnswerSize/len(fillerLine))
 	_, err := lookUp(t, map[string]string{
-		ianaQuery: ianaReferral,
+		ianaServer: ianaReferral,
-		ripeQuery: endless,
+		ripeServer: endless,
 	})
 	if err == nil || errors.Is(err, whois.ErrNoReferral) {
 		t.Errorf("LookupASN error = %v, want one that is not ErrNoReferral",
@@ -868,9 +233,9 @@ func TestLookupASNFailsOnAReferralToAnotherServer(t *testing.T) {
 			t.Parallel()
 			_, err := lookUp(t, map[string]string{
-				ianaQuery: "refer:        " + refer + "\n\n" +
+				ianaServer: "refer:        " + refer + "\n\n" +
 					"as-block:     3154-3353\n",
-				address + " " + asQuery: ripeRecord,
+				address: ripeRecord,
 			})
 			if err == nil || errors.Is(err, whois.ErrNoReferral) {
 				t.Errorf("LookupASN error = %v, want one that is not "+
@@ -2,13 +2,10 @@ package asinfo
 import (
 	"bytes"
 	"cmp"
 	"compress/gzip"
 	_ "embed"
 	"encoding/json"
 	"io"
 	"slices"
 	"strings"
 	"sync"
 )
@@ -26,17 +23,6 @@ type Info struct {
 type Registry struct {
 	mu    sync.RWMutex
 	byASN map[int]*Info
 	// searchEntries holds every entry in AS number order, for Search.
 	searchEntries []searchEntry
 }
 // searchEntry is an entry with its handle and description in lower case. They
 // are put in lower case once, when the data loads, so that Search only
 // compares.
 type searchEntry struct {
 	info             *Info
 	lowerHandle      string
 	lowerDescription string
 }
 var (
@@ -73,21 +59,9 @@ func initRegistry() {
 		panic("failed to unmarshal embedded AS data: " + err.Error())
 	}
 	slices.SortFunc(asInfos, func(a, b Info) int {
 		return cmp.Compare(a.ASN, b.ASN)
 	})
 	defaultRegistry.searchEntries = make([]searchEntry, 0, len(asInfos))
 	for i := range asInfos {
 		info := &asInfos[i]
 		defaultRegistry.byASN[info.ASN] = info
 		defaultRegistry.searchEntries = append(defaultRegistry.searchEntries,
 			searchEntry{
 				info:             info,
 				lowerHandle:      strings.ToLower(info.Handle),
 				lowerDescription: strings.ToLower(info.Description),
 			})
 	}
 }
@@ -155,36 +129,36 @@ func All() []Info {
 	return result
 }
-// Search finds the AS entries whose handle or description contains query,
+// Search searches for AS entries where the handle or description contains the query
-// ignoring case. It returns the first limit of them in AS number order, and the
+// This is a simple case-sensitive substring search
-// number of entries that match. An empty query matches nothing.
+func Search(query string) []Info {
 func Search(query string, limit int) ([]Info, int) {
 	once.Do(initRegistry)
 	if query == "" {
 		return nil, 0
 	}
 	query = strings.ToLower(query)
 	defaultRegistry.mu.RLock()
 	defer defaultRegistry.mu.RUnlock()
-	var (
+	var results []Info
 		results []Info
 		total   int
 	)
-	for _, entry := range defaultRegistry.searchEntries {
+	for _, info := range defaultRegistry.byASN {
-		if strings.Contains(entry.lowerHandle, query) ||
+		if contains(info.Handle, query) || contains(info.Description, query) {
-			strings.Contains(entry.lowerDescription, query) {
+			results = append(results, *info)
 			if total < limit {
 				results = append(results, *entry.info)
 			}
 			total++
 		}
 	}
-	return results, total
+	return results
 }
 // contains is a simple substring search
 func contains(s, substr string) bool {
 	return len(substr) > 0 && len(s) >= len(substr) && containsImpl(s, substr)
 }
 func containsImpl(s, substr string) bool {
 	for i := 0; i <= len(s)-len(substr); i++ {
 		if s[i:i+len(substr)] == substr {
 			return true
 		}
 	}
 	return false
 }
@@ -1,8 +1,6 @@
 package asinfo_test
 import (
 	"cmp"
 	"slices"
 	"strings"
 	"testing"
@@ -22,7 +20,7 @@ func TestGet(t *testing.T) {
 			name:     "AS1 Level 3",
 			asn:      1,
 			wantOK:   true,
-			wantDesc: "Level 3 Parent LLC",
+			wantDesc: "Level 3 Parent, LLC",
 		},
 		{
 			name:     "AS15169 Google",
@@ -36,10 +34,10 @@ func TestGet(t *testing.T) {
 			wantOK: false,
 		},
 		{
-			name:     "AS1251 with accented letters",
+			name:     "AS0 IANA Reserved",
-			asn:      1251,
+			asn:      0,
 			wantOK:   true,
-			wantDesc: "FUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO SÃO PAULO",
+			wantDesc: "Internet Assigned Numbers Authority",
 		},
 	}
@@ -69,7 +67,7 @@ func TestGetDescription(t *testing.T) {
 		asn  int
 		want string
 	}{
-		{1, "Level 3 Parent LLC"},
+		{1, "Level 3 Parent, LLC"},
 		{999999999, ""},
 	}
@@ -92,7 +90,8 @@ func TestGetHandle(t *testing.T) {
 		asn  int
 		want string
 	}{
-		{1, "LVLT-1"},
+		{1, "LVLT"},
 		{0, "IANA-RSVD"},
 		{999999999, ""},
 	}
@@ -142,9 +141,9 @@ func TestSearch(t *testing.T) {
 			wantMin: 10,
 		},
 		{
-			name:    "Search for São Paulo",
+			name:    "Empty search",
-			query:   "São Paulo",
+			query:   "",
-			wantMin: 1,
+			wantMin: 0,
 		},
 		{
 			name:    "Non-existent org",
@@ -157,115 +156,26 @@ func TestSearch(t *testing.T) {
 		t.Run(tt.name, func(t *testing.T) {
 			t.Parallel()
-			results, _ := asinfo.Search(tt.query, asinfo.Total())
+			results := asinfo.Search(tt.query)
 			if len(results) < tt.wantMin {
 				t.Errorf("Search(%q) returned %d results, want at least %d",
 					tt.query, len(results), tt.wantMin)
 			}
-			// Verify all results contain the query, ignoring case
+			// Verify all results contain the query
-			query := strings.ToLower(tt.query)
+			if tt.query != "" {
 				for _, r := range results {
-				if !strings.Contains(strings.ToLower(r.Handle), query) &&
+					if !strings.Contains(r.Handle, tt.query) &&
-					!strings.Contains(strings.ToLower(r.Description), query) {
+						!strings.Contains(r.Description, tt.query) {
 						t.Errorf("Search result ASN %d doesn't contain query %q",
 							r.ASN, tt.query)
 					}
 				}
 			}
 		})
 	}
 }
 // TestSearchEmptyQueryMatchesNothing expects an empty query to match no AS,
 // although every handle contains the empty string.
 func TestSearchEmptyQueryMatchesNothing(t *testing.T) {
 	t.Parallel()
 	results, total := asinfo.Search("", asinfo.Total())
 	if len(results) != 0 || total != 0 {
 		t.Errorf(`Search("") returned %d results and a total of %d, want none`,
 			len(results), total)
 	}
 }
 // TestSearchIgnoresCase searches for Cloudflare's handle in lower case and its
 // description in upper case, and expects both searches to find AS13335.
 func TestSearchIgnoresCase(t *testing.T) {
 	t.Parallel()
 	const cloudflareASN = 13335 // handle CLOUDFLARENET, "Cloudflare Inc."
 	isCloudflare := func(info asinfo.Info) bool {
 		return info.ASN == cloudflareASN
 	}
 	for _, query := range []string{"cloudflarenet", "CLOUDFLARE INC."} {
 		results, _ := asinfo.Search(query, asinfo.Total())
 		if !slices.ContainsFunc(results, isCloudflare) {
 			t.Errorf("Search(%q) did not find AS%d", query, cloudflareASN)
 		}
 	}
 }
 // TestSearchOrdersByASN expects the matches of a search with many of them to
 // come in AS number order.
 func TestSearchOrdersByASN(t *testing.T) {
 	t.Parallel()
 	const query = "University"
 	results, _ := asinfo.Search(query, asinfo.Total())
 	for i := 1; i < len(results); i++ {
 		if results[i-1].ASN >= results[i].ASN {
 			t.Fatalf("Search(%q): AS%d comes after AS%d",
 				query, results[i].ASN, results[i-1].ASN)
 		}
 	}
 }
 // TestSearchStopsAtLimit searches for a word that matches more entries than
 // the limit. It expects exactly limit entries, the first matches in AS number
 // order, and the number of all matches, counted here from All.
 func TestSearchStopsAtLimit(t *testing.T) {
 	t.Parallel()
 	const (
 		query = "university"
 		limit = 10
 	)
 	var matches []asinfo.Info
 	for _, info := range asinfo.All() {
 		if strings.Contains(strings.ToLower(info.Handle), query) ||
 			strings.Contains(strings.ToLower(info.Description), query) {
 			matches = append(matches, info)
 		}
 	}
 	if len(matches) <= limit {
 		t.Fatalf("%q matches %d entries; the test needs more than %d",
 			query, len(matches), limit)
 	}
 	slices.SortFunc(matches, func(a, b asinfo.Info) int {
 		return cmp.Compare(a.ASN, b.ASN)
 	})
 	results, total := asinfo.Search(query, limit)
 	if total != len(matches) {
 		t.Errorf("Search(%q, %d): total %d, want %d",
 			query, limit, total, len(matches))
 	}
 	if !slices.Equal(results, matches[:limit]) {
 		t.Errorf("Search(%q, %d) = %v, want %v",
 			query, limit, results, matches[:limit])
 	}
 }
 func TestDataIntegrity(t *testing.T) {
 	t.Parallel()
@@ -305,13 +215,11 @@ func BenchmarkGet(b *testing.B) {
 }
 func BenchmarkSearch(b *testing.B) {
 	const limit = 50
 	queries := []string{"Google", "Amazon", "Microsoft", "University"}
 	b.ResetTimer()
 	for i := range b.N {
-		asinfo.Search(queries[i%len(queries)], limit)
+		asinfo.Search(queries[i%len(queries)])
 	}
 }
@@ -2,7 +2,7 @@
 Package asinfo provides information about Autonomous Systems (AS).
 The package embeds a comprehensive database of AS numbers, handles, and descriptions
-sourced from https://github.com/ipverse/as-metadata. The data is embedded at compile
+sourced from https://github.com/ipverse/asn-info. The data is embedded at compile
 time and provides fast, offline lookups.
 Basic usage:
@@ -16,10 +16,8 @@ Basic usage:
 	// Get just the description
 	desc := asinfo.GetDescription(15169) // "Google LLC"
-	// Search the handles and descriptions, ignoring case, for the first 10
+	// Search for AS entries
-	// matches in AS number order and the number of all matches
+	results := asinfo.Search("University")
 	results, total := asinfo.Search("university", 10)
 	fmt.Printf("%d matches\n", total)
 	for _, as := range results {
 		fmt.Printf("AS%d: %s\n", as.ASN, as.Description)
 	}
@@ -17,20 +17,13 @@ func ExampleGet() {
 func ExampleGetDescription() {
 	desc := asinfo.GetDescription(13335)
 	fmt.Println(desc)
-	// Output: Cloudflare Inc.
+	// Output: Cloudflare, Inc.
 }
 func ExampleSearch() {
-	const limit = 10
+	results := asinfo.Search("MIT-GATEWAY")
 	results, total := asinfo.Search("mit-gateway", limit)
 	fmt.Printf("%d of %d matches\n", len(results), total)
 	for _, info := range results {
 		fmt.Printf("AS%d: %s - %s\n", info.ASN, info.Handle, info.Description)
 	}
-	// Output:
+	// Output: AS3: MIT-GATEWAYS - Massachusetts Institute of Technology
 	// 1 of 1 matches
 	// AS3: MIT-GATEWAYS - Massachusetts Institute of Technology
 }
@@ -1,34 +0,0 @@
 #!/bin/sh
 # script/asupdate: rebuild the AS list built into RouteWatch from
 # as.csv with cmd/asinfo-gen, which fails when it finds no AS. The new
 # list replaces the old one only when the generator succeeds. Otherwise
 # the old list stays as it was and the script exits non-zero.
 set -eu
 ROOT="$(cd "$(dirname "$0")/.." && pwd -P)"
 AS_DATA="pkg/asinfo/asdata.json.gz"
 # Next to AS_DATA, so the final mv is a rename on one file system.
 AS_DATA_TMP="$AS_DATA.tmp"
 main() {
    cd "$ROOT"
    json="$(mktemp)"
    trap 'rm -f "$json" "$AS_DATA_TMP"' EXIT
    # A signal exits through the EXIT trap too.
    trap 'exit 1' HUP INT TERM
    echo "Updating AS info data..."
    if ! go run ./cmd/asinfo-gen >"$json"; then
        echo "asupdate: the generator failed; $AS_DATA is unchanged" >&2
        exit 1
    fi
    # -n leaves the time out of the file, so an unchanged list gives the
    # same bytes.
    gzip -n -c <"$json" >"$AS_DATA_TMP"
    mv "$AS_DATA_TMP" "$AS_DATA"
 }
 main "$@"