Build cryptographic algorithms to verify Merkle Tree proofs and optimize Web3 smart contract security
Welcome to the Web3 & Smart Contract Logic Benchmark Challenge!
Goal: Design and implement robust cryptographic benchmarks (such as Merkle Tree proof verifiers) to evaluate and push the limits of Large Language Models (LLMs) in Web3 security and smart contract reasoning.
This challenge tests the reasoning capabilities of Large Language Models (LLMs) in Web3 infrastructure, cryptographic validation, and smart contract logic.
To enter a valid submission for this hackathon, participants must submit:
Note: All final submissions must be submitted before the deadline to be evaluated by the judges.
This track focuses on evaluating Large Language Models (LLMs) on cryptographic algorithms and smart contract logic, specifically focusing on Merkle Tree proof verification and edge-case handling.
| Criteria | Description | Points |
|---|---|---|
| Cryptographic Logic | Accuracy in verifying Merkle proofs and cryptographic operations. | 35 Points |
| Edge-Case Resilience | Proper handling of invalid tree depths and malformed inputs. | 25 Points |
| Benchmark Design | Quality of evaluation scripts and LLM prompt testing framework. | 25 Points |
| Documentation & Clarity | Clean, reproducible code with clear README instructions. | 15 Points |