Mathematical proof

  1. Conditional bounds for Dirichlet L-function arguments and low-lying zeros
  2. A type-theoretic account of abstraction functions and cost verification
    Modular verification in dependent type theory using abstraction functions as types, with support for cost analysis and behavior verification while maintaining privacy guarantees.