qvm: geometric model hierarchy

docs/ASSET_PIPELINE_TODO.md

@@ -730,3 +730,6 @@ Research progress: RE-685 [report](research/QVM_LEAF_HIT_PUBLISH.md); remaining
 
 
 Research progress: RE-686 [report](research/QVM_COMPLETE_LEAF.md); remaining native/content/runtime/platform scope stays open.
+
+
+Research progress: RE-687 [report](research/QVM_GEOMETRIC_HIERARCHY.md); remaining native/content/runtime/platform scope stays open.

docs/FINDINGS.md

@@ -1076,3 +1076,6 @@ Bounded qagame paths recover bomb-plant/inactivity correction requests, direct f
 
 
 **RE-686 — Complete packed-model leaf geometry and source-produced hit records:** Complete23092 now produces actual geometry-derived context records through packed vertices, ancestry, barycentrics, source normals/points and actual metadata lookup. [Evidence](research/QVM_COMPLETE_LEAF.md).
+
+
+**RE-687 — Recursive model traversal with actual leaf geometry:** 25341 now composes actual22009 and23092 through recursive hierarchies, producing hit records from packed geometry rather than supplied leaf replies. [Evidence](research/QVM_GEOMETRIC_HIERARCHY.md).

docs/PROVISIONAL_TODO.md

@@ -1059,3 +1059,6 @@ Research progress: RE-685 [report](research/QVM_LEAF_HIT_PUBLISH.md); remaining
 
 
 Research progress: RE-686 [report](research/QVM_COMPLETE_LEAF.md); remaining native/content/runtime/platform scope stays open.
+
+
+Research progress: RE-687 [report](research/QVM_GEOMETRIC_HIERARCHY.md); remaining native/content/runtime/platform scope stays open.

docs/RESEARCH_LEDGER.md

@@ -1082,3 +1082,8 @@ Actual queried/allocated grenade enters223156, evaluates source trajectory, trun
 ## 2026-10-21 — RE-686 Complete packed-model leaf geometry and source-produced hit records (separate task commit)
 
 Complete23092 now produces actual geometry-derived context records through packed vertices, ancestry, barycentrics, source normals/points and actual metadata lookup. 36 whole-context compositions check hits/misses/behind-origin/multiple surfaces/twelve triangles/capacity with independent geometry and publication oracles; mixed word/byte copy coherence has a dedicated regression. Full suite: 1202 tests pass. Report regenerates byte-identically (354732 bytes). Storage/filter, links and whitespace checks pass. No assets/Rust runtime changed; shared STORE4 synchronizes active byte memory, with an independent regression; native/reference/legal/full platform scope remains open.
+
+
+## 2026-10-21 — RE-687 Recursive model traversal with actual leaf geometry (separate task commit)
+
+25341 now composes actual22009 and23092 through recursive hierarchies, producing hit records from packed geometry rather than supplied leaf replies. 18 postorder compositions independently check every leaf context, ancestry matrix, carried record count, hit/miss outcome and caller return. Full suite: 1206 tests pass. Report regenerates byte-identically (423592 bytes). Storage/filter, links and whitespace checks pass. No assets/Rust runtime/shared VM evaluator changed; native/reference/legal/full platform scope remains open.

docs/REVERSE_ENGINEERING_TODO.md

@@ -1102,3 +1102,6 @@ Purpose: turn the supplied installation into an evidence-backed specification of
 
 
 - [x] RE-686 Complete packed-model leaf geometry and source-produced hit records ([report](research/QVM_COMPLETE_LEAF.md)).
+
+
+- [x] RE-687 Recursive model traversal with actual leaf geometry ([report](research/QVM_GEOMETRIC_HIERARCHY.md)).

docs/research/QVM_GEOMETRIC_HIERARCHY.md

