PRCPrimeCalibrationPropagationSharpenedTarget_refuted
plain-language theorem explainer
The sharpened Pass-27 prime-calibration propagation target is false: floor-successor transport plus coherent prime orientation cannot both hold. Anyone tracking native-cost uniqueness blockers or the universal-foundation certificate cites this. The proof is a one-line reduction: sharpened implies the coarser propagation target, which is already refuted.
Claim. The conjunction of the sharpened prime floor-successor transport target and the coherent-prime-orientation-to-global target is false. Equivalently, no model simultaneously satisfies both halves of the Pass-27 refined prime-calibration propagation package.
background
In the Primitive Recognition Calculus, native cost uniqueness is attacked by packaging candidate structural constraints as named targets and then either proving or refuting them. The Pass-27 refinement of prime propagation is the conjunction of two sharpened demands: a floor-successor transport law along primes, and a coherent orientation of primes that propagates to a global orientation of the calibration data.
The coarser (unsharpened) prime-calibration propagation target is already known to be false: it forces a prime-pair product cost-consistency target that has been refuted. A separate lemma records that the sharpened package implies the coarser one, by routing local prime orientation through global orientation and then into the ordinary propagation target.
This module sits in the foundation layer that isolates which native-cost hypotheses can survive; refutations here feed blocker certificates rather than positive uniqueness theorems.
proof idea
Assume the sharpened target. Apply the implication that sharpened orientation data yields the ordinary prime-calibration propagation target. Discharge the assumption by the existing refutation of that coarser target (itself obtained by forcing a prime-pair product cost-consistency statement already known false). The whole argument is a two-step composition under intro.
why it matters
Closing the sharpened Pass-27 package prevents a refined escape route for prime-calibration propagation that might otherwise have revived native-cost non-uniqueness. Downstream, the native-cost uniqueness blocker certificate aggregates this style of refutation with proved factorization facts; the universal-foundation conditional certificate consumes the same foundation stack (kernel, ordered field, trace logic) once blockers are settled.
In the broader Recognition Science chain, native cost is the bridge from the Recognition Composition Law and J-uniqueness (T5) toward forced constants and the phi-ladder. Ruling out sharpened prime-propagation hypotheses keeps the uniqueness program honest: only targets that survive this sieve can underwrite a unique native cost.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.