You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The logic of assignment end_offset is depending on k to set up the "MAX" number in the sense of space k.
However when k is small (say 18), the start_offset might be greater than end_offset, thus later when Memory::new trying to find imtable entry, the binary search cannot be performed corrected and hit unwrap
Propose: instead of silently allowing it and triggers an assertion in other place, it could be better directly asserting in imtable::new.
Evidence:
Offset: 131194
InitMomoryEntry
InitMemoryTableEntry { ltype: Heap, is_mutable: true, start_offset: 131194, end_offset: 131071, vtype: I64, value: 0 }
Always be the last one.
I am testing host-op with my handcraft repo: https://github.com/LiuJiazheng/rust-host-keccak256
and an example https://github.com/LiuJiazheng/zkWasm-rust
Both symptom are same:
dry run can pass but single-proof failed on imtable with bt:
My script
The text was updated successfully, but these errors were encountered: