home.social

#blockchainscalability — Public Fediverse posts

Live and recent posts from across the Fediverse tagged #blockchainscalability, aggregated by home.social.

  1. Rolland Saf says the future of Web3 will be built on the power of social connections rather than speculative trading. hackernoon.com/uxlink-ceo-roll

  2. Explore how auction mechanisms hold up under collusion, comparing SCP variants and OCA-proofness with concrete counterexamples and bidding strategies. hackernoon.com/why-your-auctio #blockchainscalability

  3. Explore how auction mechanisms hold up under collusion, comparing SCP variants and OCA-proofness with concrete counterexamples and bidding strategies. hackernoon.com/why-your-auctio #blockchainscalability

  4. Explore how auction mechanisms hold up under collusion, comparing SCP variants and OCA-proofness with concrete counterexamples and bidding strategies. hackernoon.com/why-your-auctio #blockchainscalability

  5. Explore how auction mechanisms hold up under collusion, comparing SCP variants and OCA-proofness with concrete counterexamples and bidding strategies. hackernoon.com/why-your-auctio

  6. Explore how auction mechanisms hold up under collusion, comparing SCP variants and OCA-proofness with concrete counterexamples and bidding strategies. hackernoon.com/why-your-auctio #blockchainscalability

  7. Unlocking truth-telling in blockchain bidding rules—Theorem 8.2 proves you can stay truthful without changing outcomes. hackernoon.com/how-bidding-rul #blockchainscalability

  8. Unlocking truth-telling in blockchain bidding rules—Theorem 8.2 proves you can stay truthful without changing outcomes. hackernoon.com/how-bidding-rul #blockchainscalability

  9. Unlocking truth-telling in blockchain bidding rules—Theorem 8.2 proves you can stay truthful without changing outcomes. hackernoon.com/how-bidding-rul #blockchainscalability

  10. Unlocking truth-telling in blockchain bidding rules—Theorem 8.2 proves you can stay truthful without changing outcomes. hackernoon.com/how-bidding-rul

  11. Unlocking truth-telling in blockchain bidding rules—Theorem 8.2 proves you can stay truthful without changing outcomes. hackernoon.com/how-bidding-rul #blockchainscalability

  12. How can blockchain bidding be made honest and collusion-proof? Enter the static revelation principle for transaction fee mechanisms. hackernoon.com/static-revelati #blockchainscalability

  13. How can blockchain bidding be made honest and collusion-proof? Enter the static revelation principle for transaction fee mechanisms. hackernoon.com/static-revelati #blockchainscalability

  14. How can blockchain bidding be made honest and collusion-proof? Enter the static revelation principle for transaction fee mechanisms. hackernoon.com/static-revelati #blockchainscalability

  15. How can blockchain bidding be made honest and collusion-proof? Enter the static revelation principle for transaction fee mechanisms. hackernoon.com/static-revelati

  16. How can blockchain bidding be made honest and collusion-proof? Enter the static revelation principle for transaction fee mechanisms. hackernoon.com/static-revelati #blockchainscalability

  17. How to bypass blockchain mechanism impossibilities using relaxed constraints, cryptography, and clever incentive models. hackernoon.com/how-to-circumve #blockchainscalability

  18. How to bypass blockchain mechanism impossibilities using relaxed constraints, cryptography, and clever incentive models. hackernoon.com/how-to-circumve #blockchainscalability

  19. How to bypass blockchain mechanism impossibilities using relaxed constraints, cryptography, and clever incentive models. hackernoon.com/how-to-circumve #blockchainscalability

  20. How to bypass blockchain mechanism impossibilities using relaxed constraints, cryptography, and clever incentive models. hackernoon.com/how-to-circumve

  21. How to bypass blockchain mechanism impossibilities using relaxed constraints, cryptography, and clever incentive models. hackernoon.com/how-to-circumve #blockchainscalability

  22. A mathematical proof shows why no truthful mechanism can satisfy UIC, MIC, and OCA-proofness simultaneously in transaction fee markets. hackernoon.com/uic-mic-and-oca #blockchainscalability

  23. A mathematical proof shows why no truthful mechanism can satisfy UIC, MIC, and OCA-proofness simultaneously in transaction fee markets. hackernoon.com/uic-mic-and-oca #blockchainscalability

  24. A mathematical proof shows why no truthful mechanism can satisfy UIC, MIC, and OCA-proofness simultaneously in transaction fee markets. hackernoon.com/uic-mic-and-oca #blockchainscalability

  25. A mathematical proof shows why no truthful mechanism can satisfy UIC, MIC, and OCA-proofness simultaneously in transaction fee markets. hackernoon.com/uic-mic-and-oca

  26. A mathematical proof shows why no truthful mechanism can satisfy UIC, MIC, and OCA-proofness simultaneously in transaction fee markets. hackernoon.com/uic-mic-and-oca #blockchainscalability

  27. UIC, MIC, and Global SCP can’t all coexist in finite-block blockchain bidding mechanisms. This article shows why—with formal proofs to back it up. hackernoon.com/the-impossibili #blockchainscalability

  28. UIC, MIC, and Global SCP can’t all coexist in finite-block blockchain bidding mechanisms. This article shows why—with formal proofs to back it up. hackernoon.com/the-impossibili #blockchainscalability

  29. UIC, MIC, and Global SCP can’t all coexist in finite-block blockchain bidding mechanisms. This article shows why—with formal proofs to back it up. hackernoon.com/the-impossibili #blockchainscalability

  30. UIC, MIC, and Global SCP can’t all coexist in finite-block blockchain bidding mechanisms. This article shows why—with formal proofs to back it up. hackernoon.com/the-impossibili

  31. UIC, MIC, and Global SCP can’t all coexist in finite-block blockchain bidding mechanisms. This article shows why—with formal proofs to back it up. hackernoon.com/the-impossibili #blockchainscalability

  32. No blockchain auction mechanism can satisfy UIC, MIC, and global SCP at once—this paper proves why, even with randomness. hackernoon.com/no-blockchain-a #blockchainscalability

  33. No blockchain auction mechanism can satisfy UIC, MIC, and global SCP at once—this paper proves why, even with randomness. hackernoon.com/no-blockchain-a #blockchainscalability

  34. No blockchain auction mechanism can satisfy UIC, MIC, and global SCP at once—this paper proves why, even with randomness. hackernoon.com/no-blockchain-a #blockchainscalability

  35. No blockchain auction mechanism can satisfy UIC, MIC, and global SCP at once—this paper proves why, even with randomness. hackernoon.com/no-blockchain-a

  36. No blockchain auction mechanism can satisfy UIC, MIC, and global SCP at once—this paper proves why, even with randomness. hackernoon.com/no-blockchain-a #blockchainscalability

  37. Explore the mechanics of blockchain transaction fees, miner incentives, fake bids, and how social welfare is calculated in decentralized systems. hackernoon.com/what-is-a-trans #blockchainscalability

  38. Explore the mechanics of blockchain transaction fees, miner incentives, fake bids, and how social welfare is calculated in decentralized systems. hackernoon.com/what-is-a-trans #blockchainscalability

  39. Explore the mechanics of blockchain transaction fees, miner incentives, fake bids, and how social welfare is calculated in decentralized systems. hackernoon.com/what-is-a-trans #blockchainscalability

  40. Explore the mechanics of blockchain transaction fees, miner incentives, fake bids, and how social welfare is calculated in decentralized systems. hackernoon.com/what-is-a-trans

  41. Explore the mechanics of blockchain transaction fees, miner incentives, fake bids, and how social welfare is calculated in decentralized systems. hackernoon.com/what-is-a-trans #blockchainscalability

  42. Your cheat sheet to understanding incentive-compatibility in transaction fee mechanisms—UIC, MIC, SCP, and the limits of truthfulness. hackernoon.com/why-no-transact #blockchainscalability

  43. Your cheat sheet to understanding incentive-compatibility in transaction fee mechanisms—UIC, MIC, SCP, and the limits of truthfulness. hackernoon.com/why-no-transact #blockchainscalability

  44. Your cheat sheet to understanding incentive-compatibility in transaction fee mechanisms—UIC, MIC, SCP, and the limits of truthfulness. hackernoon.com/why-no-transact #blockchainscalability

  45. Your cheat sheet to understanding incentive-compatibility in transaction fee mechanisms—UIC, MIC, SCP, and the limits of truthfulness. hackernoon.com/why-no-transact