QR-Code-generator VS rupy

The funny thing is that no-one AFAICT has realized that the same content can be encoded in different-looking QR codes. Beside the obvious (different error-correction levels), the content itself can be changed while maintaining its semantic meaning (e.g. "https://example.com/foo", "HTTPS://EXAMPLE.COM/foo", or "HtTpS://eXaMpLe.CoM/foo" are all semantically identical) and even the QR encoding itself can be tweaked (e.g. by changing the version and mask, see the demo on https://www.nayuki.io/page/qr-code-generator-library). Each combination would yield a different-looking QR code that would encode the same meaning, and it could therefore allow the diffusion models even greater freedom.

I'm sure somebody will get to this soon.

Make a hidden Veracrypt vault on cold computer. Inside the Veracrypt vault save Keepassxc vaults. Store your seeds inside the Keepassxc vaults. For a paper backup, encrypt your seeds using an offline AES256/512 text encryptor/decryptor. Encode the encrypted text using an offline qrcode generator. Print out the qrcode. Test recovery using a dummy wallet. Be sure you can scan and decrypt. Bonus: Laser etch the qrcodes on metal plates. Make a multi-factor recovery vault, in case you forget your passwords. Shimar's secret sharing scheme is a useful tool for making your recovery vault. Never store your seed unencrypted anywhere, ever. Never input your seed on an online computer, ever. Always protect your seeds with something you know (password), something you have (vaults and keyfiles). Do not upload your vault to the cloud. Keep backups in multiple locations. Necessary tools: Cold computer: Any old computer will do. Just physically disable network access. Veracrypt: https://www.veracrypt.fr/code/VeraCrypt/ KeepassXC: https://keepassxc.org/ Cross-platform, open-source text string encryptor. https://github.com/a3diti/aes256-offline/ Cross-platform, open source QR code generators: https://kazuhikoarase.github.io/qrcode-generator/js/demo/ https://github.com/amanuel/JS-HTML5-QRCode-Generator https://github.com/nayuki/QR-Code-generator Shamir's Secret Sharing: https://github.com/paritytech/banana\_split

Necessary tools: Cold computer: Any old computer will do. Just disable network access. Veracrypt: https://www.veracrypt.fr/code/VeraCrypt/ KeepassXC: https://keepassxc.org/ Cross-platform, open-source text string encryptor. https://github.com/a3diti/aes256-offline/ Cross-platform, open source QR code generators: https://kazuhikoarase.github.io/qrcode-generator/js/demo/ https://github.com/amanuel/JS-HTML5-QRCode-Generator https://github.com/nayuki/QR-Code-generator Cross-platform, open-source text string encryptor. https://github.com/a3diti/aes256-offline/ Shamir's Secret Sharing: https://github.com/paritytech/banana\_split

I probably know this only because back in time I wrote a QR code generator in JavaScript [1] which was also one of such libraries reviewed by Nayuki [2], and as I haven't actually implemented a decoder my knowledge stops there. Sorry :-)

[1] https://github.com/lifthrasiir/qr.js

[2] https://www.nayuki.io/page/qr-code-generator-library

I guess it helps to understand how to generate a QR code: https://www.nayuki.io/page/qr-code-generator-library (see also the references at the end)

Good luck. ;-)

i think i found what i was looking for

I have been running a Raspberry 2 cluster for 10 years: http://host.rupy.se

A few weeks back the first SD card to fail got so corrupted it failed to reboot!

My key learning is use oversized cards, because then the bitcycle will wear slower!

I'm going from 32GB to 256/512/1024!

How this article does not mention SSE, comet or chunking escapes me.

What does their definition of event-driven really look like in practice.

Nobody has a clue.

Here is the ideal event driven system, it's async-to-async: https://github.com/tinspin/rupy/wiki/Fuse

The example is not working because I had to shut down the services for multiple reasons, but the high level of it is that you use 4 (potentially different) threads to do one request/response middle man transaction.

That way you have _zero_ io-wait or idling. I'm surprised nobody has copied this approach since I invented it 10 years ago. I understand why though you need your entire chain to be async and that means rewriting everything and that is a big risk when it's hard to debug.

But if you succeed you can build something that is 10x perf/watt than all other implementations. Which is going to be important when interest rates go higher and crash our entire industry.

The hardware is peaking.

So software is where you can make the difference: http://host.rupy.se

I think we're all confused over the definition. Also one might understand what all the proponents are talking about better if they think about this more as a process and not some technological solution:

https://github.com/tinspin/rupy/wiki/Process

All input I have is you want your code to run on many machines, in fact you want it to run the same on all machines you need to deliver and preferably more. Vertically and horizontally at the same time, so your services only call localhost but in many separate places.

This in turn mandates a distributed database. And later you discover it has to be capable of async-to-async = no blocking ever anywhere in the whole solution.

The way I do this is I hot-deploy my applications async. to all servers in the cluster, this is what a cluster node looks like in practice (the name next to Host: is the node): http://host.rupy.se if you click "api & metrics" you'll see the services.

With this not only do you get scalability, but also redundancy and development is maintained at live coding levels.

I have hosted my own web server both physically and codevise since 2014.

It's on a Raspberry 2 cluster:

http://host.rupy.se

Since 2016 i have my own database also coded from scratch:

http://root.rupy.se

We need to implement HTTP/1.1 with less bloat, a C non-blocking web server that can share memory between threads is probably the most interesting project for humans right now, is anyone working on that?

I have one in Java: https://github.com/tinspin/rupy

Here is the 2000 lines of code of the entire database: http://root.rupy.se/code?path=/Root.java

And here you can try it out: http://root.rupy.se

The smallest PaaS you have ever seen is one order of magnitude larger than mine: https://github.com/tinspin/rupy

And I bet you the same goes for performance, if not two!

The data is here: http://fuse.rupy.se/about.html

Under Performance. Per watt the fuse/rupy platform completely crushes all competition because of 2 reasons:

- Event driven protocol design, averages at about 4 messages/player/second (means you cannot do spraying or headshots f.ex. which is another feature in my game design opinion).

- Java's memory model with atomic concurrency which needs a VM and GC (C++ copied that memory model in C++11, but it failed completely because they lack both VM and GC, but that model is still to this day the one C++ uses), you can read more about this here: https://github.com/tinspin/rupy/wiki

You can argue those points are bad arguments, but if you look at performance per watt with some consideration for developer friendlyness, I'm pretty sure in 100 years we will still be coding minimalist JavaSE on the server and vanilla C (compiled with C++ compiler) on the client.