Timeline for What are the best ways to calculate the time for XLM transaction based on the projected growth of the network?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 22, 2018 at 1:21 | history | edited | Jpunsal | CC BY-SA 3.0 |
added 7 characters in body
|
| Jan 19, 2018 at 17:34 | vote | accept | rememberlenny | ||
| Jan 18, 2018 at 21:19 | history | edited | Jpunsal | CC BY-SA 3.0 |
added 107 characters in body
|
| Jan 18, 2018 at 2:48 | comment | added | MonsieurNicolas | Those tests don't seem that realistic but are useful to get an idea of the upper bound - at the end of the day the limits are defined by the hardware and network connectivity that validators are using. If most validators are cheap (and ideally we can keep the bar of entry for validators low), the software has to compensate for it. We had people try to run core on raspberry pi - of course that won't scale to large number of tx/s (but would be extremely cheap), the other extreme is everybody pays big $$ for running in GCP. The good news is that the cost of transactions is not tied to validators | |
| Jan 17, 2018 at 23:54 | review | First posts | |||
| Jan 18, 2018 at 15:01 | |||||
| Jan 17, 2018 at 23:51 | history | answered | Jpunsal | CC BY-SA 3.0 |