Review of the Week — W34: The week PAZ Kaffi drew the dependency graph
Gotthard's shared door, Meta's locked worlds, zero trust and StructureGS — the week PAZ Kaffi read every headline as a topology. Find your single point of failure.
Captain Lin Rauch at the map table. Sixteen pieces shipped this week, and if you stand back far enough they resolve into one shape: where does this actually route, and what happens at the joint nobody costed? The desks kept arriving at the same fulcrum from different fields — a tunnel, a shut-down metaverse, a zero-trust spec, a Calatrava block full of locked sensors. Here is the week, read as a topology.
←TODAY: W34 2026 — sixteen articles, five of them about single points of failure hiding inside things we called redundant. →3012: the offices that survive keep a dependency graph, not just an architecture diagram. Fulcrum: redundancy you never traced to the shared joint is decoration; the joint is where the cost lands.
Top stories:
Leading the week: The Gotthard kept two bores and still lost thirteen months to a shared door. Two independent tunnels, one shared cross-passage, and the schedule found the seam. This is the cleanest teaching case of the year — two paths that touch the same physical thing are one path at that touch. For any Swiss practice speccing redundant MEP risers or dual data feeds, walk the redundancy diagram and mark every place path A meets path B on one component. (paz://brief/c6903c62b3f57e14)
Cyberpunk Got the Topology Right — Now Draw Your Own Dependency Graph was the week’s thesis stated plainly. The genre’s durable prediction was never the neon; it was the stack where every edge routes through a few corporate hubs. As El País noted in its 40-years retrospective, the dystopia that aged best was the network shape. The Monday move: write your real dependencies as edges in a text file and find the articulation point before your next cloud renewal.
Meta Switched Off Its Worlds in June — Now Read Your BIM Contract turned a metaverse post-mortem into a procurement lesson. Horizon Worlds shut down and nobody could export what they’d built. Apply the same filter to every BIM or AI tool your Büro is about to sign: can anyone but the vendor open the files? Export a real project and try to reopen it elsewhere — if only the supplier can read it back, get the open-format guarantee before you commit.
Zero-Trust Architecture: There Is No Inside, Only the Next Request gave the mechanism behind that instinct — NIST SP 800-207’s rule that location never grants privilege, only a fresh logged verdict per request. And The Provenance Stack extended the same logic to AI-touched documents: provenance is a four-layer chain, not a switch, and watermarks are friction rather than proof. Both are the same discipline as the Gotthard — trust the joint, not the label.
Signal vs. noise: Genuinely new this week were the primary-research pieces — MIT’s SceneSmith (generated worlds real enough to fool a real robot policy) and StructureGS on arXiv, plus the rigidity-of-complex-geometry classification result. Churn dressed as news: the open-source watermark-remover story, which is a recurring capability, not an event. Useful churn: the Meta metaverse post-mortem — old failure, sharp lens. The week’s best signal-to-noise ratio came from the engineering desks, not the vendor cycle.
Hidden gem: StructureGS: when a Gaussian splat learns where the hinge is (score 77, quietest of the batch) deserved a bigger room. Articulated reconstruction — an oriented bounding box per moving part — is the exact line between a scan you can look at and a scan you can compute against. For anyone accepting reality-capture deliverables, this is the acceptance test nobody writes into the contract yet: isolate one moving part, check whether its box actually closes. (https://arxiv.org/abs/2607.26889)
Hack: Find the third single-point you didn’t know you had before Friday’s cloud renewal. List your stack as edges, then check which node, if removed, splits the graph — that’s your articulation point, your Gotthard door.
import networkx as nx
G = nx.Graph()
G.add_edges_from([("office","vpn"),("vpn","cloud-bim"),
("cloud-bim","vendor-auth"),("render","vendor-auth")])
print(sorted(nx.articulation_points(G))) # -> ['cloud-bim', 'vendor-auth', 'vpn']
Every name it prints is a place the whole practice stops if that one node stops. Cost a spare for each before you sign.
Looking ahead: Two BSS graduation streams anchor next week — Pablo Levine’s Galapagos-solved Medellín site on 25 August, then Dr. Mikhael Johanes’ AI talk opening Edition XIV on 1 September. And Grasshopper 2’s beta timer landed this week; block the ninety minutes before the tutorials pile up. Watch whether the provenance-and-export thread hardens into an actual contract clause on someone’s desk.
PAZ Kaffi · multidisciplinary editorial, led by PAZ Academy