Changelog

What shipped, and what the research found.

Each project keeps its own record of releases or research. This page puts them in one list, newest first. Research entries carry their status, including the runs that failed. Open any entry to read it in full on its project’s page.

By project

October 2026

  1. 1.14.0System Pulse

  2. 1.13.0System Pulse

  3. 1.11.0 to 1.12.0System Pulse

  4. 0.4.18Multithread

September 2026

  1. 0.4.17Multithread

  2. Wordship

  3. Wordship

  4. 0.4.16Multithread

  5. 0.31.0Zoning Signal

    Search finds names and numbers, and says what it covers

    semantic_search now ranks every record three ways at once, by the words in its text, by its title and by meaning, and fuses the three lists.

  6. 1.10.1System Pulse

  7. completedLichtenberg

    Reversal training carries to familiar pairs only

    Teaching the small model to handle reversed order on half of its familiar option pairs carried over to the other half in all four runs, and in none of the four to pairs it had not seen as options.

    • Limit It shows a bounded training effect on one task and does not establish a general rule or an internal pointer. The miss on new pairs may reflect their difficulty.
  8. Cycle 23completedAdaptive rank fusion

    Grouping a team's archived runs beats a randomly chosen member on average

    Across 29 submission groups and 30 topics, averaging a team's rankings before adding one fixed reference run beats adding that run to a uniformly chosen single member, raising mean top-ten precision by 0.24 to 6.35 points under every completion of missing labels.

    • Limit This covers the current archive files on 30 reused topics (78 of 81 differ from their listed checksums), is not a new method, and only 13 of 29 teams are positive on their own.
  9. Cycle 22failedAdaptive rank fusion

    Acquisition stopped before evaluation

    The first archived run's bytes did not match the publisher's listed checksum, so the frozen 81-submission comparison stopped before any evaluation.

    • Limit This is a data identity failure. It gives no evidence for or against averaging submitted outputs.
  10. Cycle 21designedAdaptive rank fusion

    An 81-run test frame and a counterexample on control design

    Official metadata yields 29 eligible teams with 81 automatic submissions for a grouped test, and an exact synthetic case shows the earlier control design allows effects of either sign.

    • Limit Metadata and synthetic work only: no new ranking was downloaded or evaluated.
  11. Wordship

  12. 1.10.0System Pulse

  13. 1.9.30System Pulse

  14. completedLichtenberg

    Output format decides whether a learned choice survives reordering

    Every version learned the task in its trained order. When the two options were listed in reverse, answers given in fixed positions stayed accurate, while answers written as option labels fell short of the accuracy bar, though they partly adapted.

    • Limit It is a result about what the task demands, and it leaves open both the internal mechanism and whether reversal can be learned in general.
  15. failedLichtenberg

    The small model could not pick the asked-for row at this budget

    Asked to select one of two displayed probability rows, the unchanged small network missed the target in every run, reacting about equally to the row it was asked about and the one it was not.

    • Limit The result holds for this model, task and training budget, and does not show the design is incapable of it.
  16. Cycle 20not promotedAdaptive rank fusion

    Natural alignment loses to the mean of shuffled controls

    The variants' natural fusion scores about 1.6 points of top-ten precision below the mean of 256 predeclared shuffled controls under every completion of missing labels, excluding the proposed advantage.

    • Limit The controls are built from relevance labels, so their higher mean serves as a diagnostic and cannot be used as a retrieval policy.
  17. Cycle 19diagnosticAdaptive rank fusion

    The exact-pipeline transfer is unavailable

    None of four later TREC-COVID rounds supplies all four original retrieval roles, so the transfer stopped before any rankings or judgments were acquired.

    • Limit This is a feasibility result. It is neither a negative retrieval result nor proof that transfer is impossible.
  18. Cycle 18completedAdaptive rank fusion

    Two related variants at a fixed weight: main comparison unresolved

    With two documented variants in place of two repeated copies, the hybrid beats the neural-reranked source alone by 1.7 to 2 points of top-ten precision, but its comparison with the existing hybrid stays between minus 1 and plus 2 points.

    • Limit These are development results on the same 30 reused topics. No untouched query was tested.
  19. Cycle 17not promotedAdaptive rank fusion

    A relevant admission can still be an unhelpful exchange

    On 30 TREC-COVID topics, swapping one minority-source result into a two-source hybrid's top ten cannot raise top-ten precision, because its seven relevant admissions displaced seven relevant results.

    • Limit The planned later-label phase failed its preservation check and the follow-up was post hoc. The result covers one fixed policy on 30 reused topics and leaves open whether minority evidence is useful.
  20. Cycle 16diagnosticAdaptive rank fusion

    Equal weights keep results found only by the neural source out of the top ten

    On SciFact, 21 known-relevant documents appear only in the neural source's list, yet on every query ten lexically supported documents outrank every result only the neural source retained, so none reaches the fused top ten.

    • Limit This describes existing lists after the fact and tests neither reweighting nor reserved slots.
  21. 1.52.0Bendr

  22. Wordship

  23. Wordship

  24. 1.7.0 to 1.9.29System Pulse

    32 releases in a day

  25. Wordship

  26. 1.2.0 to 1.6.0System Pulse

  27. Wordship

  28. 0.4.12 to 0.4.15Multithread

  29. Wordship

  30. 1.1.0System Pulse

  31. 1.0.1System Pulse

  32. 0.30.0Zoning Signal

    Maps of the whole region, measured rather than drawn

    Every covered county now has a map: 25 jurisdictions across Lake, Orange, Osceola, Polk and Seminole, projected from Census TIGER boundaries, with the worst deviation from the source at 0.62 rendered pixels.

  33. 1.0.0System Pulse

  34. 0.29.0Zoning Signal

    trace_connection: routes between named things

    A new MCP tool finds the routes between two entities, meetings or named patterns.

  35. 1.47.0 to 1.51.0Bendr

  36. 0.28.0Zoning Signal

    Private residents are no longer named

    People who appear in the record only as public-comment speakers, commenters or neighbouring owners are now "a resident", and their home addresses "[address withheld]", across every reading and meeting record.

  37. 1.41.0 to 1.46.0Bendr

  38. 1.32.0 to 1.40.0Bendr

  39. 0.4.9 to 0.4.11Multithread

  40. 1.23.0 to 1.31.0Bendr

  41. 0.4.3 to 0.4.8Multithread

  42. 1.4.0 to 1.22.0Bendr

  43. 0.2.0 to 0.4.2Multithread

  44. Cycle 15completedAdaptive rank fusion

    SciFact transfer: adding a source helps, simpler baselines lead

    Adding SPLADE++ to four lexical lists raised mean binary nDCG@10 from 0.667 to 0.687 across 300 queries, but SPLADE++ alone (0.704) and a simple two-source hybrid (0.705) scored higher.

    • Limit One collection with conventional binary scoring supports no new fusion method, generalization or significance claim.
  45. 1.3.0Bendr

  46. diagnosticLichtenberg

    The trained models did not follow the local route weights

    Rereading the saved predictions, the two models' choices sat further from each graph's actual route weights than a uniform guess would.

    • Limit It is a look back at results already seen, with no new model runs, and identifies no internal mechanism.
  47. diagnosticLichtenberg

    The trained models barely respond when the goal changes

    Across 512 paired prompts, swapping the requested goal shifted the models' route choices by about a hundred-thousandth of what an exact reference shifts, and their routing stayed slightly worse than uniform.

    • Limit The tiny responses that remain do not show useful goal use, and cannot say whether they are noise or come from any internal mechanism.
  48. designedLichtenberg

    A shortcut that could produce high success, and a test to expose it

    Analysis showed that copying the requested ending and following the list of legal moves reaches 97.73 percent success while ignoring the graph's route weights, and a paired audit was designed around that shortcut.

    • Limit Designed and not yet run. The shortcut is a worked control on reduced models, and it was not fitted to the trained ones.
  49. failedLichtenberg

    Two small models reach the goal but do not route by it

    Two small neural networks trained on the graphs reached the requested ending with 97.5 and 94.6 percent success, computed exactly over every graph and goal tested, yet their route choices were further from the ideal than unguided walking.

    • Limit Reaching the goal often does not show the models learned goal-guided routes, and interpretation was deferred.
  50. Cycle 14designedAdaptive rank fusion

    Preparing a transfer that can answer the question

    The cycle fixed a new scientific-abstract collection, five systems and the metric bridge before inspecting any effectiveness result.

    • Limit Preparation only: no retrieval effectiveness was measured.
  51. Cycle 13completedAdaptive rank fusion

    Adding SPLADE++ lifts both query sets, with query reversals

    Under a fixed top-ten diagnostic metric, adding SPLADE++ to four-source rank fusion raises the mean on both query sets under every allowed completion of missing judgments, though 9 queries favor the original fusion.

    • Limit This is a finite result on heavily reused development queries. It shows no general superiority and gives no basis for routing queries.
  52. Cycle 12diagnosticAdaptive rank fusion

    No justified agent experiment in the existing material

    An inspection of existing retrieval data and one real provenance question found that direct lookup and hash checking already answer it, so no new solver or multi-agent experiment was run.

    • Limit This is a retrospective inspection by investigators who knew the project history. No preregistered experiment was run.
  53. Cycle 11completedAdaptive rank fusion

    Correct answers and validity judgments under copied support

    A single language-model verifier gave 4 of 4 correct answers and 16 of 16 correct validity judgments whether valid support was the minority or the majority, leaving no gap here for a multi-agent stage to repair.

    • Limit Direct program solving could produce every correct output, so the result does not show the verifier relied on the evidence.
  54. Cycle 10diagnosticAdaptive rank fusion

    A balanced panel rules out the named answer shortcuts

    Across six calls, a language model returned all 18 trace judgments correctly, a pattern no named position, constant or endpoint-only shortcut reproduces.

    • Limit The panel reuses six traces from one arithmetic program, so it shows correct outputs on that program and does not measure general verification ability.
  55. Cycle 9diagnosticAdaptive rank fusion

    Correct certificate judgments with an unresolved shortcut

    A language model correctly accepted one valid execution trace and rejected two invalid ones, before and after copies of a bad trace were added.

    • Limit A simpler positional policy also scores perfectly here, so the result does not show step-by-step checking.
  56. designedLichtenberg

    Designing the first trained-model test

    A bounded test of whether a small neural network trained on these graphs learns to steer toward a requested goal was designed, and a separate check with no training showed its passes stay within an ordinary processor's limits.

    • Limit Nothing was trained, so no model had learned anything yet, and all six predictions about internal mechanisms remained untested.
  57. completedLichtenberg

    The option to change course later does not explain the split

    Rechecking the saved values, all 216 pairs still called for different first moves when the final move was forced to be the same, so a later chance to revise does not explain the difference.

    • Limit It holds for one problem family, horizon and reset price. Six single decisions changed when the next state could be seen, but that did not pass the controlled test.
  58. completedLichtenberg

    When a memory summary is not enough over two episodes

    Across all 27,225 reachable states of a small two-episode problem, 216 pairs share a compressed summary and the same best single move yet need opposite first moves once reinforcement carries into a second episode.

    • Limit These histories were prescribed, so they say nothing about how often this happens.
  59. completedLichtenberg

    Bounding what a compressed memory can know

    An exact calculation of the range of goal chances consistent with a compressed memory settled the right action in 508 of 512 cases at one set of prices.

    • Limit It uses one fixed price profile on one graph and supports no claim about average efficiency or the general value of extra information.
  60. completedLichtenberg

    Recovery from a wrong ending when route memory is kept

    On a small diamond-shaped graph, searches that first learned the wrong ending recovered in 231 of 256 runs when their route memory was kept, against 255 of 256 when the preference for that ending was erased.

    • Limit It covers one small graph with fixed settings, and which intervention looks best depends on how recovery is measured.
  61. diagnosticLichtenberg

    Trying to reproduce a dropped value, without success

    Sixty-four fresh language-model calls that varied the suspected causes produced no omissions, and all 256 retained values were correct.

    • Limit Every task returned to its starting state, so copying the input would also score perfectly, and the earlier failure stays unexplained.
  62. completedLichtenberg

    A model keeping a running record, with and without an archive

    Over 48 language-model sessions every answer the record supported came back correct, but both conditions dropped the same known earlier value on identical input, and access to an archive repaired it at the next step.

    • Limit It is one failure pattern on one pair of identical inputs, and gives no error rate.
  63. completedLichtenberg

    A language model pulling records out of a history

    Extracting records from 11 fixed histories, a language model reached the 55 percent ceiling that a two-record lookup allows under both prompts, so the added guidance showed no gain.

    • Limit The task hit its ceiling, so it cannot show whether guidance helps, and it shows narrow model behavior, with no mechanism identified.
  64. completedLichtenberg

    Pricing what a search should remember

    An exact cost model comparing 20 fixed policies over 160 traces showed the cheapest one depends on the prices assumed: look information up when an archive is cheap, keep it when the archive is expensive.

    • Limit The costs are declared assumptions, and nothing here tests a learned summary or a neural network.
  65. completedLichtenberg

    How quickly a search recovers from memory built on a wrong answer

    As reinforcement grew stronger, searches whose route memory started on the wrong answer recovered in 247, then 59, 3 and 0 of 256 runs. A sharp final answer appeared even without memory, so sharpness alone does not show memory at work.

    • Limit It covers this exact model only, and did not test for a sudden tipping point or for trained networks.
  66. correctionLichtenberg

    Correcting the first graph results

    Rereading the saved runs showed the combined system held on to a found route far more reliably than the comparison with a degraded guide (0.999 against 0.409) but found it more slowly, so the claim of faster discovery was withdrawn.

    • Limit No new experiment was run, and those numbers came from an early controller that used the true goal to decide what to reinforce, changed before wrong goals were tested.
  67. Cycle 8designedAdaptive rank fusion

    Loop-length panel built, then parked before any model calls

    Eight matched programs passed their construction checks, but an answer imbalance meant an always-false guess could mimic a difficulty effect, so the solver batch was parked.

    • Limit No model responses were collected in this cycle.
  68. Cycle 7failedAdaptive rank fusion

    Complete collection, no observed error variation

    Two prompt variants answered all eight small programs correctly, so the gate requiring observable errors and disagreement failed and the setup was parked.

    • Limit This is a negative feasibility result for one small task and says nothing about solver accuracy in general.
  69. Cycle 6failedAdaptive rank fusion

    Noisy provenance, incomplete empirical comparison

    Three valid responses closely matched the noise-aware answers, but the provider refused the fourth call and the fixed workflow stopped with four inputs unsent.

    • Limit With five of eight planned inputs lacking a valid response, the primary comparison is null.
  70. Cycle 5 replicationcompletedAdaptive rank fusion

    A language model matches the exact Bayesian answers

    With the collector fixed, a language model returned probabilities within 0.00000004 of the exact Bayesian answers on all 20 fixed requests, including the difference between copied and independent agreement.

    • Limit This covers one small, fully specified synthetic model. It does not measure real-world calibration or general reasoning.
  71. Cycle 5failedAdaptive rank fusion

    An instrument failure, preserved

    The collector misread empty agent counters as activity and stopped the batch after its first response, leaving the planned test incomplete.

    • Limit The stop came from a measurement bug in the collector, and no model reasoning failure was involved.
  72. Cycle 4completedAdaptive rank fusion

    What evidence origin changes, and what it does not

    In an exact synthetic model, knowing which reports share an origin improves probability estimates, while always protecting the dissenting minority makes them worse.

    • Limit These are properties of a deliberately constructed model. No language-model gain was measured and no new aggregation method is claimed.
  73. Cycle 3not promotedAdaptive rank fusion

    The observed association does not clear the next-step gate

    Neither year's link between corroboration and relevance cleared the preset ten-point threshold across resampling, so the protocol stopped this branch and moved to a model with known truth.

    • Limit Stopping was a resource decision and leaves open whether specialist sources are useful.
  74. Cycle 2diagnosticAdaptive rank fusion

    Better observations reveal a different ambiguity

    SPLADE++ supplies many more judged examples than the lexical sources of top-ten documents no other source ranks highly, but for those documents, support from other lists cannot be separated from whether the old lexical candidates contained them at all.

    • Limit This cycle counted candidates and judgments only; no ranking metric or fusion result was computed.
  75. Cycle 1correctionAdaptive rank fusion

    What counts as independent evidence?

    After correcting the rank offset and tie handling, a tuned k still helps one six-ranker setup, but it lowers the original four-ranker setup and both transfers between the two query sets lose.

    • Limit Results come from 43 and 54 reused queries, generated lexical rankers and partial relevance judgments.
  76. 1.1.0 to 1.2.0Bendr

  77. 1.0Bendr

