coosld/tig-monorepo
1
0
Fork 0
mirror of https://github.com/tig-foundation/tig-monorepo.git synced 2026-02-21 10:27:49 +08:00
Code Issues Actions 1 Packages Projects Releases Wiki Activity

Update get_benchmark_data.

Browse Source
This commit is contained in:
FiveMovesAhead 2025-08-12 14:50:18 +01:00
parent 34131bdf42
commit ab0a74400f
2 changed files with 49 additions and 19 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
tig-protocol/src/context.rs
View File

@ -14,7 +14,11 @@ pub trait Context {
async fn get_benchmark_data(
&self,
benchmark_id: &String,
) -> Option<(HashSet<u64>, HashSet<u64>)>;
) -> Option<(
Option<HashSet<u64>>,
Option<HashSet<u64>>,
Option<HashSet<u64>>,
)>;
async fn add_benchmark_to_mempool(
&self,
benchmark_id: String,

62
tig-protocol/src/contracts/benchmarks.rs
View File

@ -1,6 +1,5 @@
use crate::context::*;
use anyhow::{anyhow, Result};
use core::num;
use logging_timer::time;
use rand::{rngs::StdRng, seq::IteratorRandom, Rng, SeedableRng};
use std::collections::HashSet;
@ -245,8 +244,21 @@ pub async fn submit_proof<T: Context>(
.get_benchmark_details(&benchmark_id)
.await
.ok_or_else(|| anyhow!("Benchmark needs to be submitted first."))?;
let (solution_nonces, discarded_solution_nonces) =
let (solution_nonces, discarded_solution_nonces, non_solution_nonces) =
ctx.get_benchmark_data(&benchmark_id).await.unwrap();
// expect that exactly 2 sets of nonces are provided
let mut nonces_sets = vec![
&solution_nonces,
&discarded_solution_nonces,
&non_solution_nonces,
];
nonces_sets.sort_by_key(|x| x.is_none());
let set_x = nonces_sets[0]
.as_ref()
.unwrap()
.union(nonces_sets[1].as_ref().unwrap())
.cloned()
.collect::<HashSet<u64>>();
// check player owns benchmark
let settings = ctx.get_precommit_settings(&benchmark_id).await.unwrap();
@ -280,8 +292,9 @@ pub async fn submit_proof<T: Context>(
.ok_or_else(|| anyhow!("Block too old"))?;
// use reliability to adjust hash threshold
let solution_ratio =
(solution_nonces.len() + discarded_solution_nonces.len()) as f64 / num_nonces as f64;
let solution_ratio = (benchmark_details.num_solutions
+ benchmark_details.num_discarded_solutions) as f64
/ num_nonces as f64;
let reliability = if average_solution_ratio == 0.0 {
1.0
} else if solution_ratio == 0.0 {
@ -312,20 +325,33 @@ pub async fn submit_proof<T: Context>(
}
let output_meta_data = OutputMetaData::from(merkle_proof.leaf.clone());
let hash = MerkleHash::from(output_meta_data);
if solution_nonces.contains(&merkle_proof.leaf.nonce) && hash.0 > hash_threshold.0 {
verification_result = Err(anyhow!(
"Invalid merkle hash for solution @ nonce {} does not meet threshold",
merkle_proof.leaf.nonce
));
break;
} else if discarded_solution_nonces.contains(&merkle_proof.leaf.nonce)
&& hash.0 <= hash_threshold.0
{
verification_result = Err(anyhow!(
"Invalid merkle hash for discarded solution @ nonce {} meets threshold",
merkle_proof.leaf.nonce
));
break;
if hash.0 > hash_threshold.0 {
// if nonce is a solution, it must be below hash_threshold
if solution_nonces
.as_ref()
.is_some_and(|x| x.contains(&merkle_proof.leaf.nonce))
|| (solution_nonces.is_none() && !set_x.contains(&merkle_proof.leaf.nonce))
{
verification_result = Err(anyhow!(
"Invalid merkle hash for solution @ nonce {} does not meet threshold",
merkle_proof.leaf.nonce
));
break;
}
} else {
// if nonce is a discarded solution, it must be above hash_threshold
if discarded_solution_nonces
.as_ref()
.is_some_and(|x| x.contains(&merkle_proof.leaf.nonce))
|| (discarded_solution_nonces.is_none()
&& !set_x.contains(&merkle_proof.leaf.nonce))
{
verification_result = Err(anyhow!(
"Invalid merkle hash for discarded solution @ nonce {} meets threshold",
merkle_proof.leaf.nonce
));
break;
}
}
let result = merkle_proof
.branch