diff --git a/README.md b/README.md index 627c6acea0..1593311527 100644 --- a/README.md +++ b/README.md @@ -17,7 +17,7 @@ Firo uses a hybrid PoW and LLMQ Chainlocks system combining fair distribution of # Running with Docker -If you are already familiar with Docker, then running Firo with Docker might be the the easier method for you. To run Firo using this method, first install [Docker](https://store.docker.com/search?type=edition&offering=community). After this you may +If you are already familiar with Docker, then running Firo with Docker might be the easier method for you. To run Firo using this method, first install [Docker](https://store.docker.com/search?type=edition&offering=community). After this you may continue with the following instructions. Please note that we currently don't support the GUI when running with Docker. Therefore, you can only use RPC (via HTTP or the `firo-cli` utility) to interact with Firo via this method. diff --git a/qa/rpc-tests/llmq-signing.py b/qa/rpc-tests/llmq-signing.py index 5ad283443c..3922ea7803 100755 --- a/qa/rpc-tests/llmq-signing.py +++ b/qa/rpc-tests/llmq-signing.py @@ -67,7 +67,7 @@ def assert_sigs_nochange(hasrecsigs, isconflicting1, isconflicting2, timeout): self.mine_quorum() assert_sigs_nochange(True, False, True, 3) - # Mine 2 more quorums, so that the one used for the the recovered sig should become inactive, nothing should change + # Mine 2 more quorums, so that the one used for the recovered sig should become inactive, nothing should change self.mine_quorum() self.mine_quorum() assert_sigs_nochange(True, False, True, 3) diff --git a/src/qt/modaloverlay.cpp b/src/qt/modaloverlay.cpp index 174ec0df80..e7bcfb31d2 100644 --- a/src/qt/modaloverlay.cpp +++ b/src/qt/modaloverlay.cpp @@ -127,7 +127,7 @@ void ModalOverlay::tipUpdate(int count, const QDateTime& blockDate, double nVeri return; // estimate the number of headers left based on nPowTargetSpacing - // and check if the gui is not aware of the the best header (happens rarely) + // and check if the gui is not aware of the best header (happens rarely) int estimateNumHeadersLeft = bestHeaderDate.secsTo(currentDate) / Params().GetConsensus().nPowTargetSpacing; bool hasBestHeader = bestHeaderHeight >= count; diff --git a/src/secp256k1/src/asm/field_10x26_arm.s b/src/secp256k1/src/asm/field_10x26_arm.s index 5df561f2fc..bd2b629e1c 100644 --- a/src/secp256k1/src/asm/field_10x26_arm.s +++ b/src/secp256k1/src/asm/field_10x26_arm.s @@ -11,7 +11,7 @@ Note: - To avoid unnecessary loads and make use of available registers, two 'passes' have every time been interleaved, with the odd passes accumulating c' and d' - which will be added to c and d respectively in the the even passes + which will be added to c and d respectively in the even passes */