Sergey

Hm, it might give some speed up but looks quite complicated. Probably such thing could be implemented as separate property ```py Class Socket: cache = {} # should be reseted...

> also is there a genuine need to check node here? It can be None for the same reason when `socket.is_linked` is False when it should beTrue. Another solution would...

I think it worths because it has O(len(tree.nodes)) to call, so in bigger trees (more then 100 nodes) the overhead can be even more significant. Probably the node parameter should...

I think it's possible simplify the draft mode and instead of calling the properties_mapping method to use a naming convention: ```py if socket.id_data.sv_draft: return f"{socket.prop_name}_draft" else: return socket.prop_name ``` But...

> if self.node is expensive, why is that? According to [information ](https://developer.blender.org/T88587#1166224)from Jacques Lucke I don't think having dictionary will be simplest solution because we can't keep straight references to...

I will take `Find closest value` node for prototyping new API on its example.  The simplest solution of solving many problems above is to create separate function for each...

Possible solution could be never to delete any sockets if this issue will be resolved - https://developer.blender.org/T89109

Does anybody has an idea how to handle this elegantly? What is expecting behavior in this case? What I'm sure is that when A Number node will be connected back...

The problem of the Object socket is that it keeps straight reference to a data block which can become invalid in any moment. We have quite a few input nodes...

It defenetly does not work as it was intended according to the documentation - http://nortikin.github.io/sverchok/docs/user_interface/socket_menus.html#graft-topology Expected result should be `[[[[0,1]], [[2, 3]], [[3, 4]]]]` in the case below.