Merge remote-tracking branch 'origin/main' into emlautarom1/qbft

Author: emlautarom1

.githooks/pre-push

@@ -1,11 +1,6 @@
-#!/bin/sh
-set -e
+#!/usr/bin/env bash
 
-# Dependency sorting
-if ! cargo sort --workspace --check; then
-    echo "❌ Dependencies should be sorted (run 'cargo sort --workspace')"
-    exit 1
-fi
+set -e
 
 # Dependency audit
 if ! cargo deny check; then
@@ -19,12 +14,6 @@ if ! cargo +nightly fmt --all -- --check; then
     exit 3
 fi
 
-# Typo check
-if ! typos; then
-    echo "❌ Spelling mistakes found (run 'typos --write-changes')"
-    exit 4
-fi
-
 # Linting
 if ! cargo clippy --all-targets --all-features -- -D warnings; then
     echo "❌ Clippy violations (check warnings above)"

.github/workflows/linter.yml

@@ -25,6 +25,3 @@ jobs:
 
       - name: Run Clippy
         run: cargo clippy --all-targets --all-features
-
-      - name: Check typos
-        uses: crate-ci/typos@master

CONTRIBUTING.md

@@ -11,9 +11,8 @@ git config commit.gpgsign true
 ## Prerequisites
 
 * [Rust](https://www.rust-lang.org/tools/install)
+* [Protobuf](https://protobuf.dev/installation/)
 * [cargo deny](https://github.com/EmbarkStudios/cargo-deny)
-* [typos](https://github.com/crate-ci/typos?tab=readme-ov-file#install)
-* [cargo sort](https://github.com/DevinR528/cargo-sort)
 
 ## Code quality assurance
 
@@ -49,15 +48,15 @@ Criterion is still recommended for more rigorous statistical analysis, but Divan
 For performance, the profiling cycle is a 3-step process in which you need to first measure the resources consumed by your application, then isolate the most consuming ones, and finally optimize them.
 This cycle repeats until the performance goals are met.
 To carry out this optimization cycle, we recommend the following profiling tools, as they are powerful, general-purpose, and are either written or well integrated with Rust:
-* [Hyperfine](https://crates.io/crates/hyperfine): Provides a simple CLI interface that allows us to benchmark compiled binaries. 
-* [Samply](https://crates.io/crates/samply): Generates a detailed graphic of the different operations and their time in the application. We recommend it over [FlameGraph](https://crates.io/crates/flamegraph) as it allows for filtering, and the webserver viewer provides a better experience than the `.svg` your get from Flamegraph. 
+* [Hyperfine](https://crates.io/crates/hyperfine): Provides a simple CLI interface that allows us to benchmark compiled binaries.
+* [Samply](https://crates.io/crates/samply): Generates a detailed graphic of the different operations and their time in the application. We recommend it over [FlameGraph](https://crates.io/crates/flamegraph) as it allows for filtering, and the webserver viewer provides a better experience than the `.svg` your get from Flamegraph.
 * [Dhat](https://crates.io/crates/dhat): Measures memory allocations within the application.
 
 ### Hyperfine
 
 Once [installed](https://github.com/sharkdp/hyperfine?tab=readme-ov-file#installation), we can simply run:
 ```sh
-hyperfine 'TODO(template) update with your binary e.g. ./target/release/...' 
+hyperfine 'TODO(template) update with your binary e.g. ./target/release/...'
 ```
 ### Samply
 
@@ -84,7 +83,7 @@ Then, we can run:
 ```sh
 samply record 'TODO(template) update with your binary e.g. ./target/release/...'
 ```
-This command will open a browser page that contains a graphic representation of where the time is being spent in our application. 
+This command will open a browser page that contains a graphic representation of where the time is being spent in our application.
 
 ### Dhat
 We can add Dhat as a dependency:
@@ -114,4 +113,4 @@ But these 3 should be enough for the average application to identify bottlenecks
 
 For async-rust we also recommend: [Tracing](https://crates.io/crates/tracing), [Tokio-Console](https://crates.io/crates/tokio-console), and [Oha](https://crates.io/crates/oha).
 For Rayon-based parallel Rust code, we recommend Samply.
-It provides good profiling despite missing some multithreading details.
+It provides good profiling despite missing some multithreading details.