diff --git a/notes.txt b/notes.txt
index 6cc6d6f0f..ab8f88381 100644
--- a/notes.txt
+++ b/notes.txt
@@ -58,6 +58,9 @@ Algorithm version one:
 This version doesn't take into accound the threshold (doesn't try and insert)
 the same CE into multiple different clocks, it also doesn't do any pre SAT simulation
 optimization. Fruthermore, it also doesn't try and find the minimal set, just a set.
+Lastly, this also does a form of safe clock gating which means that:
+	input_set == 0 -> D == Q 
+Which means there's cases when input_set may be 1 but D != Q
 
 // determines if the input set serves as an enable
 input_set_is_en(input_set, D, Q):
@@ -153,4 +156,8 @@ Exit a set of inputs such that COI <-> D != Q
 
 The final equation for the UNSAT is:
 	((D != Q) != (COI)) -> UNSAT => COI = (D != Q)
-	Exists COI such that ((D ^ Q) ^ (COI)) -> UNSAT
\ No newline at end of file
+	Exists COI such that ((D ^ Q) ^ (COI)) -> UNSAT
+
+
+So in the new pseudo code algorithm, once the pool<SigBit> is populated (the input_set),
+we create this miter with the exestential quantization with the input_set.