53414ae105
* use 0-based positions in methods pmmr_leaf_to_insertion_index and bintree_postorder_height; add round_up_to_leaf_pos method
* use 0-based positions in method insertion_to_pmmr_index
* use 0-based positions in method is_leaf
* use 0-based positions in method family()
* use 0-based positions in method is_left_sibling
* use 0-based positions in method family_branch
* use 0-based positions in methods bintree_{left,right}most
* use 0-based positions in method bintree_pos_iter
* use 0-based positions in method bintree_range
* use 0-based positions in method bintree_leaf_pos_iter
* rename last_pos in MMR related structs to size
* use 0-based positions in method prune
* use 0-based positions in method push and apply_output return value
* use 0-based position argument of method merkle_proof
* use 0-based outputs in method pmmr::peaks
* fix peaks() code comments
* refix peaks() code comments
* use 0-based positions in method get_peak_from_file
* use 0-based positions in methods get_data_from_file
* use 0-based positions in methods get_from_file
* use 0-based positions in methods get_data
* use 0-based positions in methods get_hash
* use 0-based positions in method peak_path
* use 0-based positions in method bag_the_rhs
* use 0-based positions in method Backend::remove
* use 0-based positions in method leaf_pos_iter
* use 0-based positions in method self.LeafSet::includes
* use 0-based positions in methods self.LeafSet::{add,remove}
* use 0-based positions in methods is_pruned,is_pruned_root,is_compacted
* use 0-based positions in methods PruneList::append
* use 0-based positions in methods append_pruned_subtree
* use 0-based positions in method calculate_next_leaf_shift
* use 0-based positions in method append_single
* use 0-based positions in method calculate_next_shift
* use 0-based positions in method segment_pos_range
* use 0-based positions in method reconstruct_root
* use 0-based positions in method validate_with
* use 0-based positions in method validate
* rename size (formerly last_pos) to mmr_size
* use 0-based positions in Segment's hash_pos and leaf_pos
* minimize use of saturating_sub(1) and rename some pos/idx to size
* use 0-based positions in methods get_output_pos
* use 0-based positions in method get_unspent_output_at
* use 0-based positions in method get_header_hash
* use 0-based positions in methods MerkleProof::verify{,_consume}
* use 0-based positions in method cleanup_subtree
* don't allow 0 in prunelist bitmap
* use 0-based positions in methods get_{,leaf_}shift
* rename some 1-based pos to pos1; identify TODO
* Address yeastplume's PR review comments
|
||
|---|---|---|
| .cargo | ||
| .ci | ||
| .github | ||
| .hooks | ||
| api | ||
| chain | ||
| config | ||
| core | ||
| doc | ||
| etc | ||
| keychain | ||
| p2p | ||
| pool | ||
| servers | ||
| src | ||
| store | ||
| util | ||
| .editorconfig | ||
| .gitignore | ||
| azure-pipelines.yml | ||
| Cargo.lock | ||
| Cargo.toml | ||
| CODE_OF_CONDUCT.md | ||
| CONTRIBUTING.md | ||
| LICENSE | ||
| README.md | ||
| rustfmt.toml | ||
| SECURITY.md | ||
Grin
Grin is an in-progress implementation of the Mimblewimble protocol. Many characteristics are still undefined but the following constitutes a first set of choices:
- Clean and minimal implementation, and aiming to stay as such.
- Follows the Mimblewimble protocol, which provides hidden amounts and scaling advantages.
- Cuckoo Cycle proof of work in two variants named Cuckaroo (ASIC-resistant) and Cuckatoo (ASIC-targeted).
- Relatively fast block time: one minute.
- Fixed block reward over time with a decreasing dilution.
- Transaction fees are based on the number of Outputs created/destroyed and total transaction size.
- Smooth curve for difficulty adjustments.
To learn more, read our introduction to Mimblewimble and Grin.
Status
Grin is live with mainnet. Still, much is left to be done and contributions are welcome (see below). Check our mailing list archives for the latest status.
Contributing
To get involved, read our contributing docs.
Find us:
- Chat: Keybase, more instructions on how to join here.
- Mailing list: join the ~Mimblewimble team and subscribe on Launchpad.
- Twitter for the Grin council: @grincouncil
Getting Started
To learn more about the technology, read our introduction.
To build and try out Grin, see the build docs.
Philosophy
Grin likes itself small and easy on the eyes. It wants to be inclusive and welcoming for all walks of life, without judgement. Grin is terribly ambitious, but not at the detriment of others, rather to further us all. It may have strong opinions to stay in line with its objectives, which doesn't mean disrespect of others' ideas.
We believe in pull requests, data and scientific research. We do not believe in unfounded beliefs.
Credits
Tom Elvis Jedusor for the first formulation of Mimblewimble.
Andrew Poelstra for his related work and improvements.
John Tromp for the Cuckoo Cycle proof of work.
License
Apache License v2.0.