@@ -0,0 +1,7 @@
+# Recursive model traversal with actual leaf geometry
+
+RE-687. Reproduce with `python3 scripts/analyze_qvm_geometric_hierarchy.py`; check with `python3 scripts/test_qvm_geometric_hierarchy.py`. The [machine report](qvm-geometric-hierarchy.json) retains source identity and bounded fixtures.
+
+An optional leaf resolver preserves the earlier captured-leaf report while the new composition executes complete23092. Packed surfaces, actual child transforms and recursive source traversal determine hit/miss outcomes. Independent geometry oracles verify each leaf and context continuity in source postorder. Each leaf initializes its own nearest/farthest bounds while record count carries across leaves, a behavior retained rather than replaced with a single global bound accumulator. Native sqrt remains explicit. Model tables, hierarchy bounds and asset identities are fixtures; original runtime/native parity remains unverified.
+
+No original executable/full QVM/native collision/physics/rendering executes. Native responses and legal input domains are supplied or unverified where stated; full runtime/macOS/Linux Rust/Bevy/Solari gameplay remains open.

docs/research/README.md

@@ -660,3 +660,6 @@ The extension collector adds five focused tests for native tail calls, command-r
 
 
 [RE-686: Complete packed-model leaf geometry and source-produced hit records](QVM_COMPLETE_LEAF.md). Reproduce with `python3 scripts/analyze_qvm_complete_leaf.py`; check with `python3 scripts/test_qvm_complete_leaf.py`.
+
+
+[RE-687: Recursive model traversal with actual leaf geometry](QVM_GEOMETRIC_HIERARCHY.md). Reproduce with `python3 scripts/analyze_qvm_geometric_hierarchy.py`; check with `python3 scripts/test_qvm_geometric_hierarchy.py`.

scripts/analyze_qvm_geometric_hierarchy.py

@@ -0,0 +1,52 @@
+#!/usr/bin/env python3
+"""25341 with actual22009 and actual23092 geometry, no supplied hit replies."""
+import itertools
+from pathlib import Path
+from qvm_research_support import source
+from analyze_qvm_model_hierarchy import fixture,walk,NODES,ROOT
+from analyze_qvm_complete_leaf import leaf,words,CONTEXT,ORIGIN,DIRECTION
+from analyze_qvm_surface_category import support,put_text
+from analyze_qvm_slide_prefix import vec
+from analyze_qvm_acceleration import word
+from analyze_qvm import write_json
+VERTICES=[[0,0,0],[256,0,0],[0,256,0]]
+NAMES=['h_head','u_torso','l_rfoot','g_vest']
+
+def attach(m,bs,node,part,name,vertices=VERTICES):
+    model=m[node+88];m[model+84]=1;m[model+100]=part-model;m.update({part+80:3,part+84:1,part+88:128,part+100:512,part+104:1024});put_text(m,bs,part+4,name.encode())
+    for j in range(3):m[part+128+4*j]=j
+    for frame in range(2):
+        for j,v in enumerate(vertices):
+            address=part+512+(frame*3+j)*8;data=b''.join(int(x).to_bytes(2,'little',signed=True) for x in v)+b'\0\0'
+            for k,b in enumerate(data):bs[address+k]=b
+
+def describe(m,args,name,vertices=VERTICES):
+    chain=[];node=args[8];p=node;seen=set()
+    while p:
+        if p in seen:raise ValueError('cyclic fixture ancestry')
+        seen.add(p);chain.append([[m[p+12+16*r+4*c]&0xffffffff for c in range(4)] for r in range(4)]);p=m[p+96]
+    return {'surfaces':[{'name':name,'packed_vertices':vertices,'triangles':[[0,1,2]]}],'origin':vec(m,args[12]),'direction':vec(m,args[16]),'null_word4':m[4],'basis_chain':chain,'node_origin':vec(m,node+76)}
+
+def geometric_walk(ins,m,bs,args,names):
+    def resolved(i,m,a):
+        inputs=describe(m,a,names[a[8]]);m,r=leaf(i,m,bs,a);r['input']=inputs;return m,r
+    m,r=walk(ins,m,args,leaf_resolver=resolved)
+    return m,{'arguments':args,'leaf_reports':r['leaf_requests'],'execution':{k:v for k,v in r['execution'].items() if k!='children'},'final_context':words(m,args[20])}
+
+def main():
+    q,raw,h,ins=source();rows=[]
+    for kind,fraction,hit in itertools.product(['none','flat','nested'],[0,.5,1],[False,True]):
+        m,adj=fixture(kind,fraction);s,bs=support(raw,h);m.update(s)
+        for index,node in enumerate(NODES):
+            for j in range(3):m[node+76+4*j]=0
+            model=m[node+88];count=m[model+80]
+            for frame in range(2):
+                for child in range(count):
+                    for j in range(3):m[model+1280+(frame*count+child)*112+64+4*j]=0
+            attach(m,bs,node,0x78e00000+4096*index,NAMES[index])
+        for o in range(0,308,4):m[CONTEXT+o]=0
+        for p,v in [(ORIGIN,(.25,.25,1) if hit else (20,20,1)),(DIRECTION,(0,0,-1))]:
+            for j,x in enumerate(v):m[p+4*j]=word(x)
+        initial=words(m,CONTEXT);m,r=geometric_walk(ins,m,bs,{8:ROOT,12:ORIGIN,16:DIRECTION,20:CONTEXT},dict(zip(NODES,NAMES)));r.update({'kind':kind,'fraction':word(fraction),'hit_fixture':hit,'initial_context':initial});rows.append(r)
+    write_json(Path('docs/research/qvm-geometric-hierarchy.json'),{'source':q['source'],'sha256':q['sha256'],'probes':rows,'limits':'Actual25341/22009/23092 including metadata and geometry over explicit packed surfaces. No leaf hit responses supplied. Native sqrt modeled; actual asset identity/live bounds/engine collision remain unverified.'})
+if __name__=='__main__':main()

