The general mechanism comes first.
Design a reusable engine for prediction, mechanism discovery, problem discovery and invention across topics. Develop the mechanism first; use domain examples to expose what the architecture is missing.
Creativity can change the representation, suggest a new interaction or invent a capability. Brute-force search can explore combinations within that representation. Let each expose gaps in the other, then test the resulting claims.
The core manages provenance, candidate generation, search, comparison and revision. Domain adapters supply meaningful variables, constraints, measurements, simulators and tests. A general interface does not make knowledge or validation interchangeable across domains.
Working architecture proposal, version 1. Challenge or replace these modules; they are discussion scaffolding, not a running engine.
Frame—and discover—the question
Input: An observation, goal, failure or unexplained residual.
Describe entities, properties, relations, context, available actions and unknowns. Ask which missing question would change the decision. Preserve alternative framings.
Output: Versioned problem representation, candidate questions and explicit boundaries.
Build the evidence and assumption model
Input: Original sources, measurements, theories and candidate constraints.
Record provenance, units where applicable, measurement error, applicability and contradictions. Separate observations, modeling choices and established constraints. Audit inherited assumptions.
Output: Evidence graph and assumption ledger with source-linked support and counterevidence.
Create competing mechanisms
Input: The representation, evidence, analogies and unsolved barriers.
Use cross-domain analogies, causal or symbolic models, decomposition, recombination, counterexamples and capability invention. Generate unfamiliar alternatives, including ones outside the initial search vocabulary.
Output: Candidate mechanisms with premises, dependencies, predicted consequences and failure conditions.
Search the combinations
Input: Candidate components, parameter ranges, constraints and explicit resource limits.
Define a search grammar or space. Compare bounded enumeration, sampling, solver-based or evolutionary approaches where appropriate. Prune demonstrably invalid combinations; retain uncertain candidates for targeted tests. A search failure may call for a new representation.
Output: Reproducible search manifest, explored coverage, candidates, rejection reasons and unsearched regions.
Derive discriminating predictions
Input: Each candidate mechanism and its strongest alternatives.
Derive observable consequences, counterfactuals and intervention predictions. Quantify uncertainty when justified; otherwise state it. Simulations are conditional on their assumptions, not independent confirmation.
Output: Predictions tied to conditions, observables, uncertainty and tests that separate mechanisms.
Choose and evaluate informative tests
Input: Predictions, test costs, measurement capabilities and simple baselines.
Propose the smallest comparison that could change the ranking. Separate held-out data from candidate generation. Record safety and authorization needs before any real experiment. Preserve negative results and baseline victories.
Output: Test protocol, actual or pending results, limitations and revised assessments.
Improve the engine as well as the answer
Input: Prediction errors, rejected candidates, missed opportunities and test results.
Locate the failure in data, representation, mechanism, search or evaluation. Propose a versioned change, test on fresh tasks and preserve rollback. Ask what new bottleneck appears after a successful intervention.
Output: Revised hypotheses, new questions, parked ideas with revisit triggers and separately evaluated engine changes.
A worked example of the engineApply it to clean energy.
Use this case to test the architecture: can it represent the fundamentals, invent mechanisms, search combinations and separate promising candidates from unsupported claims?
Investigate safe positive net-energy output and routes toward near-zero full lifecycle delivered cost. Explore established technologies and speculative pathways side by side, with their readiness clearly labeled.
Stages: Immediate deployment · Scaling needed · Laboratory · Research · Conceptual.
What does “free energy” mean here?
These are different claims. State which one you mean:
- A free primary resource
- Low marginal generation cost
- Energy funded by another useful service
- Operational energy surplus
- Full lifecycle delivered cost
Name units, timescale, functional output and system boundary before comparing claims. Near-zero delivered cost is a research objective, not an established result or exemption from energy conservation.
Keep the accounting and safety visible
- Energy sources and operating inputs
- Conversion, storage and delivery losses
- Embodied energy, replacement and maintenance
- Capital and operating costs, financing and lifetime
- Coproduct revenues without double counting
- Failure modes, poor maintenance, uncertain inputs, and who bears the risk
A stronger simple baseline can erase an apparent advantage. That narrows a claim and points to the next useful question; it is worth preserving.