@litfamily/litgrok 1.0.0

package/.grok/skills/autoconference/scripts/verify-canonical-corpus.mjs

@@ -0,0 +1,177 @@
+#!/usr/bin/env node
+
+import { createHash } from 'node:crypto';
+import { existsSync, lstatSync, readdirSync, readFileSync } from 'node:fs';
+import { dirname, join, resolve } from 'node:path';
+import { fileURLToPath } from 'node:url';
+
+const SKILL_ROOT = resolve(dirname(fileURLToPath(import.meta.url)), '..');
+const MANIFEST_RELATIVE = 'references/_canonical-corpus/manifest.json';
+const VERIFIER_RELATIVE = 'scripts/verify-canonical-corpus.mjs';
+const EXPECTED = Object.freeze({
+  "schemaVersion": "litgrok.autoconference-corpus/v1",
+  "fileCount": 25,
+  "byteCount": 55711,
+  "aggregateSha256": "406a7ca96354e3b863577cdbcb783122031fd451f967d0a2bfadfcdd1949fd34",
+  "files": {
+    "assets/conference_template.md": "c1b0a1bbfb52080384e9bf6d725a91d2165a2105a4f055820660a607c913c7e7",
+    "assets/report_template.md": "73a00032dc143f34f67a97a257f76e7a5acd9365d367e0b27d0c72e439a336ab",
+    "assets/synthesis_template.md": "16ffba65a6f612b0552a2ec9698951832a7cb3b141214cbbb23501c0b81d0a7c",
+    "references/agent-prompts.md": "dcbff9d0f7418203cc1fd74d55088dd3447dfe7d2ca9497089920c7358ef894f",
+    "references/conference-protocol.md": "52a85c9a1a713013acd05036553eabe8bb9e9837d91f117be455d7fcfc08a788",
+    "references/core-principles.md": "0c862b86077f754236c9ada474704d7a4fa647ff967ad977de25a092e0836991",
+    "references/family-contract.md": "cc9c1296228cb7dc49266778fe35268a5bb1f61ac68f91e22e8b2d2ffcb848d7",
+    "references/modes/analyze.md": "d7c15cd2f3f4ff42fc6f4ca68cb52ce3789d00182fcfe9078cd12974013b010e",
+    "references/modes/core.md": "acf7e765931e5d9972d487e979c7dcaae08e60e39c5a12353c2d5fe0fcd9e259",
+    "references/modes/core/convergence-guide.md": "515c36d78029d545e3c3f427335f2a7a6615102a76198bb13ee7c098fca3c312",
+    "references/modes/core/crash-recovery.md": "f067327ed13e6d2783c3b07e22b2adf9233cf00b4dfeb5995571921f854af08a",
+    "references/modes/debate.md": "6a4b0e713df22db0707aa8c62dfdc75b7a78b9755926c757ee5ca656475a088c",
+    "references/modes/plan.md": "772a17995add897af92803de2a10fcfa353c9d578c17b73b04fe189494a782e4",
+    "references/modes/resume.md": "971fdcd30990b083b472e88deb241ca8ebf653906119271e7e4290d24a09ce24",
+    "references/modes/ship.md": "74e4061f1a960c7dd7b6092acfb55178cfbaa2c429168f60dc22ef19fa38de27",
+    "references/modes/survey.md": "93866084c2abe5d7a1c6ef7251e5594e03044545ddda5e80c1ca42ef450769d0",
+    "references/results-logging.md": "829714f30af623aa78a4ebc9e13a0ba7135b2c876af3443e1c1274af8857fe96",
+    "references/visualization-guide.md": "4f7e705735b948038193c5a9c111e2db85672f5d97bb1c570aad217843868331",
+    "scripts/init_conference.py": "58aaaa91d3f31bdacfccac4c3a736efb62cb89563f7d37281be0e49f84651187",
+    "templates/code-performance.md": "a90d1425477d9aec002778ba695299cfabb593ccd3dbab82ed0d76038e17a4d5",
+    "templates/debate-mode.md": "9c74435dc7eb2e2d24d32b0a80381aadc62890f4674d916022ce6ef220aab966",
+    "templates/prompt-optimization.md": "8d78c233529533bb742986769941347eebc460fdb2a2dac63952e65883398e10",
+    "templates/quick-conference.md": "35e92ccc202ed659ce30f1820fb53e7b6081f4bb01e7f3b3a301c014b9956d03",
+    "templates/research-synthesis.md": "7dd182898b572826a614a1cd0239cd1a07d95b0c6cf022c79a5e842a4246ce81",
+    "templates/survey-mode.md": "5862cebaf4458b0c411df900f739b0493f2c9583217caf4eff051206e87a10e5"
+  }
+});
+
+function sha256(value) {
+  return createHash('sha256').update(value).digest('hex');
+}
+function safeRelativePath(value) {
+  return typeof value === 'string'
+    && value.length > 0
+    && !value.startsWith('/')
+    && !value.includes('\\')
+    && value.split('/').every((part) => part !== '' && part !== '.' && part !== '..');
+}
+
+function listFiles(directory, prefix = '') {
+  const files = [];
+  for (const entry of readdirSync(directory, { withFileTypes: true })) {
+    const child = prefix ? `${prefix}/${entry.name}` : entry.name;
+    const childPath = join(directory, entry.name);
+    if (entry.isDirectory()) files.push(...listFiles(childPath, child));
+    else if (entry.isFile()) files.push(child);
+    else throw new Error(`non-regular entry: ${child}`);
+  }
+  return files;
+}
+
+function parseRoot(argv) {
+  if (argv.length === 0) return SKILL_ROOT;
+  if (argv.length === 2 && argv[0] === '--root' && argv[1] && !argv[1].startsWith('-')) return resolve(argv[1]);
+  throw new Error('usage: verify-canonical-corpus.mjs [--root <skill-directory>]');
+}
+
+function referencedResources(skillRoot) {
+  const entry = readFileSync(join(skillRoot, 'SKILL.md'), 'utf8');
+  const paths = new Set();
+  for (const match of entry.matchAll(/`((?:assets|references|scripts|templates)\/[^\`]+)`/g)) {
+    const token = match[1].trim().split(/\s+/u)[0];
+    if (safeRelativePath(token)) paths.add(token);
+  }
+  return paths;
+}
+
+function verify(skillRoot) {
+  const failures = [];
+  const manifestPath = join(skillRoot, ...MANIFEST_RELATIVE.split('/'));
+  if (!existsSync(manifestPath)) return [`missing ${MANIFEST_RELATIVE}`];
+
+  let manifest;
+  try {
+    manifest = JSON.parse(readFileSync(manifestPath, 'utf8'));
+  } catch (error) {
+    return [`manifest unreadable: ${error instanceof Error ? error.message : String(error)}`];
+  }
+
+  const expectedKeys = ['aggregate_sha256', 'byte_count', 'file_count', 'files', 'schema_version', 'source'];
+  if (JSON.stringify(Object.keys(manifest).sort()) !== JSON.stringify(expectedKeys.sort())) failures.push('manifest keys mismatch');
+  if (manifest.schema_version !== EXPECTED.schemaVersion) failures.push('schema_version mismatch');
+  if (manifest.file_count !== EXPECTED.fileCount) failures.push(`file_count expected ${EXPECTED.fileCount}, got ${manifest.file_count}`);
+  if (manifest.byte_count !== EXPECTED.byteCount) failures.push(`byte_count expected ${EXPECTED.byteCount}, got ${manifest.byte_count}`);
+  if (manifest.aggregate_sha256 !== EXPECTED.aggregateSha256) failures.push('aggregate_sha256 mismatch');
+  if (!Array.isArray(manifest.files) || manifest.files.length !== EXPECTED.fileCount) failures.push(`manifest.files expected ${EXPECTED.fileCount} entries`);
+
+  const expectedPaths = Object.keys(EXPECTED.files).sort();
+  const manifestPaths = Array.isArray(manifest.files) ? manifest.files.map((entry) => entry?.path).sort() : [];
+  if (JSON.stringify(manifestPaths) !== JSON.stringify(expectedPaths)) failures.push('manifest file set mismatch');
+
+  for (const required of ['SKILL.md', 'LICENSE', 'PROVENANCE.md']) {
+    const requiredPath = join(skillRoot, required);
+    if (!existsSync(requiredPath) || !lstatSync(requiredPath).isFile()) failures.push(`missing regular file: ${required}`);
+  }
+
+  const referenced = referencedResources(skillRoot);
+  for (const file of expectedPaths) {
+    if (!referenced.has(file)) failures.push(`SKILL_RESOURCE_UNDECLARED: ${file}`);
+  }
+  for (const file of referenced) {
+    if (file === VERIFIER_RELATIVE) continue;
+    if (!expectedPaths.includes(file)) failures.push(`SKILL_RESOURCE_UNMANIFESTED: ${file}`);
+  }
+
+  const actualPaths = [];
+  for (const root of ['assets', 'references', 'scripts', 'templates']) {
+    const rootPath = join(skillRoot, root);
+    if (!existsSync(rootPath)) continue;
+    actualPaths.push(...listFiles(rootPath).map((file) => `${root}/${file}`));
+  }
+  const filteredActualPaths = actualPaths
+    .filter((file) => file !== MANIFEST_RELATIVE && file !== VERIFIER_RELATIVE)
+    .sort();
+  if (JSON.stringify(filteredActualPaths) !== JSON.stringify(expectedPaths)) failures.push('actual corpus file set mismatch');
+
+  const manifestByPath = new Map((Array.isArray(manifest.files) ? manifest.files : []).map((entry) => [entry.path, entry]));
+  let byteCount = 0;
+  const rows = [];
+  for (const file of expectedPaths) {
+    if (!safeRelativePath(file)) {
+      failures.push(`unsafe path: ${file}`);
+      continue;
+    }
+    const filePath = join(skillRoot, ...file.split('/'));
+    const entry = manifestByPath.get(file);
+    if (!entry || entry.path !== file || typeof entry.size !== 'number' || typeof entry.sha256 !== 'string') {
+      failures.push(`manifest entry missing or malformed: ${file}`);
+      continue;
+    }
+    try {
+      const bytes = readFileSync(filePath);
+      const digest = sha256(bytes);
+      byteCount += bytes.byteLength;
+      if (bytes.byteLength !== entry.size) failures.push(`size mismatch: ${file}`);
+      if (digest !== entry.sha256) failures.push(`manifest hash mismatch: ${file}`);
+      if (digest !== EXPECTED.files[file]) failures.push(`expected hash mismatch: ${file}`);
+      rows.push(`${digest}  ${file}\n`);
+    } catch (error) {
+      failures.push(`missing ${file}: ${error instanceof Error ? error.message : String(error)}`);
+    }
+  }
+  if (byteCount !== EXPECTED.byteCount) failures.push(`byte count expected ${EXPECTED.byteCount}, got ${byteCount}`);
+  if (sha256(rows.join('')) !== EXPECTED.aggregateSha256) failures.push('aggregate digest mismatch');
+  return failures;
+}
+
+try {
+  const skillRoot = parseRoot(process.argv.slice(2));
+  if (!existsSync(skillRoot) || !lstatSync(skillRoot).isDirectory()) throw new Error(`skill root is not a directory: ${skillRoot}`);
+  const failures = verify(skillRoot);
+  if (failures.length > 0) {
+    console.error(`FAIL ${failures.join('; ')}`);
+    process.exitCode = 1;
+  } else {
+    console.log(`PASS canonical-autoconference-corpus files=${EXPECTED.fileCount} bytes=${EXPECTED.byteCount} sha256=${EXPECTED.aggregateSha256}`);
+  }
+} catch (error) {
+  console.error(`FAIL ${error instanceof Error ? error.message : String(error)}`);
+  process.exitCode = 1;
+}

