Kaspa (KAS) Hits All-Time High, Mantle (MNT) Whales Move to Rollblock (RBLK) for Lucrative Opportunities

Aug 3, 2024 |

Kaspa’s (KAS) blockDAG technology makes it a stand out option for Proof of Work fans who also want high transaction speeds. This advantage has allowed Kaspa’s price to soar in 2024. Meanwhile, investors are dumping Layer 2 blockchain solutions like Mantle (MNT) for massive earning potential in GambleFi, with top altcoin Rollblock on course for […]
The post Kaspa (KAS) Breaks ATH,…

read more

Kaspa Surges with Double-Digit Weekly Gains: Can It Sustain Momentum Against Rollblock’s 75% Yearly Rise, Outpacing Ethereum?

Aug 2, 2024 |

While crypto’s such as Kaspa and Bitcoin are great investment opportunities today, they will most likely fail to provide these explosive returns. On the other hand, Rollblock looks set to net new investors today with exponential returns. As a leading play-to-earn GambleFi token, Rollblock seamlessly blends centralized and decentralized gaming experiences on its iGaming platform. […]
The post Kaspa On The Up…

read more

Analyst Forecasts Kaspa (KAS) Price to Reach $0.3, With a Caveat

Aug 2, 2024 |

Crypto analyst Nebraskangooner talks about the price direction of Kaspa, noting that it is expected to test key resistance today. The analyst sees the possibility of a KAS price top at the resistance because of the general market sentiment. Many cryptos have been in a downtrend following the price path of Bitcoin and Ethereum.  Read […]
The post Expert Predicts Kaspa (KAS)…

read more

Michael Sutton On X: Essentially the key is a tuple of feerate and tx id. Feerate is fee/mass which is what miners will optimize for (higher fee for less mass, where mass=block space). The sampling weight is actually feerate^3 in order to create sufficient bias to higher feerates. The tree has the…— Michael Sutton August 2, 2024

Aug 2, 2024 |

Essentially the key is a tuple of feerate and tx id. Feerate is fee/mass which is what miners will optimize for (higher fee for less mass, where mass=block space). The sampling weight is actually feerate^3 in order to create sufficient bias to higher feerates. The tree has the…— Michael Sutton (@MichaelSuttonIL) August 2, 2024

read more

Michael Sutton On X: Of course, this tree structure can be updated in log n time when txs are added or removed (by updating the weight of each subtree along the path from the tree root to the changing leaf). This gives us the perfect balance between maintaining the data structure on mempool updates…— Michael Sutton August 2, 2024

Aug 2, 2024 |

Of course, this tree structure can be updated in log n time when txs are added or removed (by updating the weight of each subtree along the path from the tree root to the changing leaf). This gives us the perfect balance between maintaining the data structure on mempool updates…— Michael Sutton (@MichaelSuttonIL) August 2, 2024

read more

Michael Sutton On X: “I think a tailored tree implementation of our own can be more efficient but it was very cool finding this well-designed library that is flexible enough to allow implementing this search algorithm”— Michael Sutton August 2, 2024

Aug 2, 2024 |

I think a tailored tree implementation of our own can be more efficient but it was very cool finding this well-designed library that is flexible enough to allow implementing this search algorithm— Michael Sutton (@MichaelSuttonIL) August 2, 2024

read more

Michael Sutton On X: What’s the solution? That’s for another day and probably for a different medium. I’ll just add that the same underlying data structure is also helpful for fee estimation API requirements, hence the relevance now— Michael Sutton August 2, 2024

Aug 2, 2024 |

What’s the solution? That’s for another day and probably for a different medium. I’ll just add that the same underlying data structure is also helpful for fee estimation API requirements, hence the relevance now— Michael Sutton (@MichaelSuttonIL) August 2, 2024

read more

Michael Sutton On X: but weighted sampling on an ever changing mempool seemed to require O(n) runtime complexity for each block template. Up until now we made compromises either on performance or on sampling accuracy, but now we got a win in both realms 👇 pic.twitter.com/Pb6MHDxtGB— August 2, 2024

Aug 2, 2024 |

Michael Sutton On X: but weighted sampling on an ever changing mempool seemed to require O(n) runtime complexity for each block template. Up until now we made compromises either on performance or on sampling accuracy, but now we got a win in both realms 👇 pic.twitter.com/Pb6MHDxtGB— August 2, 2024

but weighted sampling on an ever changing mempool seemed to require O(n) runtime complexity for each block template. Up until now we made compromises either on performance or on sampling accuracy, but now we got a win in both realms 👇 pic.twitter.com/Pb6MHDxtGB— Michael Sutton (@MichaelSuttonIL) August 2, 2024

read more

Michael Sutton On X: “The challenge is related to frequent sampling of k (~300) transactions out of n (1 million on a full mempool), in order to compose block templates. Kaspa’s high BPS implies that miners must use probabilistic weighted sampling in order to reduce collisions while maximizing fees.” — Michael Sutton, August 2, 2024

Aug 2, 2024 |

The challenge is related to frequent sampling of k (~300) transactions out of n (1 million on a full mempool), in order to compose block templates. Kaspa’s high BPS implies that miners must use probabilistic weighted sampling in order to reduce collisions while maximizing fees,— Michael Sutton (@MichaelSuttonIL) August 2, 2024

read more