A trace in the GFRTU is a finite record of an interaction or process — the minimal unit of relational history. Traces are the objects of the trace site, and each trace carries a local recognition fiber: a finite Heyting algebra of semantic values recognizable at that trace.
Traces are connected by morphisms in the trace site, which represent refinements: a morphism t → t’ means t’ is a more detailed or later record than t. The Grothendieck topology on the trace site specifies which families of refinements count as covers, determining what “local” means for trace-indexed data.
The sheaf universe is built by assembling recognition data over the trace site: a presheaf assigns data to each trace, and the sheaf condition ensures that compatible local data glues coherently across traces. A trace is not an element of H — it is an index, like a thing handle in the Interactive Semioverse, mediating between external process and internal semantics.