package/.grok/skills/autoconference/templates/code-performance.md

@@ -0,0 +1,59 @@
+# Conference: Code Performance Optimization
+
+> **Template: Code Performance** — Optimize code execution speed using parallel researchers with assigned optimization strategies.
+
+## Goal
+Minimize execution time of the target code. Each researcher explores a different optimization layer — algorithmic, data structures, and low-level — to find complementary speedups.
+
+## Mode
+metric
+
+## Success Metric
+- **Metric:** execution_time_seconds
+- **Target:** {e.g., "< 0.5", "< 50"}
+- **Direction:** minimize
+
+## Researchers
+- **Count:** 3
+- **Iterations per round:** 5
+- **Max rounds:** 4
+
+## Search Space
+- **Allowed changes:** implementation code, algorithm choice, data structures, caching strategies, memory layout, vectorization
+- **Forbidden changes:** test harness, input data, public API contracts, correctness constraints (all tests must still pass)
+
+## Search Space Partitioning
+- **Strategy:** assigned
+
+### Researcher A Focus
+Algorithmic changes: complexity reduction (O(n²) → O(n log n)), better algorithms for the problem class, avoiding redundant computation, memoization of expensive calls.
+
+### Researcher B Focus
+Data structure optimization: choosing the right container types (list vs. dict vs. set), index structures, object layout, avoiding repeated lookups, batching operations.
+
+### Researcher C Focus
+Low-level optimization: caching hot paths, memory layout for cache locality, vectorization opportunities, reducing Python overhead (list comprehensions over loops, numpy where applicable), profiling-guided micro-optimizations.
+
+## Constraints
+- **Max total iterations:** 45
+- **Time budget:** 2h
+- **Researcher timeout:** 40m
+
+## Current Approach
+{Describe the current implementation. What does it do? What is the baseline execution time? Reference the code file(s) here.}
+
+## Shared Knowledge
+<!-- Auto-populated after each round with validated findings -->
+
+## Context & References
+- Target code: {path to file(s)}
+- Benchmark script: {path to benchmark}
+- Baseline execution time: {value} seconds
+- Hardware: {CPU, RAM — for reproducibility}
+
+---
+
+## Conference Log
+<!-- Auto-maintained by Conference Chair. Do not edit manually. -->
+| Round | Researcher | Best Metric | Key Finding | Status |
+|-------|-----------|-------------|-------------|--------|