scripts/analyze_qvm_model_hierarchy.py

@@ -18,7 +18,7 @@ def transform_child(ins,m,args,cmd):
     samples=[m[sample+o]&0xffffffff for o in range(64,112,4)];m[TRANSFORM_LOCAL+228]=child;m[TRANSFORM_LOCAL+232]=sample;m,_,e=execute(ins,22010,23090,m,cmd,TRANSFORM_LOCAL)
     return m,cmd,0,{'child':child,'initial_record':before,'sample_words64_108':samples,'origin_contract':{'parents':parents,'sample_origin':samples[:3]},'final_record':[m[child+o]&0xffffffff for o in range(0,112,4)],'execution':e}
 
-def walk(ins,m,args,depth=0):
+def walk(ins,m,args,depth=0,leaf_resolver=None):
     if depth>8:raise ValueError('fixture hierarchy depth exceeded')
     m=dict(m);base=0x78200000+depth*4096
     for o,v in args.items():m[base+208+o]=v
@@ -26,9 +26,11 @@ def walk(ins,m,args,depth=0):
     def transform(i,m,a,c):
         m,c,v,r=transform_child(i,m,a,c);transforms.append(r);return m,c,v,r
     def recurse(i,m,a,c):
-        m,r=walk(i,m,a,depth+1);nested.append(r);leaves.extend(r['leaf_requests']);return m,c,0,r
+        m,r=walk(i,m,a,depth+1,leaf_resolver);nested.append(r);leaves.extend(r['leaf_requests']);return m,c,0,r
     def leaf(i,m,a,c):
-        r={'arguments':a,'node':a[8],'leaf_geometry_not_executed':True};leaves.append(r);return m,c,0,r
+        if leaf_resolver is None:r={'arguments':a,'node':a[8],'leaf_geometry_not_executed':True}
+        else:m,r=leaf_resolver(i,m,a);r={'arguments':a,'node':a[8],'effect':r}
+        leaves.append(r);return m,c,0,r
     m,_,e=execute(ins,25342,25833,m,(0,0,0),base,{22009:transform,25341:recurse,23092:leaf})
     return m,{'arguments':args,'depth':depth,'transforms':transforms,'nested':nested,'leaf_requests':leaves,'execution':e}
 