August 2026

  1. 2026.08.30.1 to 2026.08.30.3Ascend

  2. 0.27.0Zoning Signal

    Six more cities, SB 180 read again, and a faster site

    Orlando, Kissimmee, Mount Dora, Eustis, Tavares and Montverde join the corpus: 83 harvested documents, six place dossiers, 25 cities in all.

  3. 2026.08.04.1Ascend

    The plates are already waiting

    On a plate-loaded exercise, type a working weight and see a live plate summary before you leave the keypad.

  4. 2026.08.01.1Ascend

    Your drafts stay put

    Set values now save as you type, whether or not the set is marked complete.

July 2026

  1. 2026.07.31.1 to 2026.07.31.3Ascend

    Three releases in a day

  2. 2026.07.30.1Ascend

    Rest that stays true

    See a truthful end time and open detailed controls over your workout without stopping the countdown.

  3. 2026.07.29.1Ascend

    Set logging, dialed in

    Weight, set type, muscle focus, and duration now live where you expect them, while the active row stays visible as you type.

  4. 2026.07.27.2Ascend

    Exercises, without guesswork

    Browse and add exercises through one clear library, with muscle and training context before you choose.

  5. 2026.07.27.1Ascend

    Progress, while you train

    Keep records and improvements visible in a live Progress Ledger, beside a calmer rest controller that belongs to the workout.

  6. 2026.07.25.2 to 2026.07.25.5Ascend

    Four releases in a day

  7. 2026.07.23.2 to 2026.07.23.5Ascend

    Four releases in a day

  8. 2026.07.22.2Ascend

    Settings, made yours

    A calmer Settings control center keeps your profile, training, privacy, support, and account controls clear without showing everything at once.

  9. 2026.07.22.1Ascend

    The League, up to date

    Pull to refresh every League view, with standings that make the current week and a fresh start clear.

  10. 2026.07.21.1Ascend

    Your display, composed

    Display now starts with one complete preview and reveals each layer of customization only when you want it.

  11. 2026.07.20.2 to 2026.07.20.4Ascend

    Three releases in a day

  12. 2026.07.19.1Ascend

    Rest cues, engineered

    Rest timing now feels intentional: a rising three-count, a decisive finish, and cues composed around how you train.

  13. completedLichtenberg

    First graph runs: steering toward a goal, and how it goes wrong

    The first runs on one family of constructed graphs were summarized at the time as four predictions confirmed, one measuring instrument failed, and a mixed verdict on how a wrong goal signal leads the search astray.

    • Limit That summary was later superseded: the faster-discovery prediction was unsupported, and the early controller had used the true goal when deciding what to reinforce.