package/.grok/skills/autoconference/templates/debate-mode.md

@@ -0,0 +1,50 @@
+# Conference: {Debate Topic}
+
+> **Template: Debate Mode** — Two researchers argue opposing positions on a debatable proposition. A Reviewer judges the exchange and produces a verdict.
+
+## Goal
+{The question to debate — frame as a debatable proposition, e.g., "LLMs will replace traditional search engines within 5 years"}
+
+## Mode
+qualitative
+
+## Success Criteria
+Both positions are thoroughly argued with evidence. The judge produces a clear verdict with justification. Key disagreements and unresolved questions are documented.
+
+## Researchers
+- **Count:** 2
+- **Iterations per round:** 3
+- **Max rounds:** 3
+
+## Search Space
+- **Allowed changes:** Arguments, evidence, rebuttals, citations
+- **Forbidden changes:** Moving the goalposts, ad hominem attacks, fabricating sources
+
+## Search Space Partitioning
+- **Strategy:** assigned
+
+### Researcher A Focus
+**Position: Pro/Affirmative** — Argue in favor of the proposition. Build the strongest possible case with evidence and reasoning. Anticipate counter-arguments and pre-empt them.
+
+### Researcher B Focus
+**Position: Con/Negative** — Argue against the proposition. Identify weaknesses, counter-evidence, and alternative explanations. Challenge Researcher A's assumptions and sources.
+
+## Constraints
+- **Max total iterations:** 18
+- **Time budget:** 1h
+- **Researcher timeout:** 20m
+
+## Current Approach
+_Describe the current consensus or default position on this topic. What does the mainstream view hold? What is the null hypothesis?_
+
+## Shared Knowledge
+<!-- Arguments and counter-arguments accumulate here after each round -->
+
+## Context & References
+_Add relevant papers, data sources, or prior debates that should inform the exchange._
+
+---
+
+## Conference Log
+| Round | Researcher | Best Metric | Key Finding | Status |
+|-------|-----------|-------------|-------------|--------|

