@sampocino@razzy_ar It should be some kind of equivalent of passing explicit buffer with ability to allocate temporary objects from it - similar to how stack is passed implicitly but instead it should be additional local heap with fixed maximum capacity.
@pikuma That means that is you have two operations with O(1) behavior you can't compare absolute execution time of those operations based just on O notation. It also absorbs compiler optimisations.
@pikuma I have answered O(1) just based on the fact that the number of checked is fixed. People often misinterpret Big O notation and do not understand that it for asymptotic behavior and include implicit constant.
Lean 4.30.0 is live!
The release notes highlight four areas: a new 𝚜𝚢𝚖 => tactic, 𝚌𝚋𝚟 out of experimental, a completed LCNF compiler backend, and a full Lake cache overhaul.
On 𝚜𝚢𝚖 =>: "Unlike 𝚐𝚛𝚒𝚗𝚍 =>, which eagerly introduces hypotheses and applies proof by contradiction, 𝚜𝚢𝚖 => gives users explicit control over each step."
On the compiler: the expand reset/reuse port "results in a ~15% decrease in binary size and slight speedups across the board."
Full release notes: https://t.co/qSFWZVjK4x
@Scivf4 I think it would be better to draw line y = 2 π x and calculate area under the line for x from 0 to r. Or split circle into sectors and unwrap sectors.
Recordings and slides from Software Verification in Lean 2026 are now available.
The one-day workshop and multi-day hackathon, held in Paris in April, brought together researchers from the Beneficial AI Foundation, @CryspenHQ, @ethereumfndn, @GoogleResearch, @leanprover, @MSFTResearch and others to share recent advances in building verified software.
Recordings: https://t.co/KzlJZJwKHf
SVIL website: https://t.co/2NfzbWb8n4
#LeanLang #LeanProver #FormalVerification #SoftwareVerification
@quantum_geoff I just need just one bit in the root of the tree and extra "if" operator in traverse function. Give me one bit and I will reverse binary tree ;)