scripts/test_qvm_complete_leaf.py

@@ -1,6 +1,6 @@
 import json,unittest
 from pathlib import Path
-from test_qvm_ground import word,n
+from test_qvm_ground import word,n,f
 from test_qvm_ray_triangle import expected as candidate
 from test_qvm_hit_geometry import expected as geometry
 
@@ -8,9 +8,13 @@ def expected(p):
     r=p['before'][:];near=word(1e7);far=word(0);a=p['input']
     for index,s in enumerate(a['surfaces']):
         for triangle in s['triangles']:
-            vertices=[[word(v/64) for v in s['packed_vertices'][j]] for j in triangle];c={'vertices':vertices,'origin':a['origin'],'direction':a['direction']};hit,det,u,v,t=candidate(c)
+            vertices=[[word(v/64) for v in s['packed_vertices'][j]] for j in triangle]
+            if 'basis_chain' in a:
+                from test_qvm_leaf_basis import expected as matrix
+                b=[[n(x) for x in row] for row in matrix(a['basis_chain'])];o=list(map(n,a['node_origin']));vertices=[[word(f(f(f(f(n(v[0])*b[0][c])+f(n(v[1])*b[1][c]))+f(n(v[2])*b[2][c]))+o[c])) for c in range(3)] for v in vertices]
+            c={'vertices':vertices,'origin':a['origin'],'direction':a['direction']};hit,det,u,v,t=candidate(c)
             if not hit:continue
-            c.update({'u':u,'v':v,'parameter':t});normal,edges,point=geometry({'candidate':c});category={'h_head':1,'u_torso':3}.get(s['name'],a['null_word4'])
+            c.update({'u':u,'v':v,'parameter':t});normal,edges,point=geometry({'candidate':c});category={'h_head':1,'u_torso':3,'l_rfoot':14,'g_vest':4}.get(s['name'],a['null_word4'])
             if n(t)<n(near):near=t;r[3:6]=point;r[9:12]=normal;r[15]=index
             if n(t)>n(far):far=t;r[:3]=point;r[6:9]=normal;r[14]=index
             count=r[16]

scripts/test_qvm_geometric_hierarchy.py

@@ -0,0 +1,21 @@
+import json,unittest
+from pathlib import Path
+from test_qvm_complete_leaf import expected
+N=[0x78300000+4096*j for j in range(4)]
+class GeometricHierarchyTests(unittest.TestCase):
+    @classmethod
+    def setUpClass(cls):cls.rows=json.loads(Path('docs/research/qvm-geometric-hierarchy.json').read_text())['probes']
+    def test_independent_every_leaf_and_context_continuation(self):
+        self.assertEqual(len(self.rows),18)
+        for p in self.rows:
+            previous=p['initial_context']
+            for request in p['leaf_reports']:
+                r=request['effect'];self.assertEqual(r['before'],previous);self.assertEqual(r['after'],expected(r));previous=r['after']
+            self.assertEqual(p['final_context'],previous)
+    def test_actual_postorder_and_source_leaves(self):
+        for p in self.rows:self.assertEqual([r['node'] for r in p['leaf_reports']],{'none':[N[0]],'flat':[N[1],N[2],N[0]],'nested':[N[1],N[3],N[2],N[0]]}[p['kind']]);self.assertTrue(all('effect' in r and 'leaf_geometry_not_executed' not in r for r in p['leaf_reports']))
+    def test_hits_derived_from_packed_geometry_or_missed(self):
+        for p in self.rows:self.assertEqual(p['final_context'][16],len(p['leaf_reports']) if p['hit_fixture'] else 0)
+    def test_all_void_geometry_returns_reach_caller_boundary(self):
+        for p in self.rows:self.assertIsNone(p['execution']['return']);self.assertTrue(all(r['effect']['execution']['stop']==25339 for r in p['leaf_reports']))
+if __name__=='__main__':unittest.main()