Skip to content
CodeQL Security Analysis

proof(lean4): mechanize BFT quorum-intersection safety (Theorem 3) #136

Sign in to view logs

proof(lean4): mechanize BFT quorum-intersection safety (Theorem 3)

proof(lean4): mechanize BFT quorum-intersection safety (Theorem 3) #136

Run time

Learn about OS pricing on GitHub Actions
Job Run time
analyze (actions, none)
38s
38s