Skip to content

Commit 3d0b0c1

Browse files
authored
chore: update Forest entry (#1339)
* chore: update Forest entry * prettier * fix: correct mining phrasing
1 parent 170625e commit 3d0b0c1

File tree

1 file changed

+15
-3
lines changed

1 file changed

+15
-3
lines changed

content/implementations/forest.md

Lines changed: 15 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -10,8 +10,20 @@ implRepos:
1010

1111
# Forest
1212

13-
Forest is an implementation of Filecoin written in Rust. The implementation will take a modular approach to building a full Filecoin node in two parts — (i) building Filecoin’s security critical systems in Rust from the Filecoin Protocol Specification, specifically the virtual machine, blockchain, and node system, and (ii) integrating functional components for storage mining and storage & retrieval markets to compose a fully functional Filecoin node implementation.
13+
Forest is an implementation of Filecoin written in Rust. It focuses on performance and low resource usage. It is compatible with most of the JSON-RPC API exposed by Lotus, making it easy to use with existing tools and libraries.
1414

15-
You can find the Forest codebase [here](https://github.com/ChainSafe/forest) and the documentation site [here](https://chainsafe.github.io/forest/).
15+
Forest does not support all features of the reference implementation but is a good fit for specific applications, such as:
1616

17-
The Forest implementation of Filecoin is supported by [ChainSafe](https://chainsafe.io/).
17+
- generating Filecoin snapshots,
18+
- running a bootstrap node,
19+
- running an RPC node.
20+
21+
Forest does not provide storage provider functionality.
22+
23+
Links:
24+
25+
- [Source code](https://github.com/ChainSafe/forest)
26+
- [Documentation](https://docs.forest.chainsafe.io/)
27+
- [Website](https://forest.chainsafe.io/)
28+
29+
The Forest implementation of Filecoin is maintained by [ChainSafe](https://chainsafe.io/).

0 commit comments

Comments
 (0)