Replying to Avatar Dustin Dannenhauer

What interesting computer science problems arise in Nostr development? I'm thinking of putting together a talk on this for CS folks that aren't familiar with Nostr. Here's what I have so far, and please suggest new items or revisions to current ones:

- public/private key encryption schemes between individuals, groups, groups with moderators, temporary delegations of key signing (#nsecbunker)

- graph analysis and scoring to solve problems like web of trust (#WoT)

- distributed file storage and sharing, like what #blossom is trying to do

I know there's got to be a lot more, 🙏 in advance
Avatar
Vitor Pamplona 1y ago

Event finding: Given that you only have an event id, find which relay has it to discover who the author is and hit that author's home relay for more information (replies, reactions, zaps) about this event. Everything starts with an event ID search. It's a similar problem to the file distribution if you consider each event being a file.

Distributed search: A version of event finding, but based on search parameters like contents of an event or an image.

Voting: How to count things without an order of events / time chain (events can be created in the past).

Database Indexing Performance: SHA256 hashes make terrible Primary keys.

Relay Syncing: Efficient nostr-native whole-DB diff calculations are hard.

Reply to this note

Please Login to reply.

Discussion

No replies yet.