HYX

Study 09 / Network intelligence

Hyx research study

Network intelligence without a network call.

A study of normalized IP ranges, flat local tables, verified-bot identity, snapshot replacement, and the uncertainty of reputation data.

Research classification

44 focused tests / local lookup benchmark / explicit dataset limitation

E1 / finding
44
focused tests passed
FireHOL + GeoIP / zero failures
E2 / finding
9.61ns
verified-bot lookup
8-bot release benchmark
E3 / finding
104M
lookups / second
small verified-bot table / host-local
E4 / finding
0
remote calls / lookup
request path uses local snapshots

Abstract

The claim begins with a question, not a headline.

Research question / RQ-09

Can external network intelligence become a bounded local decision while preserving IPv4/IPv6 correctness, update isolation, and epistemic caution?

Geo and reputation context is useful only if lookup is predictable and provenance remains visible. Hyx compiles external datasets into local range tables, keeps request-time lookup offline, and treats category membership as evidence rather than guilt.

01

Method

Inspect parsing, merge, mapped-address routing, binary lookup, differential tests, update behavior, and verified-bot matching; then run focused suites and available release benchmarks.

02

Finding

Sorted, merged local tables turn enrichment into a deterministic memory lookup. Correctness is constrained with naïve-oracle comparisons and explicit IPv4/IPv6 boundaries.

03

Disclosure boundary

The study names public data classes and observable lookup behavior but does not expose production list composition, update cadence, or private weighting policy.

System boundary

External data is compiled before it reaches the hot path.

S-01 / system topology

fetch / normalize / verify / swap / lookup

01

Acquire

Public reputation lists and geolocation databases enter a controlled update path with source-specific parsing and validation.

02

Normalize

CIDRs become ordered ranges; adjacent or overlapping intervals can be merged while IPv4 and IPv6 remain distinct address spaces.

03

Publish

A completed table replaces the previous snapshot so requests never traverse a partially updated dataset.

04

Enrich

Binary local lookup attaches category, location, ASN, or verified-bot context without a request-time external service call.

Controlled measurement

The available benchmark is fast but too small to stand in for the main tables.

M-01 / host-local evidence

release mode / scoped result

MeasurementObservedScope
01Verified-bot lookup9.61ns8-bot table · 104M lookups / second
02FireHOL focused suite31 passed2 benchmarks ignored by default
03GeoIP focused suite13 passed2 benchmarks ignored by default
04FireHOL large-list benchmarknot observedrequired netset absent
05GeoIP/MMDB benchmarknot observedrequired database absent

The verified-bot table ran in release mode. FireHOL large-list and GeoIP/MMDB benchmarks skipped because their external datasets were unavailable on this host.

Findings

The table can be exact even when the source is uncertain.

01

Lookup is local

No remote enrichment dependency sits between a request and its network context once a snapshot is published.

02

Range math is testable

Optimized lookups are compared with straightforward reference implementations across overlap and boundary cases.

03

Mapped IPv4 is deliberate

IPv4-mapped IPv6 addresses route into the intended address family rather than missing or colliding with native IPv6 ranges.

04

Category is not verdict

A list can be stale, broad, or wrong. Membership becomes one named signal for policy and attribution, not automatic guilt.

Correctness and safety

Updates fail outside the request path; old snapshots remain coherent.

01

Parse before publish

Malformed source data cannot create a half-built table visible to requests.

02

Differential oracle

Optimized range lookup is checked against a naïve reference across generated addresses and boundary conditions.

03

Family isolation

IPv4, native IPv6, and mapped IPv4 handling are explicit rather than dependent on byte-order accidents.

04

Fail-coherent snapshot

An update failure leaves the prior completed table usable instead of turning enrichment into an availability failure.

The repository supports bounded, correct local enrichment and a very fast small verified-bot lookup. It does not support a public large-table performance comparison on this host because the required third-party datasets were absent.

Interpretation

The evidence boundary is part of the result.

01

Main benchmarks skipped

The FireHOL netset and GeoIP MMDB files were unavailable, so no large-list or flat-table-versus-MMDB number is reported.

02

Source uncertainty

Reputation and geolocation datasets can be delayed, coarse, overbroad, or inconsistent with rapidly changing network ownership.

03

Small bot table

The 9.61ns measurement covers eight verified-bot entries and cannot predict lookup cost for every production dataset.

Evidence register

Every public claim keeps its provenance attached.

E1

Focused suites

FireHOL reported 31 passing tests and GeoIP 13, with zero failures across range, family, parser, and lookup behavior.

E2

Flat tables

Both subsystems use sorted local ranges and binary lookup, with explicit IPv4, IPv6, and mapped-address behavior.

E3

Differential testing

Optimized lookups are constrained by tests against naïve reference implementations and edge-address cases.

E4

Benchmark disclosure

The verified-bot benchmark measured 9.61ns; the primary external-dataset benchmarks explicitly skipped on this host.

Research archive

Return to the systems studies.

Mechanisms, measurements, and the limits required to interpret both.

Open the archive