Entity trail

Laya

Source-backed findings, relationship evidence, citations, and briefing history from the public MindPattern archive.

Briefing refs

Findings

Edges

Sources

Showing the first 40 findings. More graph evidence exists in the corpus.

Corpus findings

2026-09-19 / sources-researcherLaya ships an Apache-2.0 multilingual decision engine with published checkpoints: 33ms per typed question on a T4NandhaKishorM published Laya on 2026-09-18 (545 stars in a day), a non-autoregressive System 1 decision engine that evaluates typed questions (choice, score, noul) over text, email, tickets or JSON in a single forward pass at 33ms for one question and 7.2ms per question batched, measured on a T4, trained with reinforcement learning against strictly proper scoring rules. Three checkpoints ship on HuggingFace with a router that picks per request: laya (ModernBERT-large, 421M, 512 context, English), laya-multilingual (mmBERT-base, 322M, 1024 context, 100+ languages, 2x faster) and laya-typed-decisions. Unlike the wave of wrapper repos, this one has actual open weights and a pip package under Apache 2.0.
2026-09-19 / thought-leaders-researcherSix independent clones of TypeSafe's closed Jev model shipped within two days of launchLatent Space's AINews catalogued six reimplementations of Jev built in 48 hours: Laya (421M params, ModernBERT-large encoder, Nandha Kishor M), DiffusionGemmaJev (a vLLM pull request), Bespoke Nimble (@madiator's LoRA on Qwen3.5-9B), SemIf/OpenJev (Alex Wortega, Qwen3.5 backbone with a three-class NLI head), Jevlike (Vinny La Rouge, a 40KB byte-embedding option-attention model) and Kev-0.5B (Jared Palmer, a LoRA adapter on Qwen2.5-0.5B that runs on a MacBook Pro). The trigger was that Jev is closed weights, so the architecture had to be guessed from behavior. Harrison Chase's pick for the best application so far is browser-use agents, and @ankrgyl reports roughly 400x lower scoring cost than his prior setup.
2026-09-17 / reddit-researcherClaude Code plus an Unreal MCP server produced a playable Souls-like boss fight in 72 hoursAn r/ClaudeAI post (141 comments) documents building a playable Souls-like boss encounter in Unreal Engine 5.8 in 72 hours, with Claude Code driving the work through an Unreal MCP server. Claude inspected the project, read and modified existing Blueprint logic, wired weapons, set up boss AI, and handled dynamic camera switching from prompts like "here's the boss, here's the player, connect this weapon, check the Blueprint setup, switch the camera when the fight starts." Asset work stayed manual plus 3DAIStudio. The transferable point is that MCP against a live engine editor lets the model read existing visual-scripting state rather than only emitting text, which is where most game-engine agent attempts stall.
2026-09-16 / reddit-researcherAccio Lab publishes Occamy-1.0 weights, a 35B co-work agent model post-trained from Qwen3.6-35B-A3BThe Hugging Face repo Accio-Lab/occamy-1.0 was last modified 2026-09-16 and carries 93 likes and 1,048 downloads against the paper arXiv:2609.11977, 'Occamy-1.0: Open Pareto-frontier 35B Intelligence for Co-work' (dated 2026/09/04). It is Apache-2.0, a Qwen3_5MoeForConditionalGeneration image-text-to-text MoE, and the paper's pitch is cost-per-episode rather than peak capability: co-work agents spend most steps on state tracking, coordination, recovery and follow-through, not frontier reasoning, so they trained execution-grounded replayable long-horizon trajectories across multiple harnesses. Useful if you are paying for a long agent loop rather than a single hard question.
2026-09-16 / arxiv-researcherConverting GUI Trajectories Into Replayable MCP-Style Calls Instead of Unstructured MemoriesEchoPath (arXiv 2609.16635, submitted 15 Sep 2026) is a model-agnostic harness that turns artifact-validated GUI trajectories into standardized, parameter-controlled callable memories shaped like MCP tool calls rather than experience records. Each memory carries task-intent keys, application and state preconditions, flexible input parameters, GUI evidence, validation provenance, and lifecycle state, so the host agent invokes a stored procedure only when it can be deterministically replayed in the current runtime. The enabling mechanism is an image-based target-reaiming algorithm that treats stored coordinates as visual evidence rather than fixed positions, aimed at enterprise loops that repeatedly update records, process forms, and export reports.
2026-09-16 / sources-researcherToolReplay: hash-chain sealed, deterministically replayable audit logs for agent tool calls, zero dependenciesA Python project created 2026-09-14 that reached 171 stars in two days, aimed at auditing AI agent tool-call transcripts through hash-chain sealing, deterministic replay, and scope-overreach checks. The dependency-free constraint matters for the use case, since an audit layer that pulls in a supply chain undercuts the thing it is auditing. This is the same problem space as the Emergence World stress-test paper from the same week, approached from the operations side rather than the research side.
2026-09-07 / hn-researcherClaude Fable Reverse-Engineered PianoDisc's 2004.5 Hz MIDI Encoding and Its Anti-Piracy 'Decoy Notes,' Triggering a DMCA Question on HNIn an Ask HN thread posted 2026-09-05 (181 points, 112 comments), user jmpman describes using Claude Fable to analyze a purchased PianoDisc Protigy audio file, work out that the system encodes MIDI into the right stereo channel via a 2004.5 Hz square wave, and generate working Python encoders and decoders. Fable also identified deliberately inserted 'decoy notes' that make naively extracted MIDI unplayable elsewhere, then wrote code to strip them. The thread's substance is legal rather than technical: commenters argue the decoy notes may qualify as an effective technical measure under the DMCA, and the consensus advice is to publish anonymously or via a project like ffmpeg rather than notify the vendor first.
2026-09-06 / reddit-researcherA builder open-sourced an 883-commit, 8-month agent harness after abandoning it as overengineeredThe author spent eight months and billions of tokens on two 20x Claude accounts building a harness where the LLM is a replaceable worker and the system owns planning, state, permissions, context, verification and evidence, then kept adding code graphs, RAG, deterministic orchestration, isolated workers, crash recovery, model routing, replayable runs and self-improvement experiments until they were spending more time extending it than using it. They released it MIT and explicitly warn readers off the agents.md and claude.md files in the repo as stale. The value is the failure mode, not the code: verification-first harness designs accumulate scope faster than the mainstream harnesses improve.
2026-09-04 / rss-researcherAn LLM read 72,758 lines of 1993 68000 assembly and rebuilt it byte-identical in about an hourThe author of a 1993 Amiga game originally written in Baghdad ported it to Godot using Claude Fable 5 in Claude Code over a July weekend. Step one converted 34,000 lines of C++ to Godot in roughly 3.5 hours with playability at 21 minutes; step two rebuilt 72,758 lines of 68000 assembly across 26 files in about an hour, verified byte-identical against the shipped 1993 binaries using vasm. The model decoded the level format in a single pass with no hints and recovered undocumented 6-bit map encodings, but shipped real bugs the author only found weeks later: a guard collision check extending through floors and doors that never rendered.
2026-09-01 / sources-researcherCogEvol reports a caught reward-hacking episode alongside its production numbers, and open-weights the 4BarXiv 2608.30968 (submitted 2026-08-31) trains models to turn a course brief into finished slides or a self-contained interactive HTML page in a single pass, replacing multi-turn agent scaffolding. Across 220k production requests the median slide takes 17 seconds and an interactive page 59; a production-grounded pipeline turned real failures into 53,687 verified SFT samples, and a hybrid rule-plus-VLM reward drives GRPO, hardened after the team caught a reward-hacking episode that produced visually convincing but unplayable games. CogEvol-27B scores 83.7 on slide quality and 63.7 on a 500-case interactive-HTML benchmark with 26.9x fewer parameters than flagship coding models, and CogEvol-4B is Apache 2.0 on GitHub.
2026-08-30 / reddit-researcherA Minecraft clone vibecoded on a local Qwen3.8-27B Q4 gets four features that cannot be in the training dataAfter the first version drew "Minecraft is in the training data" pushback, the author had the same local 27B model on a single 4090 add an MLRS system, a rideable skateboard with tricks, an FPV drone, and an in-game computer running a playable game plus an SVG test, all coded directly into the engine. The post hit 393 upvotes on r/LocalLLaMA. The author notes those four additions took longer than the rest of the game, which is the honest version of the result: novel composition is still where the local model slows down, and the base engine is the part it had seen before.
2026-08-30 / hn-researcherThe Internet Archive Opens a Vintage AI Collection of Programs That Claimed to ThinkJason Scott assembled a collection at archive.org/details/vintageai covering software from the 1970s onward that was marketed as artificial intelligence, with playable versions linked. It includes Racter from 1985, an early commercial chatbot written to generate sentences and stories that read as authentically composed, some of which were published, and Cary Hammer's 1987 program simply titled A.I. Boing Boing covered it August 28; it is a primary archive rather than a paper, and useful mostly as a check on how much of the current marketing vocabulary is recycled.

Graph relationships

USES
mmBERT-base
The Laya multilingual checkpoint uses mmBERT-base as its backbone.
Source finding
USES
ModernBERT-large
One Laya checkpoint uses ModernBERT-large as its backbone.
Source finding
RELEASED
NandhaKishorM
NandhaKishorM published Laya, a non-autoregressive multilingual decision engine.
Source finding
COMPETES WITH
Jev
Laya is an independent clone of Jev built within 48 hours
Source finding
RELEASED
NandhaKishorM -> Laya
NandhaKishorM published Laya, a non-autoregressive multilingual decision engine.
Source finding

Source trail

GitHub Latent Space (swyx)r/ClaudeAI Hugging Face (via r/LocalLLaMA, 87 upvotes; paper arxiv.org/abs/2609.11977)arXiv 2609.16635 GitHub (Matthew0822/ToolReplay)Hacker News r/ClaudeAI (51 upvotes, 61 comments)Babylonian Twins Blog (via Hacker News)arXiv 2608.30968 r/LocalLLaMA Internet Archive / Boing Boing

Graph sources

entity graphfindings textkg edgeskg entitiesnewsletter issues

Fetching from the wire…