ciphercore-base 0.3.1

The base package of CipherCore: computation graphs API, Secure MPC Compiler, utilities for graph evaluation and inspection
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79

use crate::data_types::{Type, UINT64};
use crate::errors::Result;
use crate::graphs::{Graph, Node};
use crate::inline::inline_common::InlineState;
use crate::ops::utils::constant_scalar;

pub(super) fn inline_iterate_empty_state(
    graph: Graph,
    initial_state: Node,
    inputs_node: Node,
    inliner: &mut dyn InlineState,
) -> Result<(Node, Vec<Node>)> {
    let inputs_len = match inputs_node.get_type()? {
        Type::Vector(len, _) => len,
        _ => {
            panic!("Inconsistency with type checker");
        }
    };
    let mut outputs = vec![];
    for i in 0..inputs_len {
        let current_input =
            inputs_node.vector_get(constant_scalar(&inliner.output_graph(), i, UINT64)?)?;
        inliner.assign_input_nodes(
            graph.clone(),
            vec![initial_state.clone(), current_input.clone()],
        )?;
        let result = inliner.recursively_inline_graph(graph.clone())?;
        inliner.unassign_nodes(graph.clone())?;
        outputs.push(result.tuple_get(1)?.clone());
    }
    Ok((initial_state, outputs))
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::graphs::create_context;
    use crate::inline::inline_test_utils::{build_test_data, resolve_tuple_get, MockInlineState};

    #[test]
    fn test_empty_state_iterate() {
        || -> Result<()> {
            let c = create_context()?;
            let (g, initial_state, inputs_node, input_vals) = build_test_data(c.clone(), UINT64)?;
            let mut inliner = MockInlineState {
                fake_graph: g.clone(),
                inputs: vec![],
                inline_graph_calls: vec![],
                returned_nodes: vec![],
            };
            let res = inline_iterate_empty_state(
                g.clone(),
                initial_state.clone(),
                inputs_node.clone(),
                &mut inliner,
            )?;
            assert_eq!(inliner.inputs.len(), 5);
            assert_eq!(inliner.inline_graph_calls.len(), 5);
            assert_eq!(inliner.returned_nodes.len(), 5);
            assert!(initial_state.clone() == inliner.inputs[0][0]);
            for i in 0..input_vals.len() {
                assert!(resolve_tuple_get(res.1[i].clone()) == inliner.returned_nodes[i][1]);
            }
            for i in 1..input_vals.len() {
                // Inlinings should be independent.
                assert!(
                    inliner.returned_nodes[i - 1][0]
                        != resolve_tuple_get(inliner.inputs[i][0].clone())
                );
                assert!(
                    resolve_tuple_get(inliner.inputs[0][0].clone())
                        == resolve_tuple_get(inliner.inputs[i][0].clone())
                );
            }
            Ok(())
        }()
        .unwrap();
    }
}