News for hackers. Stuff that matters.
Re:Double-Entry Bookkeeping as a Directed Graph by inopinatus on Wednesday April 10, 2024 @12:14PM (#39992381)
Computers are astonishingly fast at summing integers.
Re:Double-Entry Bookkeeping as a Directed Graph by epcoa on Wednesday April 10, 2024 @02:25PM (#39994082)
They are not comparably astonishingly fast at retrieving that data.
Re:Double-Entry Bookkeeping as a Directed Graph by inopinatus on Wednesday April 10, 2024 @06:57PM (#39996555)
Accounting data is so compact that the word “comparably” is doing all the heavy lifting in that statement. A large accounting system certainly prefers to have large main memory, but even in the worst case scenario, we read from persistent storage at GB/sec and the processor has no trouble keeping up. You don’t have to get particularly smart to operate a billion-row ledger; only beyond that does it start to be interesting.
Re:Double-Entry Bookkeeping as a Directed Graph by thfuran on Wednesday April 10, 2024 @04:13PM (#39995231)
They're pretty fast, but if everyone writes software that does 10,000x more computation than necessary on that basis, suddenly they're slow.
Re:Double-Entry Bookkeeping as a Directed Graph by inopinatus on Wednesday April 10, 2024 @06:58PM (#39996558)
“If everyone is incompetent, all software will be bad”. Got it, thanks.
Re:Double-Entry Bookkeeping as a Directed Graph by thfuran on Wednesday April 10, 2024 @08:56PM (#39997349)
You were the one advocating for incompetence.
Re:Double-Entry Bookkeeping as a Directed Graph by inopinatus on Wednesday April 10, 2024 @09:47PM (#39997624)
That was not the incredible burn you hoped for, because it kinda suggests a lack of consideration for the practical design of a modern computer, in which memory is tiered in orders of magnitude of time latency from CPU registers on down through on-die caches and so forth, each tier effectively acting as a local cache for the next level. Writes are super expensive and bust cache lines and coherency all the way down to main memory and in many applications touch persistent storage and even introduce network latencies in distributed systems.

By contrast, ALUs are stupendously well optimized for the baseline computational task of adding up integers.

The difference between nanoseconds and milliseconds is vast. It is consequently very often cheaper to recalculate a sum using data already in cache memory than to save it and later fetch it, or (even worse) to read a value precalculated by a neighbouring computer.

Furthermore, the distinction only matters for accounting systems at high scale. For the average small business accounting, it is de minimis: your computer performs more computation when resizing a browser window than it does in recalculating an account balance from scratch.

Re:Double-Entry Bookkeeping as a Directed Graph by thfuran on Thursday April 11, 2024 @08:55AM (#40001583)
You're supposing that the whole transaction history is for some reason already in L1? Sure, in that case the extra burden of crunching some numbers is mostly irrelevant because there's almost no data and you've already paid for it. But you probably shouldn't have.