Quote from: DumbFruit on September 23, 2015, 01:57:36 PM

Quote from: jl777 on September 23, 2015, 01:48:47 PM

Quote from: DumbFruit on September 23, 2015, 12:27:21 PM

Could someone explain how this;

Quote from: Come-from-Beyond on September 22, 2015, 03:31:40 PM

No mining centralization
No block limit drama

is compatible with this;

Quote from: Come-from-Beyond on September 22, 2015, 03:31:40 PM

No hard TPS limit

Thanks..

the total transaction capacity scales with the total number of nodes.

Every "node" could be in the same location, even the same machine.

Quote from: Sergio Demian Lerner

At a certain frequency the software chooses a transaction that references
a high number of parent nodes.

Of course, not every past transaction could be reachable, as users may decide to never reference
certain published transaction. However, the parent selection, with average out-degree 2, and low network
latency, can guarantee that there will be frequent checkpoints referencing almost all previous
transactions.

After a checkpoint is found, the software updates all nodes reachable from the checkpoint with a
forward pointer to this checkpoint. A checkpoint has its own score counter, initially set to zero. When
the update algorithm reaches a checkpoint node, it increments the counter and stops propagating
backward. The score of a transaction is computed as the last stored score in the transaction plus the
score of the pointed checkpoint. Checkpoints are considered as nodes on the DAG, so the same checkpoint
finding algorithm can make checkpoints that refer to other forward checkpoints.

https://bitslog.files.wordpress.com/2015/09/dagcoin-v41.pdf

are you disagreeing with the statement that the more nodes there are (whatever you call them, wherever they are) the more transactions can be processed?

PoW protects from all nodes being in one location