HNHacker News
TopNewBestAskShowJobs

twokei

66 karma · joined July 1, 2018

submissionscomments
twokei··on Ask HN: How much would you pay for an extremely scalable, resilient database?
Why wouldn't there be failures only under a complete network partition? So long as one node in one partition may communicate with another node in another partition, then writes may still be performed.

Availability would be what is sacrificed in the advent that a node is partitioned away from the main network.

twokei··on Ask HN: How much would you pay for an extremely scalable, resilient database?
Yep! Just to clarify, this is entirely hypothetical! I want to know the value-add people would put on such a database if it were to exist.

There's little insight from what I've seen in the database market as to what people really want the most out of a database, or what makes a database "appealing" to people apart from its reputation from being time-tested.

twokei··on Ask HN: How much would you pay for an extremely scalable, resilient database?
Gotcha! Makes sense to me :). What price tag would you put on this software?

There's been a pretty interesting development from what I've seen on annual licensing fees for enterprise features, with the code open-sourced.

twokei··on Ask HN: How much would you pay for an extremely scalable, resilient database?
It would be possible if say for example, the database was fully replicated in a masterless fashion.

The tradeoff is slower writes (there are ways to make it so that the more nodes you replicate across, write latency won't be affected!).

Reads will scale linearly for the more nodes you replicate across.

So, the novelty in some sense is fast replication of data in a masterless fashion (without any leader such as, for example in Raft or Paxos).

If this protocol was surprisingly simple (which dumbs down the complexity of the software significantly), would you pay for this sort of database?

twokei··on Why Proof-of-Work Does Not Scale
The difficulty adjustment algorithm for Bitcoin is unfortunately very naive - there is a reason blockchain timestamps have a 2 hour deviation.

For some data, look into orphan blocks: https://www.blockchain.com/btc/orphaned-blocks

twokei··on Why Proof-of-Work Does Not Scale
A fork could be created just by taking the existing longest chain, and attempting to append a block to the frontiers blocks parent, or even to the frontier block itself. It's pretty simple. The time between blocks still is non-deterministic, and not often is there realistically a clear winner.

There existing n forks, even at a bare minimum of 3 forks of the same height is very common, especially if you consider how many miners there are in the entirety of the Bitcoin network.

twokei··on LF: Fully Decentralized Fully Replicated Key/Value Store
Interesting - would love your thoughts, why is it that DAGs aren't very scalable?
twokei··on Show HN: Noise – An opinionated, decentralized P2P networking stack in Go
Unfortunately not, but thanks for the tidbit on Noise (the crypto protocol).

We're open to integrating with best practices in a manner that makes the library more secure, and everyone happy.

twokei··on Perlin: Resource attestation for a trustless cloud made up of idle devices [pdf]
Halfway through the paper, it describes a new approach to creating trustless, decentralized cloud computing markets via. cryptographic resource attestation.

To simplify it out, the resource attestation model allows one to bind a virtual currency to some amount of computational time and resources.

It allows users to securely rent away their smart devices when they're idle to developers, researchers, startups, and enterprises who really need large amounts of compute power for cheap prices.