Live data from Hacker News

Show HN: Subth.ink – write something and see how many others wrote the same

subth.ink

11–20 of 60 posts

Re: Show HN: Subth.ink – write something and see how many others wrote the same

#11
post #4
post #2

This would be more interesting if it was generalized. Using a hash, even one character difference will result in a miss. If I could have it analyze my blog and then find people who have similar ideas that would be incredibly useful.

That is a problem Also a long paragraph would likely never be hashed the same because of a comma or capital letter and so the builder of this would need to cap the length of the thought and make all thoughts lower case without punctuation

i agree removing punctuation wouldve been a good idea alas it may be a bit too late since that would modify the hash of previous inputs in the future hmm but i will think about it

Re: Show HN: Subth.ink – write something and see how many others wrote the same

#13
I love this. Shouting into the void with the distinct feel, hope that if the idea was popular enough, it'd be brute forced back to existing.

I noticed that the input is not being treated any way before hashing. I'd remove all non-letter characters, and then lowercase everything before hashing to help with some unnecessary misses.

Re: Show HN: Subth.ink – write something and see how many others wrote the same

#14
Some of the top items:

  hello world
  4ef69019c65909ffbb470597e3c5afe05ea8a866a0d3b9f950f0bcf057924b52

  hello
  4358f43b660389eecd435dc2a5f5cee29786245cd2cff27bd4de0b3e8fd53b79

  4ef69019c65909ffbb470597e3c5afe05ea8a866a0d3b9f950f0bcf057924b52
  406cc6dbc566bf6c672a2167868341e9853f7fbbd2a21eb1caa4d08006abae41

  hi
  661ce2e5ed28422eb8b51ec2a217c976e05e37713246166e8fcbf67be4824380

  test
  83d34c0abee918ed3edf585b6cb8ce97fe8286027b012bacdfa71b967924f9b2

  a
  beef7c4d3141c30ab4f6ebf1f724936c50f609ee1915951d802046ba1d9fa23d

  subth.ink
  3f3b05abaec959c9950d5a93a64525971c7d9fcabf6436d653edba62f29d5bea

  lol
  39567a3cc35a4c68d72d01beac88414d0ced5c20b437ff9bc6e2cb20615a47b7
Thanks to Y@Y for 4ef69019c65909ffbb470597e3c5afe05ea8a866a0d3b9f950f0bcf057924b52.

Re: Show HN: Subth.ink – write something and see how many others wrote the same

#15
post #2

This would be more interesting if it was generalized. Using a hash, even one character difference will result in a miss. If I could have it analyze my blog and then find people who have similar ideas that would be incredibly useful.

To be really honest, they can take a look at bao. (I used it for an eerily similar project like this one though its great that this is receiving traction! I Do feel like scuttlebutt protocol might be good implementation for most use cases as well)

Bao allows us to have a common hash for the first n contents of the term and then they can still have common hash so you can just loop it over each continuous word to see how much commonly (long?) their hash is and the length becomes the amount similar

Some issue might come where if the word changes in the start and the rest is similar but I feel like bao could/does support that as well. My information on bao is pretty rusty (get the pun? It's written in rust) but I am sure that this idea is technically possible & I hope someone experienced in the field could tell more about it

https://github.com/oconnor663/bao, Oconnor's bao's video or documentaries on youtube are so good, worth a watch & worth a star (though they do mention that its a little less formally cryptographically solved iirc but its still pretty robust imo)

Re: Show HN: Subth.ink – write something and see how many others wrote the same

#16
post #14

Some of the top items: hello world 4ef69019c65909ffbb470597e3c5afe05ea8a866a0d3b9f950f0bcf057924b52 hello 4358f43b660389eecd435dc2a5f5cee29786245cd2cff27bd4de0b3e8fd53b79 4ef69019c65909ffbb470597e3c5afe05ea8a866a0d3b9f950f0bcf057924b52 406cc6dbc566bf6c672a2167868341e9853f7fbbd2a21eb1caa4d08006abae41 hi 661ce2e5ed28422eb8b51ec2a217c976e05e37713246166e8fcbf67be4824380 test 83d34c0abee918ed3edf585b6cb8ce97fe8286027b012b…

Currently number three is:

  4ef69019c65909ffbb470597e3c5afe05ea8a866a0d3b9f950f0bcf057924b52
with hash:

  406cc6dbc566bf6c672a2167868341e9853f7fbbd2a21eb1caa4d08006abae41
i.e. the hash of "hello world"

Re: Show HN: Subth.ink – write something and see how many others wrote the same

#18
Another comment here as I got way too much excited in the other one, but this is genuinely so good man!!! KUDOS!

It actually provides a simple curl command. Oh boy, this does open up a few more ideas. I feel like my wall of text -> link shortener / blog and all other comments on that wall of text being comments themselves might be implemented & this does open up to a lot of possibilities

I actually got a vps of like 8 gigs 4 cores 500 gigs ssd for 3 months prepaid and I snatched it during a recurring deal.

If you want, i can transfer it to you or share half the resources or similar to you if this project ever needs one.

One of the most interesting things is that this (unlike my idea which was just a "proof" if it was possible in a more complex environment) actually does make it simple and for normal devs to build upon

You are mentioning scotty, and I am not sure if you mention scuttlebutt the protocol or as if scotty is some haskell web framework (sorry don't know haskell)

What are your thoughts on scuttlebutt or (nanotimestamps), I have it open source under the MIT license for anyone to build on top of it with.

Your project's really polished and I admire it but I would hope that you can look more at the decentralization side of things because one of the ideas I had which never got to fruition was that adding on top of it, we can just have a social media similar to nostr but without the relay mess that nostr has in many instances (or so I have heard)

I am curious as to what are some use cases you are thinking of it as I'd love to know your opinion on it!

Have a nice day man!

Post reply on HN