package/.grok/skills/autoconference/templates/prompt-optimization.md

@@ -0,0 +1,58 @@
+# Conference: Prompt Optimization
+
+> **Template: Prompt Optimization** — Optimize LLM prompts for accuracy and quality using parallel researchers with assigned search space partitions.
+
+## Goal
+Maximize accuracy of the target LLM prompt on a defined test set. Each researcher explores different aspects of the prompt to discover what drives performance.
+
+## Mode
+metric
+
+## Success Metric
+- **Metric:** accuracy_on_test_cases
+- **Target:** > 0.90
+- **Direction:** maximize
+
+## Researchers
+- **Count:** 3
+- **Iterations per round:** 5
+- **Max rounds:** 4
+
+## Search Space
+- **Allowed changes:** system prompt text, few-shot examples, output format instructions, persona, reasoning instructions
+- **Forbidden changes:** test cases, model choice, temperature (unless you are Researcher C), evaluation script
+
+## Search Space Partitioning
+- **Strategy:** assigned
+
+### Researcher A Focus
+Structural changes: few-shot example selection and ordering, chain-of-thought formatting, output format specification, instruction sequencing.
+
+### Researcher B Focus
+Content changes: phrasing and wording of instructions, persona definition, example quality and diversity, clarity of task description.
+
+### Researcher C Focus
+Meta-optimization: temperature and sampling parameters, prompt length trade-offs, system vs. user message split, prompt compression without accuracy loss.
+
+## Constraints
+- **Max total iterations:** 45
+- **Time budget:** 1h
+- **Researcher timeout:** 20m
+
+## Current Approach
+{Describe the current prompt. What does it do? What accuracy does it achieve? Paste the baseline prompt here or reference the file path.}
+
+## Shared Knowledge
+<!-- Auto-populated after each round with validated findings -->
+
+## Context & References
+- Test set location: {path to test cases}
+- Evaluation script: {path to eval script}
+- Current baseline accuracy: {value}
+
+---
+
+## Conference Log
+<!-- Auto-maintained by Conference Chair. Do not edit manually. -->
+| Round | Researcher | Best Metric | Key Finding | Status |
+|-------|-----------|-------------|-------------|--------|

