Domain-partitioned upstream routing (anti-profiling)

problem: The existing random strategy still lets each upstream build a random ~1/N sample of the entire browsing graph over time.

New strategy: partition that deterministically pins each domain (by hash(qname)) to a fixed upstream subset, so any single resolver sees a consistent slice and never the rest so a real bound on what one provider can learn