> in OT, every new primitive requires an exponentially growing number of proofs, you can avoid that with a simpler algorithm. Its not actually necessary to add

> in OT, every new primitive requires an exponentially growing number of proofs, you can avoid that with a simpler algorithm. Its not actually necessary to add any new primitives though. Most of the time, composite operations can represent higher-level operations. I'll expand on this below. > I am personally interested in more complex data structures such as matrices and trees Trees can be modelled in OT using only the primitives of insert, update, and delete, providing that you support linear addresses (i.e. paths). We know from Lisp that everything else can be modelled from trees, so you effectively get a general-purpose system from just three primitives. CoPowerPoint was implemented using this approach and allows arbitrary graphical editing.