package/.grok/skills/autoconference/templates/quick-conference.md

@@ -0,0 +1,48 @@
+# Conference: {Title}
+
+> **Quick Conference Mode** — Minimal preset for testing whether your problem benefits from the conference format.
+> ~12 total iterations + review overhead. Fast enough to validate the approach before committing to a full run.
+
+## Goal
+{Describe what the conference should achieve. Be specific and measurable.}
+
+## Mode
+metric
+
+## Success Metric
+- **Metric:** {e.g., "accuracy", "execution_time_seconds", "score"}
+- **Target:** {e.g., "> 95%", "< 50ms", "> 8/10"}
+- **Direction:** {maximize | minimize}
+
+## Researchers
+- **Count:** 2
+- **Iterations per round:** 3
+- **Max rounds:** 2
+
+## Search Space
+- **Allowed changes:** {What researchers CAN modify}
+- **Forbidden changes:** {What researchers CANNOT modify — e.g., test data, eval scripts}
+
+## Search Space Partitioning
+- **Strategy:** free
+
+## Constraints
+- **Max total iterations:** 12
+- **Time budget:** 30m
+- **Researcher timeout:** 15m
+
+## Current Approach
+{Describe the baseline. What exists now?}
+
+## Shared Knowledge
+<!-- Auto-populated after each round with validated findings -->
+
+## Context & References
+{Background material — papers, docs, URLs, code files}
+
+---
+
+## Conference Log
+<!-- Auto-maintained by Conference Chair. Do not edit manually. -->
+| Round | Researcher | Best Metric | Key Finding | Status |
+|-------|-----------|-------------|-------------|--------|

package/.grok/skills/autoconference/templates/research-synthesis.md

@@ -0,0 +1,56 @@
+# Conference: Research Synthesis
+
+> **Template: Research Synthesis** — Qualitative literature exploration using parallel researchers covering different facets of a research area.
+
+## Goal
+Build a comprehensive taxonomy of {research area} covering foundational work, recent advances, and cross-domain connections. Identify research gaps and novel hypotheses.
+
+## Mode
+qualitative
+
+## Success Criteria
+Comprehensive taxonomy of the research area with >= 15 papers, clear identification of at least 3 research gaps, and at least 2 novel cross-domain connections. Each paper should include: authors, year, key contribution, and relevance to the goal.
+
+## Researchers
+- **Count:** 3
+- **Iterations per round:** 5
+- **Max rounds:** 3
+
+## Search Space
+- **Allowed changes:** search queries, paper selection, synthesis approach, taxonomy structure, hypothesis generation
+- **Forbidden changes:** fabricating citations (all papers must be real and verifiable), the research question itself
+
+## Search Space Partitioning
+- **Strategy:** assigned
+
+### Researcher A Focus
+Foundational papers and surveys: seminal works that established the field, highly-cited surveys, theoretical foundations. Prioritize papers that are widely referenced by later work.
+
+### Researcher B Focus
+Recent advances (last 2 years): state-of-the-art results, new methods, recent empirical findings, preprints and conference papers from 2024-2026.
+
+### Researcher C Focus
+Adjacent fields and cross-domain connections: related problems in other domains, techniques borrowed from other fields, analogies and transfer opportunities. Look for what other communities call the same problem.
+
+## Constraints
+- **Max total iterations:** 30
+- **Max rounds:** 3
+- **Time budget:** 2h
+
+## Current Approach
+{Describe what you already know about this area. What papers have you read? What gaps do you suspect exist?}
+
+## Shared Knowledge
+<!-- Auto-populated after each round with validated findings -->
+
+## Context & References
+- Research question: {Paste your specific research question here}
+- Seed papers: {Any papers you already know about}
+- Key terms: {Domain-specific terminology to include in searches}
+
+---
+
+## Conference Log
+<!-- Auto-maintained by Conference Chair. Do not edit manually. -->
+| Round | Researcher | Best Metric | Key Finding | Status |
+|-------|-----------|-------------|-------------|--------|

