Nate Rush

(Not Complete) List of Necessarily Changes: 1. Forkchoice needs weight to be defined locally, rather than from the validator themselves. This is both for the case that you see a...

Spent some time yesterday fleshing out an algorithm with Vlad. The goal here is to have the forkchoice run on the "minimal tree" necessary. For our purposes, we will say...

Now, we can extend this algorithm so it is sequential. That is, we can maintain this minimal tree while receiving new messages to add to the tree. Let's call this...

Upon arrival (aka, no longer pending!)

You're probably right that the market would be nowhere near as rational as I'm making it out to be. :) However, I think there might be some other concerns with...

Here’s a possible design scheme that might better incentivize curation while discouraging bad behavior. When a user buys in, X% of their tokens minted are locked and not withdraw-able or...

@plasmonresonator thanks for the bug report! We knew there was some wacky-ness with filtering and duplicating, but this is wackier than I expected. Can you currently filter on the first...

@twelsh37 thanks for the bug report! This is certainly not great behavior. It seems like potential solutions here: 1. Mito points you to the row (tough, if it is rows...

I think we can target the setup.py; there notably is some build:all that happens in here already. Can we remove the npm install? What else can we do here?

@jake-stack thanks for the feature request! I think that this sounds like a pretty cool feature, and also something that deserves to go through the full-product process before we implement...