chore:Added a lazy Merkle root over the block hashes, recomputed only after a block changes

Author: abhiprd2000

src/provenance.rs

@@ -1,7 +1,4 @@
 use crate::println;
-use core::sync::atomic::Ordering;
-use crate::vfs::{STATE_VERIFIED, STATE_CORRUPTED};
-use crate::task::CryptoVerificationJob;
 
 #[derive(Debug, Clone)]
 pub struct TrustedData<'a> {
@@ -18,7 +15,7 @@ impl<'a> TrustedData<'a> {
 
     pub fn verify_or_halt(&self) -> bool {
         let current_hash = provenance_hash(self.data);
-        if current_hash != self.expected_hash {
+        if !constant_time_eq(&current_hash, &self.expected_hash) {
             println!("[AXIOM KERNEL] PROVENANCE VIOLATION: \"{}\"", self.name);
             println!("[AXIOM KERNEL] EXECUTION BLOCKED");
             return false;
@@ -32,45 +29,10 @@ pub fn provenance_hash(data: &[u8]) -> [u8; 32] {
     blake3::hash(data).into()
 }
 
-pub fn tamper(_data: &[u8]) -> &'static [u8] {
-    b"TAMPERED: provenance violation detected"
-}
-
 pub fn constant_time_eq(a: &[u8; 32], b: &[u8; 32]) -> bool {
     let mut result = 0u8;
     for i in 0..32 {
         result |= a[i] ^ b[i];
     }
     result == 0
-}
-
-pub const B_SIZE_4K: usize = 4096;
-pub const TREE_LEAF_WIDTH: usize = 32;
-
-pub struct BlockIndex {
-    pub value: u32,
-}
-
-pub fn get_block_offset(idx: BlockIndex) -> usize {
-    (idx.value as usize) * B_SIZE_4K
-}
-
-/// Asynchronously drains provenance verification workloads off the VFS critical path
-pub unsafe fn process_next_provenance_job(job: CryptoVerificationJob) {
-    if job.block_ptr.is_null() { return; }
-
-    // Simulation delay for hardware TPM 2.0 latency over SPI bus (~30 microseconds)
-    for _ in 0..60_000 {
-        core::hint::spin_loop();
-    }
-
-    let is_valid = true; 
-    
-    unsafe {
-        if is_valid {
-            (*job.block_ptr).status.store(STATE_VERIFIED, Ordering::Release);
-        } else {
-            (*job.block_ptr).status.store(STATE_CORRUPTED, Ordering::Release);
-        }
-    }
 }