Skip to content
This repository has been archived by the owner on Jun 7, 2023. It is now read-only.

Commit

Permalink
Added link to preview repo
Browse files Browse the repository at this point in the history
  • Loading branch information
Alex6323 committed Oct 3, 2019
1 parent 4c0abe7 commit 409ce0f
Showing 1 changed file with 6 additions and 4 deletions.
10 changes: 6 additions & 4 deletions text/0000-bee-pow/0000-bee-pow.md
Original file line number Diff line number Diff line change
Expand Up @@ -5,7 +5,7 @@

# Summary

This RFC proposes a dedicated crate to perform proof-of-work (PoW) for a single gossip message, that achieves to be accepted and propagated by the network.
This RFC proposes a dedicated crate to perform proof-of-work (PoW) for a single gossip message, that attempts to become accepted and propagated by the network.

# Motivation

Expand Down Expand Up @@ -37,14 +37,16 @@ When I receive a gossip message, I want to be able to verify, that the contained


`IMPORTANT NOTE`
It is important that this crate is independent from the particular hashfunction. Ideally it would not even depend on whether a trinary or a binary hashfunction is used. In both cases a
It is important that this crate is independent from the particular hashfunction. Ideally it would not even depend on whether a trinary or a binary hashfunction is used.

# Detailed design

This is the bulk of the RFC. Explain the design in enough detail for somebody
`This is the bulk of the RFC. Explain the design in enough detail for somebody
familiar with the IOTA and to understand, and for somebody familiar with Rust
to implement. This should get into specifics and corner-cases, and include
examples of how the feature is used.
examples of how the feature is used.`

For a prototype implementation please checkout [bee-pow-preview](https://github.com/Alex6323/bee-pow-preview).

# Drawbacks

Expand Down

0 comments on commit 409ce0f

Please sign in to comment.