![](/static/253f0d9b/assets/icons/icon-96x96.png)
![](https://lemmy.world/pictrs/image/0943eca5-c4c2-4d65-acc2-7e220598f99e.png)
Lol. Minerals?
Lol. Minerals?
Someone decided to develop a fork. Posting from it right now. You can download it here
But it’s 1 GB of backups. There seems to be no limit to how much you store, it’s offline after all and syncs peer to peer it doesnt cost them money if you store more stuff. However, I’d be interested to see how easy it is to store you backups on your own somewhere.
Your example with the camera module is exactly what happened to the FP3. They released the FP3+ which featured a better camera and users of the original model could upgrade by just buying this module.
However this is definetly not the focus of Fairphone as a company as too many or regular new modules would introduce new e-waste again.
Hello there, For a prequelmemes replacement, checkout:
Over 500 Upvotes in 3h. This is highly viral for lemmy right?
That game was so good. It’s a bit sad that they never released a sequel. Otherwise, it probably would have been underwhelming.
Unfortunately, you can only downgrade Jerboa to the former version or wait for feddit.de to be updated to Lemmy 0.18. The latest Jerboa version is currently not compatible with feddit.de which is running Lemmy 0.17.4.
You can also browse the mobile web version of feddit.de while waiting. That’s what I am doing atm.
That would be awesome. Do you have any Git links to track progress? Thanks!
Also no expert about the math behind it but this is how I learned asymmetric encryption with public and private key on a very high level of abstraction:
To encrypt a message you basically take the unencrypted message to the power of the private key (lets call that d) and divide it by the result of a multiplication of two large prime numbers (lets call that N). Now you take the rest of that division, so basically modulo if you are familiar with that.
To decrypt, you take the encrypted message to the power of the public key (e) and divide it by N. The rest of that operation is again the unencrypted message.
So the private and public key are the pairs (d, N) and (e, N) respectively. The great thing about this is that you can post the public key publicly without care and only you, in possession of the private key, can decrypt messages encrypted with your public key. So its easy to verify if you got the key but hard to brute force due to modulo being a one way function. However, this basic RSA approach as described here is not used on its own anymore but rather in combination with other techniques to prevent guessing on very short messages or keys.