Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Typos #457

Draft
wants to merge 2 commits into
base: main
Choose a base branch
from
Draft

Typos #457

Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion docs/smart-contracts.mdx
Original file line number Diff line number Diff line change
Expand Up @@ -24,7 +24,7 @@ For example, it is common to create financial instruments like various *tokens*

In most cases, smart contracts remove intermediates and drastically reduce costs compared to classic paper contracts and their validations.

Notice that a smart contract can only run and interact with the blockchain it's stored on. It can't interact with the outside world. That's where *decentralized applications* or "dApps" come in ,because they provide interfaces for the outside world.
Notice that a smart contract can only run and interact with the blockchain it's stored on. It can't interact with the outside world. That's where *decentralized applications* or "dApps" come in, because they provide interfaces for the outside world.

## Components of a smart contract

Expand Down
2 changes: 1 addition & 1 deletion docs/smart-contracts/data-types/complex-data-types.md
Original file line number Diff line number Diff line change
Expand Up @@ -56,7 +56,7 @@ In this layout, both sides of the main pair contain a pair, then both sides of t

Here is an example of a binary tree: `{{-42; "Hello"}; {True; 21}}`

The binary tree layout is be more efficient than a right comb when accessing arbitrary elements.
The binary tree layout is more efficient than a right comb when accessing arbitrary elements.
For example, to access the last element, you can get the second element of the main pair (`{True; 21}`) and the second element of that pair (`21`).
If the tree is balanced, the number of operations to get to any element is
$$O(\log_2 (size))$$, whereas for a right comb, it's $$O(size)$$.
Expand Down
Loading