def
definition
main
show as:
view math explainer →
open explainer
Read the cached plain-language explainer.
open lean source
IndisputableMonolith.CPM.AuditMain on GitHub at line 117.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
-
complete -
printConsistency -
printConstants -
printExamples -
printHeader -
printProbability -
printSummary -
main -
and -
main
used by
-
argon_ea_zero -
galerkinNS_hasDerivAt_duhamelRemainder_mode -
nsDuhamel_of_forall -
nsDuhamel_of_forall_kernelIntegral_of_forcing -
consistent_completeStateFrom -
Jcost_is_calibrated -
main -
P_forced_to_RCL -
dalembert_deriv_ode -
xi_derived -
rar_power_law_emergence -
dirichletForm_edgeArea -
bounded_Jcost_bounded_max -
PhiLadderCutoffCert -
six_almost_prime_threehundredfiftytwo -
linking_selection_principle -
eight_tick_compactification -
endpoint_classification -
radius_sublinear -
riemann_lowered_pair_exchange -
log_sum_inequality -
main -
main
formal source
114 IO.println ""
115
116/-- Main entry point for the CPM audit CLI. -/
117def main : IO Unit := do
118 printHeader
119 printConstants
120 printConsistency
121 printProbability
122 printExamples
123 printSummary
124 IO.println "Audit complete. CPM constants and consistency checks verified."