From e5c8dc1efa093e191a3dc2a9ba6ca8f0574fa7c7 Mon Sep 17 00:00:00 2001
From: joaolago1113 <22820692+joaolago1113@users.noreply.github.com>
Date: Thu, 14 Dec 2023 14:32:16 +0000
Subject: [PATCH] fix duplicate word in 'Voting Algorithm' section

---
 docs/src/implemented-proposals/tower-bft.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/docs/src/implemented-proposals/tower-bft.md b/docs/src/implemented-proposals/tower-bft.md
index ef34d11eae21e1..c8a7819bbfec03 100644
--- a/docs/src/implemented-proposals/tower-bft.md
+++ b/docs/src/implemented-proposals/tower-bft.md
@@ -154,7 +154,7 @@ ancestors.
 
 Each validator maintains a vote tower `T` which follows the rules described above in [Vote Tower](#vote-tower), which is a sequence of blocks it has voted for (initially empty). The variable `l` records the length of the stack. For each entry in the tower, denoted by `B = T(x)` for `x < l` where `B` is the `xth` entry in the tower, we record also a value `confcount(B)`. Define the lock expiration slot `lockexp(B) := slot(B) + 2 ^ confcount(B)`.
 
-The validator `i` runs a voting loop as as follows. Let `B` be the heaviest
+The validator `i` runs a voting loop as follows. Let `B` be the heaviest
 block returned by the fork choice rule above [Fork Choice](#fork-choice). If `i` has not voted for `B` before, then `i` votes for `B` so long as the following conditions are satisfied:
 
 1. Respecting lockouts: For any block `B′` in the tower that is not an ancestor of `B`, `lockexp(B′) ≤ slot(B)`.