Quick Start

use luminair_graph::{graph::LuminairGraph, StwoCompiler};
use luminal::prelude::*;

fn main() -> Result<(), Box<dyn std::error::Error>> {

  // Create a new computational graph.
  let mut cx = Graph::new();

  // Define three 2x2 tensors with sample data.
  // In a real-world scenario, these could be input features, weights, etc.
  let a = cx.tensor((2, 2)).set(vec![1.0, 2.0, 3.0, 4.0]);
  let b = cx.tensor((2, 2)).set(vec![10.0, 20.0, 30.0, 40.0]);
  let w = cx.tensor((2, 2)).set(vec![-1.0, -1.0, -1.0, -1.0]);

  // Define computation operations on tensors:
  let c = a * b;       // Element-wise multiplication
  let d = c + w;       // Element-wise addition
  let mut e = (c * d).retrieve(); // Final operation
}

fn main() -> Result<(), Box<dyn std::error::Error>> {
  // Previous code ..

  // Compile the computation graph to transform the operations and prepare for execution.
  cx.compile(<(GenericCompiler, StwoCompiler)>::default(), &mut e);
}

fn main() -> Result<(), Box<dyn std::error::Error>> {
  // Previous code ..

  // Execute and generate a trace of the computation graph.
  // This is when the actual computation happens.
  let trace = cx.gen_trace();

  // Display the final result.
  println!("Final result: {:?}", e);
}

fn main() -> Result<(), Box<dyn std::error::Error>> {
  // Previous code ..

  // Generate a C-STARK proof for the execution trace.
  let proof = cx.prove(trace)?;

  // Verify the generated proof to ensure the integrity of the computation.
  cx.verify(proof)?;

  println!("Proof verified successfully. Computation integrity ensured. 🎉");
}