Researchers evaluated the effectiveness of formal verification in the Bend 2 language

Analysis of Bend 2 revealed significant complexities when using the language for formal code verification tasks. The study showed that to prove basic properties of game mechanics, developers need to write 58 lines of formal laws and 442 lines of proofs.

In comparison with alternative methods, it was found that the SPARK language copes with similar tasks using only 12 invariant-based checks. The high entry threshold in Bend 2 is due to the specifics of the "vibe-coding" approach, which, despite its flexibility, loses to specialized tools in strict mathematical justification of algorithm correctness.

The authors of the analysis note that the current implementation of Bend 2 requires significant resource costs for writing auxiliary code for verification. This makes the development process more labor-intensive compared to traditional methods of static analysis, where logic checking is automated through built-in invariant mechanisms.

The research results highlight the gap between modern high-level programming languages and the requirements for the security of critical systems. A discussion of the technical details and limitations of Bend 2 is available in a dedicated thread on Hacker News, where the community compares the effectiveness of different approaches to code verification.

These findings indicate the need to refine verification tools in the Bend ecosystem to reduce the amount of redundant code. Without the introduction of more efficient verification methods, the use of the language in projects requiring high reliability remains problematic.