Phylons dynamic combinations

JUBAP/Phylons did not attempt an exhaustive evaluation of all predictive-factor states and all of their combinations. It built a dynamic, budgeted search system in which the representation, candidate set, evaluation depth, temporal evidence and active rule portfolio changed over time. The supplied source snapshot confirms four especially important mechanisms. Quantitative factors were expanded into one-sided and bounded predicates at multiple granularities; active predicates were materialized on waves; positive combinations were extended only when every pair of states satisfied a positive performance-interaction relation; and negative exceptions were extended only under complete adverse pairwise constraints. These mechanisms operated alongside occupancy-constrained discretization, multi-horizon occurrence filters, timed worker hand-offs, persistent rule statistics and residual-focused combination discovery.

The paper formalizes this architecture as an anytime, coarse-to-fine, selectively incremental search over interpretable context rules. The actual cost object is not a simple 2^N space: it depends on the size of the predicate lattice, graph density, maximum rule depth, temporal memories, books, targets and compute budget. Support supplies a safe anti-monotone pruning rule; performance interactions constrain search heuristically; positive bases become cliques in a positive-interaction graph; and exception sets form adverse structures relative to their bases. The result is a code-grounded explanation of how a large semantic-context space was made operational without claiming exhaustive completeness, global optimality or proven minimal contextual sufficiency.

The optimization was not one pruning trick. It was a stack: encode compactly, materialize once, screen both supportive and adverse states, prune by anti-monotone support, expand only along empirically useful relations, construct exceptions separately, allocate bounded compute, update sufficient statistics incrementally, and keep a slow recovery path running behind the fast path.