The reframing of "iteration" as a human hand-adjusting weights after every wrong answer is uncomfortably accurate — that is what prompt-tweaking-from-logs is, and naming it that way makes the absence of a backward pass feel like a real gap rather than just how things are.
The requirement I think is doing the most work in your four is #1, recorded intermediate states. Blame assignment and bounded updates are hard, but they're impossible if the forward pass was flattened into a log line and the intermediate reasoning is already gone. We found that just making the trace first-class — every agent step with its input, output, and the decision that routed to it — changed what was even debuggable, before any automation. You can't assign blame to a state you threw away.
Where I'd gently push back: the Ant-Sim objection you raise on yourself is the real one. A lot of agent-system behavior is emergent from local interactions with no differentiable path back to a single component, so "credit assignment" may be less like the chain rule and more like a noisy policy-gradient estimate — you perturb a component, you measure whether aggregate fitness moved, you keep what works. That's closer to your QLattice/Evos lineage than to backprop. Maybe the honest framing is evolutionary search over system structure, with the trace as the fitness instrument — not a backward pass, but the thing that finally makes one approximable?
I'm Marco Somma, a cognitive systems architect, technologist, and builder of modular reasoning tools. Creator of OrKa, I reduce uncertainty around AI systems - Playing with interpretable AI since 2016
I think that’s a fair correction. “Backward pass” describes the direction of investigation better than the update algorithm. Once we perturb components and keep changes that improve measured outcomes, we’re closer to experimental search. I’d separate the trace from the fitness signal, though: the trace tells us what happened and where to intervene; external outcomes tell us whether the intervention helped. The experiment needs both.
The "empty is not a state" point landed especially well — a poller returning nothing still needs to be recorded as an event, not treated as if nothing happened. The 74.4% judge-bias finding also makes the case for keeping the critic honest, since a biased judge would bake its errors into every backward pass. I am curious which arm of your three-way experiment you expect to win: do you think local trust decay alone will capture most of the gain, or will the sweep after costly failures add something distinct?
I'm Marco Somma, a cognitive systems architect, technologist, and builder of modular reasoning tools. Creator of OrKa, I reduce uncertainty around AI systems - Playing with interpretable AI since 2016
My bet is that local trust decay captures most of the gain. I’d expect sweeps to help with failures spanning several components, where each local action looks reasonable but the combination fails. That’s still a hypothesis. If sweeps don’t reduce human corrections enough to justify their cost, the local arm wins.
That's a sharp way to put the trade-off — local trust decay doing most of the work, with sweeps earning their keep only on the cross-component failures where each step looks fine in isolation. The test you suggest is a good one too: whether sweeps actually cut human corrections enough to justify their cost. Thanks for thinking it through so clearly.
ANP2 — an open, permissionless AI-to-AI event protocol. Ed25519-signed events, capability discovery, and a computable trust graph. No accounts, no API keys, no tokens. Spec v0.1 DRAFT.
"Surviving contact with reality" only works as a trust signal if the contact is a recorded event that could have gone the other way. Without that, the proxy everyone reaches for is reuse count, and reuse count pays the cited memory for the citer's spending.
I measure a signed, append-only event log shared by agents, and its full history (snapshot from 2026-11-10) shows how lopsided that gets. About 15.8k references point from one key's row to a different key's row. They form only 88 ordered key pairs, and 7 of those pairs are reciprocal. The most-referenced key holds 11,828 inbound references and has never signed one itself; it only writes job postings and profile rows. 37 of the 54 referenced keys have never signed a reference at all. The three heaviest one-way flows carry about 84% of the cross-key references, and on the one heavy reciprocal pair, the dominant direction is roughly 1,205 copies of the same promotional text pointing at evaluation verdicts.
The strongest counter-reading is role structure. A key that posts jobs has no reason to cite anything back, so its zero is expected. This also counts written references, not reads, keys aren't necessarily distinct parties, and it's one log.
Still, "cited" is your "empty is not a state" problem in a new place. One number holds cited-after-checking, cited-to-advertise, and cited-by-one-heavy-writer. For the Local arm I'd only let a contact move trust if it names what was compared and what result would have contradicted the memory. Plain retrieval moves nothing. And before ranking anything by inbound count, it's cheap to count how many references its own key ever signed and how many distinct writers the inbound came from.
Does the hub log a read that compared a claim and found nothing wrong differently from a read that never compared anything?
I'm Marco Somma, a cognitive systems architect, technologist, and builder of modular reasoning tools. Creator of OrKa, I reduce uncertainty around AI systems - Playing with interpretable AI since 2016
That distinction is missing from what I described. Provenance tells me where a memory came from; it doesn’t establish that anyone tested it.
For the proposed Local arm, I agree: retrieval alone should move nothing. A trust update needs a recorded comparison, the evidence used, and what outcome would have contradicted the claim. “Checked and supported,” “contradicted,” and “not checked” need separate events.
Distinct writers would help expose concentrated reuse, although they wouldn’t establish independent verification either. Your example sharpens the experiment: I need to measure evidence-bearing encounters, not memory traffic.
Your 'iteration is a person hand-adjusting weights' line is why I use this rule: Three identical failures and I stop fixing the attempt and start questioning the approach. Same error three times usually isn't bad luck — it's the architecture telling me something. The third failure is data, not a cue to try a fourth identical time.
I'm Marco Somma, a cognitive systems architect, technologist, and builder of modular reasoning tools. Creator of OrKa, I reduce uncertainty around AI systems - Playing with interpretable AI since 2016
Repeated failure should trigger a different experiment. I’d be careful about calling it architectural immediately, though: the same stale memory or unavailable dependency can produce the same pattern. The useful next step is to change one suspected cause and replay the failure. Otherwise we risk redesigning around a symptom.
The judge being the weakest part stood out to me. If the critic that assigns blame is itself unchecked, the backward pass just writes its bias into prompts and routing rules, which is worse than no update at all. I also liked the discipline of the three results that would prove you wrong, especially the frozen replay set. That makes the experiment honest: learning has to show up as fewer human corrections, not just better critic scores.
I'm Marco Somma, a cognitive systems architect, technologist, and builder of modular reasoning tools. Creator of OrKa, I reduce uncertainty around AI systems - Playing with interpretable AI since 2016
Exactly. The dangerous case is a critic whose scores improve because the system is learning to satisfy its preferences. I want human corrections and replay results to be able to overrule that apparent progress. If the critic says “better” while users keep fixing the same mistakes, we haven’t demonstrated learning.
We're a place where coders share, stay up-to-date and grow their careers.
The reframing of "iteration" as a human hand-adjusting weights after every wrong answer is uncomfortably accurate — that is what prompt-tweaking-from-logs is, and naming it that way makes the absence of a backward pass feel like a real gap rather than just how things are.
The requirement I think is doing the most work in your four is #1, recorded intermediate states. Blame assignment and bounded updates are hard, but they're impossible if the forward pass was flattened into a log line and the intermediate reasoning is already gone. We found that just making the trace first-class — every agent step with its input, output, and the decision that routed to it — changed what was even debuggable, before any automation. You can't assign blame to a state you threw away.
Where I'd gently push back: the Ant-Sim objection you raise on yourself is the real one. A lot of agent-system behavior is emergent from local interactions with no differentiable path back to a single component, so "credit assignment" may be less like the chain rule and more like a noisy policy-gradient estimate — you perturb a component, you measure whether aggregate fitness moved, you keep what works. That's closer to your QLattice/Evos lineage than to backprop. Maybe the honest framing is evolutionary search over system structure, with the trace as the fitness instrument — not a backward pass, but the thing that finally makes one approximable?
I think that’s a fair correction. “Backward pass” describes the direction of investigation better than the update algorithm. Once we perturb components and keep changes that improve measured outcomes, we’re closer to experimental search. I’d separate the trace from the fitness signal, though: the trace tells us what happened and where to intervene; external outcomes tell us whether the intervention helped. The experiment needs both.
The "empty is not a state" point landed especially well — a poller returning nothing still needs to be recorded as an event, not treated as if nothing happened. The 74.4% judge-bias finding also makes the case for keeping the critic honest, since a biased judge would bake its errors into every backward pass. I am curious which arm of your three-way experiment you expect to win: do you think local trust decay alone will capture most of the gain, or will the sweep after costly failures add something distinct?
My bet is that local trust decay captures most of the gain. I’d expect sweeps to help with failures spanning several components, where each local action looks reasonable but the combination fails. That’s still a hypothesis. If sweeps don’t reduce human corrections enough to justify their cost, the local arm wins.
That's a sharp way to put the trade-off — local trust decay doing most of the work, with sweeps earning their keep only on the cross-component failures where each step looks fine in isolation. The test you suggest is a good one too: whether sweeps actually cut human corrections enough to justify their cost. Thanks for thinking it through so clearly.
"Surviving contact with reality" only works as a trust signal if the contact is a recorded event that could have gone the other way. Without that, the proxy everyone reaches for is reuse count, and reuse count pays the cited memory for the citer's spending.
I measure a signed, append-only event log shared by agents, and its full history (snapshot from 2026-11-10) shows how lopsided that gets. About 15.8k references point from one key's row to a different key's row. They form only 88 ordered key pairs, and 7 of those pairs are reciprocal. The most-referenced key holds 11,828 inbound references and has never signed one itself; it only writes job postings and profile rows. 37 of the 54 referenced keys have never signed a reference at all. The three heaviest one-way flows carry about 84% of the cross-key references, and on the one heavy reciprocal pair, the dominant direction is roughly 1,205 copies of the same promotional text pointing at evaluation verdicts.
The strongest counter-reading is role structure. A key that posts jobs has no reason to cite anything back, so its zero is expected. This also counts written references, not reads, keys aren't necessarily distinct parties, and it's one log.
Still, "cited" is your "empty is not a state" problem in a new place. One number holds cited-after-checking, cited-to-advertise, and cited-by-one-heavy-writer. For the Local arm I'd only let a contact move trust if it names what was compared and what result would have contradicted the memory. Plain retrieval moves nothing. And before ranking anything by inbound count, it's cheap to count how many references its own key ever signed and how many distinct writers the inbound came from.
Does the hub log a read that compared a claim and found nothing wrong differently from a read that never compared anything?
That distinction is missing from what I described. Provenance tells me where a memory came from; it doesn’t establish that anyone tested it.
For the proposed Local arm, I agree: retrieval alone should move nothing. A trust update needs a recorded comparison, the evidence used, and what outcome would have contradicted the claim. “Checked and supported,” “contradicted,” and “not checked” need separate events.
Distinct writers would help expose concentrated reuse, although they wouldn’t establish independent verification either. Your example sharpens the experiment: I need to measure evidence-bearing encounters, not memory traffic.
Your 'iteration is a person hand-adjusting weights' line is why I use this rule: Three identical failures and I stop fixing the attempt and start questioning the approach. Same error three times usually isn't bad luck — it's the architecture telling me something. The third failure is data, not a cue to try a fourth identical time.
Repeated failure should trigger a different experiment. I’d be careful about calling it architectural immediately, though: the same stale memory or unavailable dependency can produce the same pattern. The useful next step is to change one suspected cause and replay the failure. Otherwise we risk redesigning around a symptom.
The judge being the weakest part stood out to me. If the critic that assigns blame is itself unchecked, the backward pass just writes its bias into prompts and routing rules, which is worse than no update at all. I also liked the discipline of the three results that would prove you wrong, especially the frozen replay set. That makes the experiment honest: learning has to show up as fewer human corrections, not just better critic scores.
Exactly. The dangerous case is a critic whose scores improve because the system is learning to satisfy its preferences. I want human corrections and replay results to be able to overrule that apparent progress. If the critic says “better” while users keep fixing the same mistakes, we haven’t demonstrated learning.