this post was submitted on 02 Aug 2026
3 points (53.2% liked)
Showerthoughts
44010 readers
1106 users here now
A "Showerthought" is a simple term used to describe the thoughts that pop into your head while you're doing everyday things like taking a shower, driving, or just daydreaming. The most popular seem to be lighthearted clever little truths, hidden in daily life.
Here are some examples to inspire your own showerthoughts:
- Both “200” and “160” are 2 minutes in microwave math
- When you’re a kid, you don’t realize you’re also watching your mom and dad grow up.
- More dreams have been destroyed by alarm clocks than anything else
Rules
- All posts must be showerthoughts
- The entire showerthought must be in the title
- No politics
- If your topic is in a grey area, please phrase it to emphasize the fascinating aspects, not the dramatic aspects. You can do this by avoiding overly politicized terms such as "capitalism" and "communism". If you must make comparisons, you can say something is different without saying something is better/worse.
- A good place for politics is c/politicaldiscussion
- Posts must be original/unique
- Adhere to Lemmy's Code of Conduct and the TOS
If you made it this far, showerthoughts is accepting new mods. This community is generally tame so its not a lot of work, but having a few more mods would help reports get addressed a little sooner.
Whats it like to be a mod? Reports just show up as messages in your Lemmy inbox, and if a different mod has already addressed the report, the message goes away and you never worry about it.
founded 3 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
I think there's a misunderstanding of the math going on here. A key is lower entropy than random noise, but it's not what crypto works on - it's about computation
You're not pulling order out of the ether, you're calculating a solution to a math problem. Normally, it's an n-p complete problem, meaning it's just difficult to calculate conventionally. It'll take n amount of computation cycles, meaning with a large amount of computing power you can break a key in x time, and there's no known short cuts
Unless there is a short cut - some key methods have been defeated through math, making them trivial to solve. Others have been defeated through increase in computing power, meaning longer key lengths are necessary
In the same way, some key methods are theoretically trivial for quantum computing to solve, while others are quantum resistant
It's all math at the end of the day