Live data from Hacker News

Show HN: Anytype – local-first, P2P knowledge management

anytype.io

81–83 of 83 posts

Re: Show HN: Anytype – local-first, P2P knowledge management

#81
post #52

Earlier quoted context omitted.

How would you search through thousands of notes? Decrypt them all in memory, search and encrypt them again? How does this scale with attachments?

I have a private note app that I wrote for personal notes to keep them off the cloud. This is the one problem I don’t know how to go about solving for tens of thousands of notes. If anyone has any solutions, please share.

is it possible you create a vector index on the open documents and that index basically has searchable value but doesn't leak anything vital? if it were just English you were searching for, then it wouldn't need encryption.

Re: Show HN: Anytype – local-first, P2P knowledge management

#82
post #42

Related: Anytype Desktop 0.37.0 Released - https://news.ycombinator.com/item?id=38772317 - Dec 2023 (1 comment) Anytype – local-first, P2P Notion alternative - https://news.ycombinator.com/item?id=36799548 - July 2023 (273 comments) Anytype. FOSS Notion Alternative - https://news.ycombinator.com/item?id=34167322 - Dec 2022 (7 comments) Anytype: A local, privacy-first Notion alternative - https://news.ycombinator.com/…

Is it not source-available rather than open-source?

I don't know, but we probably wouldn't correct a title after it's been up for that long.

Re: Show HN: Anytype – local-first, P2P knowledge management

#83
post #52

Earlier quoted context omitted.

How would you search through thousands of notes? Decrypt them all in memory, search and encrypt them again? How does this scale with attachments?

I have a private note app that I wrote for personal notes to keep them off the cloud. This is the one problem I don’t know how to go about solving for tens of thousands of notes. If anyone has any solutions, please share.

One simple way to get around this is to use some sort of labelling system for your notes.

Then you can hash the labels and keep an index of the hash. You can also symmetrically encrypt the hash, or slugify it first. The index can be a file, or many, that you load in memory and keep updated / synced on changes.

You can then do label-based searches on your notes by first hashing the input string and searching for an exact match in the index.

For something like full text search on encrypted data, I guess you'd need to use a database that already does that.

Post reply on HN