timbowhite
Joined 15 years ago
Joined 15 years ago
The issue I'm facing is a very large table, that is both write and read heavy, and the reads do not fall into a specific range of values for any particular column, so I don't think partitioning is an option.
And every transaction completely spends the source keypairs' funds.
So the only attack vector a quantum computer could use is:
1. Observing newly broadcast/unconfirmed transactions
2. Deriving the private key(s) from the public key(s)
3. Creating and broadcasting its own transaction using the stolen keypairs before the original transaction confirms (presumably with a higher fee to win the confirmation race).
Please correct me if I'm wrong.
EDIT: correction: every transaction completely spends any selected UTXO of an associated keypair, not all of the "source keypairs' funds". Thus the attack vector also includes being able to steal from any keypair that has ever made a transaction and also has UTXOs.
Thank you!
> In 2025 I made $10 from open source
Slightly off-topic, but I wish more OSS projects and maintainers would advertise cryptocurrency donation addresses. It's probably the easiest way for end users to donate.
https://github.com/sraoss/pg_ivm
Though I don't know how well it works on a write-heavy production db.
How would the multiplier DCA act during a multi-month "crypto winter"?
BTCPay Server[0] seems to be the most popular way to accept crypto payments on self-hosted hardware with no third party processors.
[0] https://czds.icann.org/home
EDIT: is your site a clone or resell of zonefiles.io? Even the favicon is the same
It has integrated BIN inventories from Afternic, Sedo, Namecheap, Porkbun, and Gname.
Currently working on custom price alerts and an API.
It seems that liberals dislike Teslas because they dislike Elon Musk.
And conservatives dislike Teslas because they dislike new and different things.
https://pi.dev/packages?type=extension