neos-triage 0.2.0__tar.gz

neos_triage-0.2.0/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2026 Devieswar Kancheti
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

neos_triage-0.2.0/PKG-INFO

@@ -0,0 +1,81 @@
+Metadata-Version: 2.4
+Name: neos-triage
+Version: 0.2.0
+Summary: Triage structured event streams by exact law. No model in the decision.
+Author: Devieswar Kancheti
+License-Expression: Apache-2.0
+Project-URL: Homepage, https://github.com/devkancheti4-design/neos-triage
+Project-URL: Source, https://github.com/devkancheti4-design/neos-triage
+Project-URL: Issues, https://github.com/devkancheti4-design/neos-triage/issues
+Keywords: observability,alerting,triage,logs,siem,deterministic
+Classifier: Development Status :: 4 - Beta
+Classifier: Intended Audience :: System Administrators
+Classifier: Topic :: System :: Logging
+Classifier: Topic :: System :: Monitoring
+Classifier: Programming Language :: Python :: 3
+Requires-Python: >=3.9
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Dynamic: license-file
+
+# neos-triage
+
+**Triage structured event streams by exact law. No model in the decision.**
+
+    pip install neos-triage
+    neos /var/log/syslog
+
+An LLM triaging events spends most of its tokens deciding whether an event
+matters. That decision here is a handful of bit operations over a byte — so it
+costs nothing, and a model only writes words for the ~1% that survive.
+
+**75.9% fewer tokens** than a lean batched classifier, measured on 215,089 real
+events with both sides using the same safe dedup. → [USAGE.md](USAGE.md)
+
+## Read this before you deploy it
+
+Measured against ground truth the tool cannot see — filesystem-check exit codes
+recorded in a separate file — it caught **42 of 59** real incidents: **71.2%
+recall, 95% CI [58.6%, 81.2%]**.
+
+As originally shipped it caught **0 of 59**. A dedup credited with 97% of the
+token saving was hiding a failure that recurs 1,113 times. Fixing it cost 13
+points of the saving, because the 89% published earlier was the same result
+with the incidents removed.
+
+**False-page rate is still unmeasured.** Run it beside your existing alerting,
+not instead of it. `neos label` / `neos score` produce the evidence for your
+own stream. → [FAIR.md](FAIR.md), [DEPLOY.md](DEPLOY.md)
+
+## How it works
+
+    event ──[adapter]──► PACKET ──► ROUTE ─ hands settle ─► REDIAL ──► DECLINE
+              a regex                  every step below is bit operations
+
+`route()`, `redial()` and `decline()` are verified against compiled C kernels
+over **all 256 inputs**. Nothing is trained, tuned or fitted. The laws never
+see words — an adapter converts at the boundary and decides nothing, which is
+why text arriving in an event cannot reach the control path.
+
+Adapters auto-detect: syslog (ISO and BSD), `.NET`/Unity, tagged, NDJSON.
+Below a 50% parse rate it **refuses** rather than reporting a confident 0%.
+
+## What it will not do
+
+It reports. It cannot send, write, execute or act — no `subprocess`, no
+`exec`, no network, **zero dependencies**, all enforced by tests rather than
+claimed.
+
+## Tests
+
+    python3 tests/test_triage.py    # 22
+    python3 fairtest.py             # incident recall vs an independent oracle
+
+Two properties are *proved*, not sampled: the hand set is **total** over all 64
+packet shapes — no event is ruled and then dropped — and the decision path
+imports nothing.
+
+## Licence
+
+Apache-2.0. The sibling project that carries fluidfix's AGPL kernel is not
+distributed here.

neos_triage-0.2.0/README.md