package/.grok/skills/autoconference/templates/survey-mode.md

@@ -0,0 +1,63 @@
+# Conference: Literature Survey — {Topic}
+
+> **Template: Survey Mode** — Three researchers partition a literature space by database/source, then synthesize a unified taxonomy across the full coverage.
+
+## Goal
+{Systematic survey of the literature on this topic, covering multiple databases, time periods, and methodologies. e.g., "Survey all papers on retrieval-augmented generation from 2020-2025 across biomedical, CS, and engineering literature"}
+
+## Mode
+qualitative
+
+## Success Criteria
+{e.g., "Complete taxonomy with >= 5 papers per category, covering at least 3 databases and 5 years of publications. All citations must be real and verifiable. At least 1 research gap identified per category."}
+
+## Researchers
+- **Count:** 3
+- **Iterations per round:** 5
+- **Max rounds:** 2
+
+## Search Space
+- **Allowed changes:** Search queries, paper selections, taxonomy categories, synthesis structure
+- **Forbidden changes:** Fabricating citations, misrepresenting paper findings, changing the core survey topic
+
+## Search Space Partitioning
+- **Strategy:** assigned
+
+### Researcher A Focus
+**Database partition: PubMed, bioRxiv, medRxiv** — Focus on biomedical and life sciences literature. Prioritize clinical applications, biological mechanisms, and domain-specific methodology papers.
+
+### Researcher B Focus
+**Database partition: arXiv, Semantic Scholar** — Focus on computer science, physics, and interdisciplinary literature. Prioritize methods papers, benchmarks, and theoretical contributions.
+
+### Researcher C Focus
+**Database partition: Google Scholar, ACM DL, IEEE Xplore** — Focus on engineering, applied CS, and industry publications. Prioritize systems papers, deployed applications, and practitioner-oriented work.
+
+## Constraints
+- **Max total iterations:** 30
+- **Time budget:** 2h
+- **Researcher timeout:** 40m
+
+## Current Approach
+_Describe any existing knowledge or prior surveys on this topic. What seed papers do you already have? What time range and databases have already been covered?_
+
+## Shared Knowledge
+<!-- Citation chains and cross-database findings accumulate here after each round -->
+
+## Taxonomy Categories
+<!-- Define the categories the survey should cover. Researchers will find papers for each. -->
+1. {Category 1}
+2. {Category 2}
+3. {Category 3}
+
+## Context & References
+_Add seed papers, known surveys, or key authors to start from._
+- Seed papers: {DOIs or titles of papers you already know}
+- Key authors: {Names of major contributors to include}
+- Date range: {e.g., 2020-2025}
+- Excluded: {Subfields or paper types to exclude}
+
+---
+
+## Conference Log
+| Round | Researcher | Best Metric | Key Finding | Status |
+|-------|-----------|-------------|-------------|--------|

package/.grok/skills/autoresearch/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 wjgoarxiv
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/.grok/skills/autoresearch/PROVENANCE.md

@@ -0,0 +1,22 @@
+# Autoresearch provenance
+
+Ported into the LitGrok skill surface from source commit
+`58a65afc174cd8c2fa162bb0d1953b0a88e5d419`, tree
+`9102dfeba13a738d23971b69b6b6ad7bf425c923`.
+
+Source owner identifier: `wjgoarxiv`. Source project identifier: `autoresearch-skill`. These are
+neutral identifiers; LitGrok does not claim anonymous upstream retrieval. Integrity and release
+proof rely on the included MIT `LICENSE`, exact source commit/tree identity, generated skill payload
+hashes, and bytes actually present in the packed package, not a remote fetch.
+
+The Grok adapter, skill-selector vocabulary, review-required contract, path-safe scaffolder, and
+optional plotting preflight are target adaptations. The nested modes, common references, templates,
+scaffolder, and optional style helper are retained and rewritten for Grok Build guidance.
+
+The source loop and progress runners were removed and demoted because they could not honestly enter
+the native host workflow or safely establish authority/completion. Source validation/test support,
+guides, examples, release files, caches, platform installer files, promotion material, and generated
+debris are excluded. No benchmark or throughput metric from excluded material is claimed.
+
+The phrase `Karpathy's autoresearch` is intentionally preserved in the wrapper and source corpus.
+See `LICENSE` for the source family's license.