CHIP-0053: Secure the Bag for distributed payouts #183
Conversation
judeallred
changed the title
|
This CHIP is now a Draft. Please leave your reviews here, and feel free to discuss it in the #chips channel of our Discord. |
|
A CHIP discussion has been scheduled for Wednesday, December 10th at 10am EST. A Zoom link will be shared in Discord prior to the event. |
|
The recording of our discussion of this CHIP is now available on Youtube. |
|
I have added a bunch of new information to this CHIP. Most of what I added was to answer questions from the Zoom call. The CHIP still needs an implementation, which could also change some of the other context. |
|
The reason the optimal fanout for secure the bag deviates from e is that there's a constant added to the cost of each node. The interesting single parameter is the ratio of that cost to the cost of each individual reveal of children in the fanout. The closed form optimal fanout is r/W(r/e) where W is the lambert W function. You can reasonably approximate this by it being e at 0, 8 at 8, and 38 at 100, and drawing two line segments between those three values. This 'optimal' value is for the cost of the first thing to be unrolled. When optimizing for overall cost the higher the fanout the better and the extra costs incurred are roughly r/(f-1) |
No description provided.