@@ -0,0 +1,61 @@
+# neos-triage
+
+**Triage structured event streams by exact law. No model in the decision.**
+
+    pip install neos-triage
+    neos /var/log/syslog
+
+An LLM triaging events spends most of its tokens deciding whether an event
+matters. That decision here is a handful of bit operations over a byte — so it
+costs nothing, and a model only writes words for the ~1% that survive.
+
+**75.9% fewer tokens** than a lean batched classifier, measured on 215,089 real
+events with both sides using the same safe dedup. → [USAGE.md](USAGE.md)
+
+## Read this before you deploy it
+
+Measured against ground truth the tool cannot see — filesystem-check exit codes
+recorded in a separate file — it caught **42 of 59** real incidents: **71.2%
+recall, 95% CI [58.6%, 81.2%]**.
+
+As originally shipped it caught **0 of 59**. A dedup credited with 97% of the
+token saving was hiding a failure that recurs 1,113 times. Fixing it cost 13
+points of the saving, because the 89% published earlier was the same result
+with the incidents removed.
+
+**False-page rate is still unmeasured.** Run it beside your existing alerting,
+not instead of it. `neos label` / `neos score` produce the evidence for your
+own stream. → [FAIR.md](FAIR.md), [DEPLOY.md](DEPLOY.md)
+
+## How it works
+
+    event ──[adapter]──► PACKET ──► ROUTE ─ hands settle ─► REDIAL ──► DECLINE
+              a regex                  every step below is bit operations
+
+`route()`, `redial()` and `decline()` are verified against compiled C kernels
+over **all 256 inputs**. Nothing is trained, tuned or fitted. The laws never
+see words — an adapter converts at the boundary and decides nothing, which is
+why text arriving in an event cannot reach the control path.
+
+Adapters auto-detect: syslog (ISO and BSD), `.NET`/Unity, tagged, NDJSON.
+Below a 50% parse rate it **refuses** rather than reporting a confident 0%.
+
+## What it will not do
+
+It reports. It cannot send, write, execute or act — no `subprocess`, no
+`exec`, no network, **zero dependencies**, all enforced by tests rather than
+claimed.
+
+## Tests
+
+    python3 tests/test_triage.py    # 22
+    python3 fairtest.py             # incident recall vs an independent oracle
+
+Two properties are *proved*, not sampled: the hand set is **total** over all 64
+packet shapes — no event is ruled and then dropped — and the decision path
+imports nothing.
+
+## Licence
+
+Apache-2.0. The sibling project that carries fluidfix's AGPL kernel is not
+distributed here.

neos_triage-0.2.0/neos/__init__.py

@@ -0,0 +1,24 @@
+"""
+neos -- exact laws for routing work, with no model in the decision.
+
+    route(observation_byte)  -> how many voices open
+    redial(doubt_byte)       -> how many must agree
+    decline(act, demand)     -> whether the round is refused
+
+Every function is a handful of bit operations over a byte, verified against
+a compiled C kernel over all 256 inputs. Nothing is trained, tuned or fitted.
+
+The laws never see words. A transducer converts at each boundary and decides
+nothing. Where input already has fields -- events, alerts, telemetry --
+that transducer is free, which is where this pays for itself.
+"""
+from .laws import route, redial, decline, ACT, DEM, HAVE, NEED, KOF, fold_route
+from .measure import (hazards, doubts_actions, HAZARD_NAMES, DOUBT_NAMES,
+                      deciding_hazards, deciding_doubts)
+from .packet import Packet, SCHEMA
+
+__all__ = ["route", "redial", "decline", "ACT", "DEM", "HAVE", "NEED", "KOF",
+           "fold_route", "hazards", "doubts_actions", "HAZARD_NAMES",
+           "DOUBT_NAMES", "deciding_hazards", "deciding_doubts",
+           "Packet", "SCHEMA"]
+__version__ = "1.1.0"

neos_triage-0.2.0/neos/cli.py

