WisePC
Menu
Phase 15 — the relational moat

The Hardware Graph

Components don't live in isolation. Every part is connected to what it fits, what replaces it, what upgrades it, and what people actually built with it. This graph stores those relations — and it gets smarter with every real build.

How it works

  1. 1Search any component by name, brand or SKU — open its node.
  2. 2See what fits it, what replaces it, what upgrades it and what people actually built with it.
  3. 3Follow a path between two parts or browse the best parts for a workload.

What you get

  • Compatibility, alternative, upgrade and built-together relations for every component
  • Workload-ranked parts and community-built evidence that no catalogue can copy
  • A crawlable graph of the most-connected hardware on the site

Graph size

Live counts from the persisted graph. Sharper as more builds are published.

328,508

relations

24,590

components connected

0

community edges

1,537

workload links

alternatives · 98,197compatible · 156,410ecosystem · 580upgrades · 73,321

Entry points into the graph — the components with the most relations. Crawled by search engines, useful for humans.

Why this is the moat

The derived skeleton is knowledge the kernel computes from real specs: which parts physically fit, which are interchangeable substitutes, which are drop-in upgrades, and which serve a workload.

The community layer is what makes it uncopyable. Every published build adds 'built-together' edges and workload associations — the graph literally learns from what people build.

Frequently asked questions

What is the Hardware Graph?

A typed, directed graph between catalog components. Every edge is either derived from specs (the kernel knows what physically fits) or observed in real builds people published — the community moat.

What do compatible / alternative / upgrade mean?

Compatible = the parts physically fit (socket, memory type, form factor). Alternative = interchangeable substitutes in the same slot. Upgrade = a drop-in replacement that is strictly better. Built-together = seen together in real builds.

How does the path finder work?

Pick two components — the engine finds the shortest relation chain between them (BFS, up to 6 hops) across all persisted relations and shows every hop with its type.