Value Semantics Optimization

Make Ori's value semantics as fast as reference-based mutation in any language — period. Every collection operation (push, pop, insert, remove, concat, slice, sort) must achieve O(1) amortized or better when the value is uniquely owned, with zero-copy views for read-only access and compile-time elimination of runtime checks when ownership is provable. This plan covers the entire system: runtime primitives, LLVM codegen, interpreter parity, static analysis, and exhaustive verification across correctness, memory safety, and performance.