You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I don't know if I should write up a formal proposal or just create an issue. My knowledge of hypercore is outdated and not in-depth and since it's not clear to me how much information a proposal should include, here's a github issue.
So, my proposal is to make it possible to search for and find forks of a given hash.
My personal usecase would be to create a distributed story-writing app where people can simply fork a story and make changes. Any user could then browse the tree of forks, merge them (or request different forks to be merged), or simply read them. If star reviews were somehow implemented (haven't figured that one out) then it would be possible to find the most popular fork of a story. It might be a very useful tool for the fan-fiction community.
Given the current workings of hypercore, this doesn't seem possible yet.
The text was updated successfully, but these errors were encountered:
Hi.
I don't know if I should write up a formal proposal or just create an issue. My knowledge of hypercore is outdated and not in-depth and since it's not clear to me how much information a proposal should include, here's a github issue.
So, my proposal is to make it possible to search for and find forks of a given hash.
My personal usecase would be to create a distributed story-writing app where people can simply fork a story and make changes. Any user could then browse the tree of forks, merge them (or request different forks to be merged), or simply read them. If star reviews were somehow implemented (haven't figured that one out) then it would be possible to find the most popular fork of a story. It might be a very useful tool for the fan-fiction community.
Given the current workings of hypercore, this doesn't seem possible yet.
The text was updated successfully, but these errors were encountered: