@hviana/sema 0.4.0 → 0.4.2

package/CONTRIBUTING.md

@@ -1,15 +1,97 @@
-# Contributing
+# Contributing to Sema
 
-By contributing to Sema, you agree that:
+Thank you for your interest in contributing to Sema.
 
-- you have the legal right to submit your contribution;
-- your contribution does not violate third-party rights;
-- your contribution will be licensed under the PolyForm Noncommercial License
-  1.0.0;
-- this project is source-available, not formally open source;
-- commercial use requires a separate paid license;
-- you will not submit secrets, credentials, private keys, or confidential data.
+Sema is source-available software distributed publicly under the PolyForm
+Noncommercial License 1.0.0. Commercial use requires a separate commercial
+license from the Sema licensor.
 
-All commits should be signed off:
+## Contributor representations
 
+By submitting a contribution to Sema, you represent that:
+
+- you created the contribution or otherwise have the legal right to submit it
+  under these terms;
+- the contribution does not knowingly violate any copyright, patent, trade
+  secret, contractual obligation, or other third-party right;
+- you have obtained any authorization required from your employer or another
+  rights holder;
+- you have clearly identified any third-party material included in the
+  contribution and provided its applicable license and copyright notices;
+- the contribution does not contain secrets, credentials, private keys,
+  confidential information, or unlawfully obtained material;
+- if the contribution was created with the assistance of an artificial
+  intelligence system, you have reviewed it and remain responsible for its
+  origin, legality, correctness, and compliance with these terms.
+
+## Contribution license grant
+
+You retain ownership of the copyright in your contribution.
+
+By intentionally submitting a contribution for inclusion in Sema, you grant
+Henrique Viana, as the author, copyright holder, and licensor of Sema, and his
+successors and assigns, a worldwide, perpetual, irrevocable, non-exclusive,
+royalty-free, transferable, and sublicensable license to:
+
+- use, reproduce, modify, adapt, and prepare derivative works from the
+  contribution;
+- combine the contribution with Sema or other materials;
+- publicly display, publicly perform, distribute, make available, host, and
+  otherwise exploit the contribution;
+- offer, license, and sublicense the contribution as part of Sema under the
+  PolyForm Noncommercial License 1.0.0;
+- offer, license, and sublicense the contribution as part of commercial,
+  proprietary, source-available, or other versions of Sema;
+- relicense the contribution as part of Sema under current or future licensing
+  terms.
+
+This license grant does not transfer ownership of your contribution to Henrique
+Viana. You remain free to use and license your original contribution
+independently, provided that doing so does not violate rights belonging to Sema
+or to third parties.
+
+## Patent license
+
+To the extent that you own or control patent claims necessarily infringed by
+your contribution, you grant Henrique Viana, his successors and assigns, and
+recipients of Sema a worldwide, perpetual, irrevocable, non-exclusive,
+royalty-free, transferable, and sublicensable patent license to make, use, sell,
+offer for sale, import, and otherwise exploit your contribution as part of Sema.
+
+This patent license terminates for any party that initiates patent litigation
+alleging that Sema or a contribution incorporated into Sema infringes a patent.
+
+## No obligation to accept contributions
+
+Submitting a contribution does not guarantee that it will be accepted, merged,
+published, maintained, or included in any public or commercial version of Sema.
+
+The project maintainer may modify, reject, remove, or replace an accepted
+contribution.
+
+## Developer Certificate of Origin
+
+All commits must include a Developer Certificate of Origin sign-off:
+
+```bash
 git commit -s
+```
+
+The sign-off must use your real name and an email address you are authorized to
+use:
+
+```text
+Signed-off-by: Your Name <your.email@example.com>
+```
+
+The sign-off certifies the origin and authorization of each commit. It does not
+replace the contribution license grant described in this document.
+
+## Acceptance
+
+By opening or submitting a pull request, patch, or other contribution intended
+for inclusion in Sema, you confirm that you have read and agree to these
+contribution terms.
+
+Contributions submitted on behalf of a company or another organization must be
+authorized by the applicable rights holder.

package/LICENSE.md

@@ -2,8 +2,8 @@
 
 <https://polyformproject.org/licenses/noncommercial/1.0.0>
 
