anujsays 2017-11-05T14:59:57.000029Z

Correction on my talk yesterday - Pedestal routing algorithm has constant time complexity in optimal case, O(log N) otherwise. For more details, read- and see the recent presentation of Paul-

amarjeet 2017-11-05T15:04:10.000055Z

yeah, I was about to ping you to check on this, I was watching this video today

amarjeet 2017-11-05T15:04:12.000009Z


Shantanu Kumar 2017-11-05T16:25:00.000045Z

@anujsays In case you happen to benchmark Pedestal routing against any Ring equivalent, please let me know.

anujsays 2017-11-05T16:25:31.000071Z

Sure. I will do that before pushing this to production. Will keep you posted.