Bringing the humanity back to technology. 🫂
Soon™ 🔐
about to land the new metadata table in #nostrdb
https://github.com/damus-io/nostrdb/pull/91
when ingesting notes into the database, it will automatically count:
- direct replies
- thread replies (total number of replies in a thread)
- individual reaction counts
- total reaction counts
- number of quote reposts
- total zap sats
all stored in a compact format in nostrdb that is fast to update.
this should greatly simplify the frontend code in damus android, ios, and notecrumbs. people thought you would need a caching server to have reliable note stats like this, but not anymore! the local relays are getting smarter.
will try to get this into all of our clients asap, thanks for your patience ✌
Absolutely legendary 🙏 this work is under-appreciated.
Scionic Merkle Tree v2.0.0 Release 🎉
• Fixed many verification issues
• Added diff helper functions
• Added parallel dag creation
• Added cleaner create dag with config for all customization options
• Fixed partial dag creation and verification
• Fixed transmission packet creation and verification
• Fixed batched transmission packet creation and verification
• Ensured batched transmission packets support partial dag
BIP-X: Discounting Normal Transactions without a Block Size Increase via Median Fees and Constrained Data Bucket Sizes
https://github.com/HORNET-Storage/bips/blob/master/BIP-X.mediawiki
Usually discounts require the modification of weight parameters, so this median fee mechanism is historic and could be useful in future soft forks—even if the BIP for spam isn’t.
Detecting the median fee trend of a new transaction type to penalize old transaction types can avoid the need to modify weight when issuing discounts during soft forks.
This novel approach is paired with the tightening of every possible data bucket, without breaking basic Lightning and its anchors.
Obrigado amigo! 🐝
BIP-X: Discounting Normal Transactions without a Block Size Increase via Median Fees and Constrained Data Bucket Sizes
https://github.com/HORNET-Storage/bips/blob/master/BIP-X.mediawiki
TL;DR
We detect the median fee size of transactions that qualify for the discount, over the last 2 weeks of time.
Then we multiply that median fee by a little more than 3x to create an economic equilibrium where inscriptions become just as expensive as fragmenting NFTs across thousands of transactions.
Spam unilaterally becomes 3x more expensive than all basic transactions, while preserving enough outputs for Lightning anchors (which Luke has blocked). No OP_Codes are penalized, only bucket sizes—it strives to be timeless… future proof.
“1. Collect all qualifying transactions from blocks [H-2016, H-1]
2. Calculate MEDIAN_FEE = median(qualifying_fee_rates)
3. Required fee for non-qualifying tx ≥ MEDIAN_FEE × 3.14
4. Reject blocks violating this rule”
BIP-X: Discounting Normal Transactions without a Block Size Increase via Median Fees and Constrained Data Bucket Sizes
https://github.com/HORNET-Storage/bips/blob/master/BIP-X.mediawiki
BIP-447: Pruning OP_RETURNs without Breaking Merkle Tree Reverification + Selectively Shrinking Block Space for Transactions Containing Arbitrary Data
Analyze the BIP-447 UASF proposal here: https://github.com/HORNET-Storage/bips/blob/master/bip-0447.mediawiki
testing notifications…
Loading… please wait. ⏳
Still cooking 🍳
Implementing a new design among other safety/infrastructure features.
H.O.R.N.E.T.S Relay is still under repair.
It will be available for all to run as FOSS. The patience is bitter but running the relay will feel sweet. 🐝