-> Required Notice: Copyright Sema Authors — Henrique Viana, Marcelo Oliveira dos
-> Reis, Rogerio Nascimento (hv5088@gmail.com)
+> Required Notice: Copyright © Henrique Viana (author). Marcelo Oliveira dos
+> Reis and Rogerio Nascimento (supporters).
 
 ## Acceptance
 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@hviana/sema",
-  "version": "0.4.0",
+  "version": "0.4.2",
   "description": "Sema: a non-parametric, instance-based reasoning system.",
   "type": "module",
   "main": "dist/src/index.js",

package/src/ingest-cache.ts

@@ -42,6 +42,8 @@ import { bindSeat, companySignature, type Sema } from "./sema.js";
 import type { Input } from "./mind/index.js";
 import { BoundedMap } from "./store.js";
 import type { Vec } from "./vec.js";
+import { invalidateStructuralCaches } from "./mind/traverse.js";
+import { invalidateJunctionCache } from "./mind/junction.js";
 
 /** The interned result of perceiving + interning ONE input.
  *
@@ -122,6 +124,8 @@ export class CachedIngest {
     input: Input | (Input | [Input, Input])[],
     second?: Input,
   ): Promise<(Sema & { id: number }) | undefined> {
+    invalidateStructuralCaches(this.mind);
+    invalidateJunctionCache(this.mind);
     // One shape-reading for both ingest paths — see {@link dispatchIngest}.
     return dispatchIngest(
       input,

package/src/meter.ts

@@ -176,6 +176,11 @@ export class Meter {
   /** Nodes popped by those ascents, against their √N·W budget — the counter
    *  that shows whether the walks are deciding early or burning the budget. */
   junctionPops = 0;
+  /** Arbitrary byte spans whose distributional company was VSA-bundled from
+   *  existing episode halos. */
+  spanHalos = 0;
+  /** Canonical W-windows examined while composing those span halos. */
+  spanHaloWindows = 0;
 
   /** `lightestDerivation` searches started. */
   searches = 0;

package/src/mind/attention.ts

@@ -2275,6 +2275,16 @@ async function crossRegionVotes(
   // the same container (or a sub-container of it) twice.
   const consumed = new Set<number>();
   let probes = 0;
+  // Once atoms themselves are hubs (N > W²), the cross-region analysis gets
+  // one k·W walk allowance per evidence tier. Without a shared allowance,
+  // each of k candidate pairs spends the full corpus-derived budget and a
+  // cumulative dialogue multiplies bounded work into tens of seconds. Small
+  // corpora retain exhaustive exact traversal: below this same scale the
+  // budget would be smaller than the structures the tests deliberately build.
+  const marketScale = k * ctx.space.maxGroup;
+  const corpusScale = N > marketScale ** 3;
+  const exactBudget = corpusScale ? { n: k * ctx.space.maxGroup } : undefined;
+  const synonymBudget = corpusScale ? { n: k * ctx.space.maxGroup } : undefined;
 
   for (let a = 0; a < cand.length && probes < k; a++) {
     if (consumed.has(cand[a])) continue;
@@ -2284,6 +2294,12 @@ async function crossRegionVotes(
       const rb = regions[cand[b]];
       if (!strong.has(cand[a]) && !strong.has(cand[b])) continue;
       if (ra.end >= rb.start) continue; // overlap or adjacent — nothing between
+      // In a cumulative conversation, an old↔old interaction cannot explain
+      // the user turn currently being answered; it was already available
+      // before that turn existed. Keep old↔current pairs (the current turn may
+      // refer to a prior answer), but do not repeatedly spend the junction
+      // budget recomposing two regions wholly before the current boundary.
+      if (ctx.currentTurnStart > 0 && rb.end <= ctx.currentTurnStart) continue;
       // Candidates strictly BETWEEN ra and rb (cand is sorted by start, so
       // that is exactly cand[a+1 .. b-1]) that already cast their OWN vote —
       // genuine, individually-corroborated evidence about what fills the gap
@@ -2364,7 +2380,7 @@ async function crossRegionVotes(
           cap,
           seedsOf(cand[a]),
           seedsOf(cand[b]),
-          undefined,
+          exactBudget,
           true,
         );
       if (probe) {
@@ -2384,6 +2400,7 @@ async function crossRegionVotes(
           maxInterior,
           true,
           sides,
+          synonymBudget,
         );
         if (probe) {
           const singleAttempted = sides.leftSiblings.length > 0 ||