Skip to content

Commit

Permalink
chore(docs): use master link of NEP-539 (#12183)
Browse files Browse the repository at this point in the history
since `NEP-539` was merged, it's time to use master link of `NEP-539` in
the docs to render better reading experience. :)
  • Loading branch information
tinyfoxy authored Oct 2, 2024
1 parent 810e820 commit ef812f9
Showing 1 changed file with 3 additions and 3 deletions.
6 changes: 3 additions & 3 deletions docs/architecture/how/receipt-congestion.md
Original file line number Diff line number Diff line change
Expand Up @@ -48,7 +48,7 @@ For a finite amount of time, we can accept more inflow than outflow, we just hav

Next, we look at ideas one at a time before combining some of them into the
cross-shard congestion design proposed in
[NEP-539](https://github.com/near/NEPs/pull/539).
[NEP-539](https://github.com/near/NEPs/blob/master/neps/nep-0539.md).

## Idea 1: Compute the minimum max-flow and stay below that limit

Expand Down Expand Up @@ -185,7 +185,7 @@ that are not on the critical path.

## Putting it all together

The proposal in [NEP-539](https://github.com/near/NEPs/pull/539) combines all
The proposal in [NEP-539](https://github.com/near/NEPs/blob/master/neps/nep-0539.md) combines all
ideas 2, 3, and 4.

We have a limit of how much memory we consider to be normal operations (for
Expand All @@ -208,4 +208,4 @@ it back cannot lead to a slowed down global throughput.
Another design decision was to linearly interpolate the limits, as opposed to
binary on and off states. This way, we don't have to be too precise in finding
the right parameters, as the system should balance itself around a specific
limit that works for each workload.
limit that works for each workload.

0 comments on commit ef812f9

Please sign in to comment.