Dec. 13, 2021
Peer-to-Peer Electronic Cash - Abstract
A purely peer-to-peer electronic cash must allow sending online payments directly between the parties and without going through a financial institution. Digital signatures are part of the solution, but the main benefits disappear when a third party is still essential to prevent double-spending. We propose a solution for double-spending by using a peer-to-peer network. The network seals transactions in the time in a continuous proof-of-work chain based on hash, establishing a registry that can not be modified without remaking the proof-of-work.
The longest chain not only serves as an effective way to prove the sequence of events, but it demonstrates that comes from the most powerful CPU set. While most of the CPU power is controlled by the nodes that don't cooperate to attack the own network, the longest chain will be generated and will outmatch the attackers. The network itself needs a minimum structure. The messages are transmitted based on the "best effort" and the nodes can leave the network and return at will accepting the longest proof-of-work chain corresponding to what has happened in their absense.
Peer-to-Peer Electronic Cash - Abstract
A purely peer-to-peer electronic cash system must allow users to sending online payments directly between the parties and, without goinghaving to go through a financial institution.
Your last clause ("[...] and without going ..") was fine, but this fits better with the logic you were going for.
Digital signatures are part of the solution, but the main benefits disappear when a third party is still essential to prevent double-spending.
We propose a solution for double-spending by, which involves using a peer-to-peer network.
The network seals transactions in the time insimultaneously(?) along with a continuous proof-of-work chain, based on hash, establishing a registry that can not be modified without remaking the proof-of-work.
Unfortunately I'm not very knowledgable in the field of computers, so take this correction with a grain of salt. Maybe you could clarify it to me?
The longest chain not only serves as an effective way to prove the sequence of events, but it demonstrates that comes from the most powerful CPU set.
While most of the CPU power is controlled by the nodes that don't cooperate to attack their own network, the longest chain will be generated and will outmatch the attackers.
I also don't really get this sentence, especially the last part. Could you explain a bit? (sorrryyy ;w;)
The network itself needsrequires only a minimum structure.
Matched the formal tone with the rest of the writing.
The messages are transmitted based on the "beleast effort principle(?)" and the nodes can leave the network and return at will accepting the longest proof-of-work chain corresponding to what has happened in their absense.
I'm not sure what exactly you meant by "best effort", but I changed it to what seemed like it here. For confirmation, this is what I corrected it to: https://en.wikipedia.org/wiki/Principle_of_least_effort (Pretty sure this term is also used in computer science, but once again, no idea if it fits ;w;)
Feedback
Very-written, I had barely anything to correct. Well done, it was definitely a challenge for me too, lol
|
Peer-to-Peer Electronic Cash - Abstract This sentence has been marked as perfect! |
|
A purely peer-to-peer electronic cash must allow sending online payments directly between the parties and without going through a financial institution. A purely peer-to-peer electronic cash system must allow users to send Your last clause ("[...] and without going ..") was fine, but this fits better with the logic you were going for. |
|
Digital signatures are part of the solution, but the main benefits disappear when a third party is still essential to prevent double-spending. This sentence has been marked as perfect! |
|
We propose a solution for double-spending by using a peer-to-peer network. We propose a solution for double-spending |
|
The network seals transactions in the time in a continuous proof-of-work chain based on hash, establishing a registry that can not be modified without remaking the proof-of-work. The network seals transactions Unfortunately I'm not very knowledgable in the field of computers, so take this correction with a grain of salt. Maybe you could clarify it to me? |
|
The longest chain not only serves as an effective way to prove the sequence of events, but it demonstrates that comes from the most powerful CPU set. This sentence has been marked as perfect! |
|
While most of the CPU power is controlled by the nodes that don't cooperate to attack the own network, the longest chain will be generated and will outmatch the attackers. While most of the CPU power is controlled by the nodes that don't cooperate to attack their own network, the longest chain will be generated and will outmatch the attackers. I also don't really get this sentence, especially the last part. Could you explain a bit? (sorrryyy ;w;) |
|
The network itself needs a minimum structure. The network itself Matched the formal tone with the rest of the writing. |
|
The messages are transmitted based on the "best effort" and the nodes can leave the network and return at will accepting the longest proof-of-work chain corresponding to what has happened in their absense. The messages are transmitted based on the " I'm not sure what exactly you meant by "best effort", but I changed it to what seemed like it here. For confirmation, this is what I corrected it to: https://en.wikipedia.org/wiki/Principle_of_least_effort (Pretty sure this term is also used in computer science, but once again, no idea if it fits ;w;) |
You need LangCorrect Premium to access this feature.
Go Premium