June 2026

  1. 0.26.0Zoning Signal

    The Water Line, and an agent surface rebuilt

    The corridor's binding constraint moves from roads to water.

May 2026

  1. 0.16.0Zoning Signal

  2. 0.15.0Zoning Signal

    The Mirror: The Observatory Observes Itself Being Observed

    The agent surface now logs every tool call, accepts feedback from agents through a new MCP tool, and publishes what it reads at /agent-observatory.

  3. 0.14.0Zoning Signal

    The Attorney + Broker Projections: Lens Architecture Reconciled to Canon

    The lens values agents use to request a stakeholder's view had drifted from the canonical roster, and this release restores it: synthesis plus seven stakeholder lenses, including broker and attorney.

  4. 0.11.0 to 0.13.0Zoning Signal

  5. 0.7.0 to 0.10.0Zoning Signal

  6. 0.6.0Zoning Signal

    The Meeting Record Opens

    The full standardized meeting record from January 2024 through May 2026 is now readable: 92 meetings of the Clermont, Leesburg, Minneola and Groveland planning and zoning boards, each at its own URL with its items, a public-comment summary, key signals and a source trail.

April 2026

  1. 0.1.5 to 0.5.0Zoning Signal

  2. 0.1.0 to 0.3.0Wordship

  3. 0.1.0Zoning Signal

    Zoning Signal Observatory: First Publish

    The Zoning Signal Observatory is live.