HuLaHo routes supported inputs to deterministic implementations. The ordinary calculator uses JavaScript floating-point numbers; exact arithmetic uses reduced integer fractions. Rules infer only conclusions supported by represented premises. Boolean checks enumerate bounded truth assignments. Finite constraint search uses explicit domains and reports search limits.
Offline vocabulary
The lexical index contains 147,478 terms and phrases, 117,791 senses and 378,203 relations. The engine distinguishes direct dictionary definitions, quoted user explanations and wording-based inferences. It does not treat next-word likelihood as factual confidence. See the vocabulary guide and lexical data licence.
Knowledge and sources
The public pack contains 168 curated notes. Some summarize linked primary sources; others are authored definitions or engineering guidance. Private documents remain separate. Retrieval uses explicit aliases and lexical matching, not a general semantic understanding model. A reference excerpt is not a verified fact about your personal situation.
Learning
Synthesis searches a defined grammar of numeric and text functions. The final distinct example is withheld from candidate selection and used as a validation gate. Earlier regression examples must continue to pass before a version activates. Those checks do not prove all unseen cases. Numeric extrapolation is labeled. Taught phrases and translations are literal patterns and exact entries, not unrestricted multilingual fluency.
Uncertainty
Bayesian updates use supplied priors and likelihoods. Diagnostic ranking uses expected entropy reduction per supplied cost. Neither tool measures the truth of the assumptions. Optimization is proven only when the bounded search completes under the provided model; otherwise the best found candidate is reported without an optimality claim.
Explore the reference catalogue and capability guide. No AGI, security-impossibility, search-ranking or performance-multiplier claim is made.