Hi all, The current implementation of authorization is based on Bytecode which will be removed from TinkerPop 4.
We need a new way to determine whether a Traversal contains mutating steps and what Graph it will work with. The easiest way to get this information is to eval script with corresponding script engine, but this is an unnecessary action that can degrade performance. Probably the best solution is to eval the request only once and then put it in the Netty Channel context. Any thoughts about this? Regards, Valentyn