@@ -0,0 +1,253 @@
+"""
+neos -- triage a structured event stream by exact law. No model in the loop.
+
+    python3 -m neos.cli /var/log/install.log
+    python3 -m neos.cli --json /var/log/syslog > verdicts.json
+    tail -f /var/log/app.log | python3 -m neos.cli -
+
+Every disposition is a few bit operations over a byte. Nothing is trained,
+nothing is sampled, and the same laws run here as in the mail agent -- see
+ALERTS.md for what that does and does not buy.
+"""
+import sys, json, collections, argparse, os
+from .stream import detect, read, ADAPTERS, Event
+from .triage import (encode, signature, Dedup, rule, default_hands,
+                     HAZARD_WHY, DOUBT_WHY)
+from .laws import ACT, DEM
+from .measure import HAZARD_NAMES, DOUBT_NAMES, deciding_hazards, deciding_doubts
+
+MIN_PARSE = 0.50
+
+
+def disposition(case, held, act):
+    if act == 0:   return "no-call"
+    if held:       return "held"
+    if case.get("flags"):   return "page"
+    if case.get("plan"):    return "runbook"
+    if case.get("ticket"):  return "ticket"
+    if case.get("archive"): return "suppress"
+    return "UNDISPOSED"        # tests prove unreachable; if it prints, tell me
+
+
+def events(path, adapter):
+    if path == "-":
+        ad = adapter or ADAPTERS[0]
+        prev = None
+        for line in sys.stdin:
+            e = ad.parse(line.rstrip("\n"))
+            if e is None:
+                if prev is not None: prev.message += " " + line.strip()
+                continue
+            if prev is not None: yield prev
+            prev = e
+        if prev is not None: yield prev
+    else:
+        yield from read(path, adapter)
+
+
+def verdicts(path, adapter, hands, budget, dedup_cap, stats=None,
+             window=300.0, every=20):
+    """One pass. Yields a verdict dict per DISTINCT event, and the dedup so
+    the caller can report repeats. Shared by triage and label: if they used
+    separate loops the labelled sample would not describe the actual run."""
+    # stats is MUTABLE ON PURPOSE. Reading the total off the last yielded
+    # value undercounts by however many duplicates trail the final distinct
+    # event -- 914 of 215,089 on one real file, silently.
+    stats = {} if stats is None else stats
+    stats.setdefault("events", 0)
+    dd, spent, n = Dedup(cap=dedup_cap, window=window, every=every), 0.0, 0
+    stats["dedup"] = dd
+    for ev in events(path, adapter):
+        n += 1
+        stats["events"] = n
+        # RULE FIRST, DEDUP SECOND. The laws cost zero tokens, so there was
+        # never a reason to put a hash set in front of them -- and doing so
+        # gave 0% incident recall against independent ground truth, because
+        # a recurring failure was ruled once in 2024 and never again.
+        # Dedup belongs in front of the EXPENSIVE step (decode), which is
+        # what it still gates, not in front of the free one.
+        pkt = encode(ev)
+        act, dem, held, obs, doubt, case, acts = rule(
+            pkt, hands=hands, budget_used=spent, budget_cap=budget)
+        spent += len(acts)
+        if dd.seen(signature(ev), ev.epoch):
+            stats["ruled_then_deduped"] = stats.get("ruled_then_deduped", 0) + 1
+            continue
+        yield n, dd, {
+            "disposition": disposition(case, held, act),
+            "act": ACT[act], "demand": DEM[dem], "ident": ev.ident,
+            "ts": ev.ts, "level": ev.level, "message": ev.message[:400],
+            "hazards": [HAZARD_NAMES[i] for i in range(8) if obs >> i & 1],
+            "doubts": [DOUBT_NAMES[i] for i in range(8) if doubt >> i & 1],
+            "labels": case.get("labels", []), "confidence": pkt.confidence,
+        }
+
+
+def resolve(path, fmt):
+    """Adapter or a refusal. Below MIN_PARSE this returns None rather than
+    handing back a confident-looking result over 3% of a stream."""
+    if fmt:
+        return next(x for x in ADAPTERS if x.name == fmt), 1.0
+    if path == "-":
+        return ADAPTERS[0], 1.0
+    if not os.path.exists(path):
+        print(f"neos: no such file: {path}", file=sys.stderr)
+        return None, 0.0
+    ad, rate = detect(path)
+    if ad is None or rate < MIN_PARSE:
+        print(f"neos: cannot read this stream -- best adapter "
+              f"{ad.name if ad else 'none'} matched {100*rate:.1f}% of sampled "
+              f"lines (need {100*MIN_PARSE:.0f}%).\n      Pass --format "
+              f"explicitly, or add an adapter to neos/stream.py.", file=sys.stderr)
+        return None, rate
+    return ad, rate
+
+
+def cmd_label(a):
+    """Draw a stratified sample for a human to label."""
+    from .label import draw
+    ad, rate = resolve(a.path, a.format)
+    if ad is None:
+        return 3
+    rows = [v for _, _, v in verdicts(a.path, ad, default_hands(),
+                                      a.budget, a.dedup_cap)]
+    sample, strata = draw(rows, per_stratum=a.per_stratum, seed=a.seed)
+    with open(a.out, "w") as f:
+        f.write(json.dumps({"_strata": strata, "source": a.path,
+                            "seed": a.seed}) + "\n")
+        for r in sample:
+            f.write(json.dumps(r, ensure_ascii=False) + "\n")
+    print(f"\n  wrote {a.out}  --  {len(sample):,} events sampled from "
+          f"{len(rows):,} distinct")
+    print(f"  stratified, so the rare classes are represented:")
+    for d, n in sorted(strata.items()):
+        got = sum(1 for r in sample if r["disposition"] == d)
+        print(f"    {d:12s} {got:>4,} sampled of {n:>8,} in the stream")
+    print(f"\n  Now fill in the \"human\" field on each line with one of:")
+    print(f"    ok        the tool was right")
+    print(f"    page / runbook / ticket / suppress   what it SHOULD have been")
+    print(f"\n  Then:  neos score {a.out}\n")
+    return 0
+
+
+def cmd_score(a):
+    from .label import score
+    return score(a.path)
+
+
+def main(argv=None):
+    argv = list(sys.argv[1:] if argv is None else argv)
+    SUB = {"triage", "label", "score"}
+    if not argv or (argv[0] not in SUB and not argv[0].startswith("-")):
+        argv = ["triage"] + argv           # `neos foo.log` still means triage
+    elif argv and argv[0].startswith("-") and argv[0] not in ("-h", "--help"):
+        argv = ["triage"] + argv
+
+    top = argparse.ArgumentParser(prog="neos", description=__doc__,
+                                  formatter_class=argparse.RawDescriptionHelpFormatter)
+    sub = top.add_subparsers(dest="cmd", required=True)
+
+    sc = sub.add_parser("score", help="score a labelled review file")
+    sc.add_argument("path", help="review file written by `neos label`")
+
+    lb = sub.add_parser("label", help="draw a stratified sample for a human")
+    lb.add_argument("path", help="log file, or - for stdin")
+    lb.add_argument("-o", "--out", default="review.jsonl")
+    lb.add_argument("--per-stratum", type=int, default=40,
+                    help="events sampled per disposition (default 40)")
+    lb.add_argument("--seed", type=int, default=0)
+    lb.add_argument("--format", choices=[x.name for x in ADAPTERS])
+    lb.add_argument("--dedup-cap", type=int, default=200_000)
+    lb.add_argument("--budget", type=float, default=1e9)
+
+    ap = sub.add_parser("triage", help="rule on a stream (default)")
+    ap.add_argument("path", help="log file, or - for stdin")
+    ap.add_argument("--format", choices=[a.name for a in ADAPTERS],
+                    help="force an adapter instead of detecting one")
+    ap.add_argument("--json", action="store_true", help="one JSON verdict per line")
+    ap.add_argument("--only", choices=["page", "runbook", "ticket", "suppress", "held"],
+                    help="print only this disposition (with --json)")
+    ap.add_argument("--dedup-cap", type=int, default=200_000)
+    ap.add_argument("--window", type=float, default=300.0,
+                    help="seconds; a signature surfaces once per window "
+                         "(0 disables windowing). THE SAFETY DIAL: too long "
+                         "and independent incidents look like one repeat -- "
+                         "at infinity this tool scored 0%% incident recall. "
+                         "Too short and nothing dedupes. Default 300.")
+    ap.add_argument("--realert-every", type=int, default=20,
+                    help="when a stream carries no usable timestamp, surface "
+                         "every Nth repeat. Bounds how many hide in a row.")
+    ap.add_argument("--budget", type=float, default=1e9,
+                    help="hands per run before SPENT narrows routing")
+    ap.add_argument("--why", action="store_true", help="explain each verdict")
+    a = top.parse_args(argv)
+    if a.cmd == "score":
+        return cmd_score(a)
+    if a.cmd == "label":
+        return cmd_label(a)
+
+    adapter, rate = resolve(a.path, a.format)
+    if adapter is None:
+        return 3 if os.path.exists(a.path) or a.path == "-" else 2
+
+    hands = default_hands()
+    out, stats = collections.Counter(), {}
+    for _n, dd, v in verdicts(a.path, adapter, hands, a.budget, a.dedup_cap,
+                              stats, a.window, a.realert_every):
+        d = v["disposition"]
+        out[d] += 1
+        if a.json:
+            if a.only and d != a.only:
+                continue
+            print(json.dumps(v, ensure_ascii=False))
+        elif a.why and d in ("page", "runbook", "held"):
+            obs = doubt = 0
+            ev = type("E", (), {"ident": v["ident"], "message": v["message"]})
+            act = ACT.index(v["act"]); dem = DEM.index(v["demand"])
+            hz = [(h, HAZARD_WHY[HAZARD_NAMES.index(h)]) for h in v["hazards"]]
+            db = [(x, DOUBT_WHY[DOUBT_NAMES.index(x)]) for x in v["doubts"]]
+            print(f"  [{d}] {v['ident']}: {v['message'][:90]}")
+            print(f"        opened {ACT[act]}"
+                  + (f" because {hz[0][1]}" if hz else "")
+                  + f"; demands {DEM[dem]}"
+                  + (f" because {db[0][1]}" if db else "") + ".")
+
+    n, dd = stats.get("events", 0), stats.get("dedup")
+    if a.json:
+        return 0
+    if not n:
+        print("neos: no events read", file=sys.stderr); return 1
+    uniq = sum(out.values())
+    out["deduped"] = n - uniq
+    P = lambda c, t: f"{c:>9,}  {100*c/t:6.2f}%" if t else f"{c:>9,}       -"
+    print(f"\n  {a.path}   adapter={adapter.name if adapter else 'stdin'}"
+          + (f"  ({100*rate:.1f}% parsed)" if a.path != "-" else ""))
+    print(f"  {n:,} events -> {uniq:,} distinct\n")
+    print(f"    {'deduped (hash set, not a law)':32s} {P(out['deduped'], n)}")
+    for d in ("suppress", "ticket", "page", "runbook", "held", "no-call",
+              "UNDISPOSED"):
+        if out[d]:
+            print(f"    {d:32s} {P(out[d], uniq)}"
+                  + ("   <-- BUG: report this" if d == "UNDISPOSED" else ""))
+    words = out["runbook"]
+    print(f"\n    events that ever become words     {words:>9,}  "
+          f"{100*words/n:6.4f}% of the stream")
+    if out["held"] == 0:
+        print(f"\n    DECLINE did not fire on this stream. With {len(hands)} "
+              f"hands available the refusal")
+        print(f"    path engages only when a round is short of voices -- it "
+              f"does fire on other")
+        print(f"    streams (durable state changes demanding FULL). Not a pass; "
+              f"just untriggered.")
+    print(f"    dedup window {a.window:.0f}s"
+          + (f", re-alert every {a.realert_every} when a stream has no time"
+             if a.window else " (windowing OFF)"))
+    if dd.loudest(1):
+        sig, c = dd.loudest(1)[0]
+        print(f"\n    loudest signature repeated {c:,} times")
+    print()
+    return 0
+
+
+if __name__ == "__main__":
+    sys.exit(main())