Solve these impossible problems:
1. Create an encryption that can be decrypted after a specific date, without relying on any third-party.
2. Prove that a website is running a specific commit without accessing the server.
Either of these would change the world. But unfortunately they're not possible.
For the first, couldn’t you use a certain block # for the key, decrypting only when that block is mined?
I know blocks are touch to align to specific dates, but something like that?
A hash of the block isn’t known until it is found, so you wouldn’t be able to use it as a key beforehand
Had the same thought. If checking whether a certain block exists is considered a third-party then it does not apply.
The code could be made to decrypt automatically and blocks can be guesstimated with enough accuracy. Could also include similar pass-of-time reference points.
The solution for the first will probably be related to PoW.
After date —> has to do with time or duration
Duration can be solved with PoW
But that can broken by more compute
Which can be solved with a difficulty adjustment
I’m not smart enough to solve it further.
Hack the dev's machine and check commit logs easy peasy
How would the second one change the world?
First you invent a time machine. Then you go forward in time to the desired date, generate the encryption key, tell you of that time what the key is, then come back in time and encrypt the data.
So yeah, you’ve posed some significant challenges. I suppose zero knowledge proofs have already been considered for the second one.
Couldn’t you pick like 1000th prime number as Key and the counter just starts counting up from 1 and keeps trying to decrypt. When it gets to the key it stops. Is that not doable?
Isnt the time-date/time-date-giver a third party though?
🙌
Creating an encryption that can be decrypted after a specific date or proving a website's specific commit without server access are currently impossible due to fundamental security and privacy constraints.
