Hacktoberfest 2026: los issues que los mantenedores marcaron para octubre, abiertos y aptos para principiantes. Explorar issues de Hacktoberfest

Reduce explorer memory per state and evaluate partial-order and symmetry reduction

Abierto
  • ¿Algo no está bien?
#37 0 comentarios 0 reacciones 0 asignados Ver en GitHub

Nadie ha tomado este issue todavía.

Evaluación

Dificultad
5/5
Tiempo estimado
Más de una semana
Aptitud para principiantes
25/100
Tipo de issue
Nueva funcionalidad
Claridad
Bastante claro
Estado de actividad
Activo
Stack tecnológico
node.js, typescript
Área
performance, testing-qa

Línea de trabajo

Start with packages/engine/src/explore.ts and packages/engine/src/relevance.ts to understand state exploration and relevance reduction; then read packages/engine/test/explore-perf.test.ts and its synthetic fixture. Profile the existing packs and drop pass before evaluating memory encodings and reduction approaches. Done means recording before and after measurements, documenting reduction decisions and soundness where applicable, and clarifying unreached-content handling in spec section 14.

Escrito por el modelo de indexación a partir del texto del issue.

Descripción

area: engine priority: medium type: research

Context

The explorer uses about 1.8 KB of heap per state; 200,000 states took about 6 to 9 s and 400 MB in Node when measured during v0.1. The relevance reduction removes flavour state, but independent relevant state (parallel puzzle strands, visited sets) still multiplies. Since v0.1, lexvm check also runs a second exploration that drops carried items (up to 20 times the main state count), and an incomplete exploration is an error, so the state limit matters more. Exploration in the browser (import, workshop) needs far less memory. Unreached rules and dialogue options are reported only where the result is conclusive under the relevance reduction (coverageCheck in relevance.ts), so some content that never fires goes unreported, and spec section 14 does not say so.

Scope

  • Profile memory per state; candidates: a compact binary state encoding (bit sets for flags, visited rooms and object state), interned keys, and a smaller frontier representation.
  • Evaluate partial-order reduction for independent commands (for example learning clues in different rooms) and symmetry reduction. Any reduction must stay sound for dead-end detection under offered actions.
  • Make unreached-content reporting complete, or document in spec section 14 that rules and options whose firing depends on reduced state are not reported.
  • Extend explore-perf.test.ts with the noir pack and a synthetic pack with parallel strands; measure the drop pass as well.

Acceptance criteria

  • Memory per state and run time are measured before and after for both packs and the synthetic pack, and recorded here.
  • Every optimisation that is merged gives identical results for all packs and fixtures.
  • Partial-order and symmetry reduction are implemented or rejected, with the reasons recorded here; a merged reduction has its soundness argument in the header of explore.ts and tests for dead ends that only appear in specific command orders.
  • Spec section 14 states how unreached content is treated.

References

  • packages/engine/src/explore.ts
  • packages/engine/src/relevance.ts
  • packages/cli/src/exploration.ts
  • packages/engine/test/explore-perf.test.ts
  • packages/engine/test/fixtures/runtime/synthetic.ts
  • docs/adr/0005-forgiving-policy-verified-by-exploration.md
Lenguaje dominante
TypeScript
Estrellas
0
Forks
0
Merge medio
28 min
PR fusionados (30 d)
2

Preparar el entorno

Primeros pasos

  1. Lee el issue completo y luego la guía de contribución del proyecto.
  2. Comenta en el issue que vas a ocuparte — evita que dos personas hagan lo mismo.
  3. Haz un fork del repositorio y trabaja en una rama.
  4. Abre un pull request que haga referencia al número del issue.

Más de nullthrone/lexvm

Todos los issues de nullthrone/lexvm

Issues similares

Más issues de TypeScript

Recibe los nuevos issues en tu correo

Un resumen breve de issues de GitHub para principiantes.