balsoft/ligo
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

fix typos in the doc

Browse Source
This commit is contained in:
Philippe Bidinger 2018-09-24 09:46:38 +02:00 committed by Grégoire Henry
parent d93d2a9b65
commit 66e78f4811
No known key found for this signature in database
GPG Key ID: 50D984F20BD445D2
4 changed files with 10 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
docs/introduction/howtorun.rst
View File

@ -26,7 +26,7 @@ without code, so it is still necessary to pay for its small storage
:: ::
tezos-client originate account alice_del for alice \ tezos-client originate account alice_del for alice \
transfering 1000 from alice \ transferring 1000 from alice \
--delegate bob --delegate bob
As done before, we originate a contract *alice_del* with manager As done before, we originate a contract *alice_del* with manager
@ -47,7 +47,7 @@ Running a delegate
------------------ ------------------
A delegate is responsible for baking blocks, endorsing blocks and A delegate is responsible for baking blocks, endorsing blocks and
accusing other delegates in case their try to double bake or double accusing other delegates in case they try to double bake or double
endorse. endorse.
In the network, rights for baking and endorsing are randomly assigned In the network, rights for baking and endorsing are randomly assigned
@ -127,7 +127,7 @@ We can compute this maximum using the inverse of Cumulative
Distribution Function of the Binomial where `most cases` is a value of Distribution Function of the Binomial where `most cases` is a value of
confidence that we can put to 95%. confidence that we can put to 95%.
There a simple `Python There a simple `Python
script<https://gitlab.com/paracetamolo/utils/blob/master/estimated-rights.py>`_ script <https://gitlab.com/paracetamolo/utils/blob/master/estimated-rights.py>`_
that does the computation for us and returns the deposits and rewards, that does the computation for us and returns the deposits and rewards,
expected and maximum, for a cycle and for `preserved_cycles`. expected and maximum, for a cycle and for `preserved_cycles`.

10
docs/introduction/howtouse.rst
View File

@ -113,8 +113,8 @@ RPC interface
The only interface to the node is through Json RPC calls and it is disabled by The only interface to the node is through Json RPC calls and it is disabled by
default. A more detailed documentation can be found in the :ref:`RPC index. default. A more detailed documentation can be found in the :ref:`RPC index.
<rpc>` The RPC interface must be enable in order for the clients <rpc>` The RPC interface must be enabled in order for the clients
to communicate with the node, but is should not be publically accessible on the to communicate with the node, but is should not be publicly accessible on the
internet. With the following command it is available uniquely on the internet. With the following command it is available uniquely on the
`localhost` address of your machine, on the default port ``8732``. `localhost` address of your machine, on the default port ``8732``.
@ -278,7 +278,7 @@ signed by that account and enforces some good intuitive properties:
and *n+1*, and *n* gets lost then *n+1* cannot be applied. and *n+1*, and *n* gets lost then *n+1* cannot be applied.
Additionally each operation needs to declare a gas and storage limit, Additionally each operation needs to declare a gas and storage limit,
if an operations consumes more than this limits it will fail. if an operation consumes more than these limits it will fail.
Later we'll learn more about the gas and storage model. Later we'll learn more about the gas and storage model.
Another interesting field of the receipts are the `balance updates` Another interesting field of the receipts are the `balance updates`
@ -347,10 +347,10 @@ Gas and storage cost model
A quick look at the balance updates on the receipt shows that on top of A quick look at the balance updates on the receipt shows that on top of
funding the contract with 1ꜩ, *alice* was also charged an extra cost funding the contract with 1ꜩ, *alice* was also charged an extra cost
that is burnt. that is burnt.
This cost comes from the *storage* and it's shown in the line This cost comes from the *storage* and is shown in the line
``Paid storage size diff: 46 bytes``, 41 for the contract and 5 for ``Paid storage size diff: 46 bytes``, 41 for the contract and 5 for
the string ``"hello"``. the string ``"hello"``.
Given that a contract saves it's data on the public block-chain that Given that a contract saves its data on the public block-chain that
every node stores, it is necessary to charge a fee per byte to avoid every node stores, it is necessary to charge a fee per byte to avoid
abuse and encourage lean programs. abuse and encourage lean programs.

2
docs/tutorials/rpc.rst
View File

@ -59,7 +59,7 @@ block and contract, you can call the associated RPC via the command :
``$ tezos-admin-client rpc get ``$ tezos-admin-client rpc get
/blocks/<block_id>/proto/context/contracts/<contract_id>/balance``. /blocks/<block_id>/proto/context/contracts/<contract_id>/balance``.
A RPC may take an *input* and generates an *output* both in JSON An RPC may take an *input* and generate an *output* both in JSON
format. For example, the previous RPC call, that does not require an format. For example, the previous RPC call, that does not require an
input, would display on the standard output : ``{ "balance": input, would display on the standard output : ``{ "balance":
"4000000000000" }``. When calling a RPC that requires an input "4000000000000" }``. When calling a RPC that requires an input

2
docs/whitedoc/michelson.rst
View File

@ -3070,7 +3070,7 @@ The language is implemented in OCaml as follows:
respects the pre and post stack types declared by the GADT case for respects the pre and post stack types declared by the GADT case for
each instruction. each instruction.
The only things that remain to we reviewed are value dependent The only things that remain to be reviewed are value dependent
choices, such as that we did not swap true and false when choices, such as that we did not swap true and false when
interpreting the If instruction. interpreting the If instruction.