 // static seed
 var seed = [Int](repeating: 0, count: 32)
 for i in 0..<32 {
-	seed[i] = 1 // i * 2
+    seed[i] = 1 // i * 2
 }
 
 // generate key pair

infix operator >>> : BitwiseShiftPrecedence

func getInt32(_ value: Int64) -> Int32 {
	return Int32(truncatingBitPattern: value)
}

func >>> (lhs: Int, rhs: Int) -> Int {
  let l = getInt32(Int64(lhs))
  let r = getInt32(Int64(rhs))  	
  return Int( Int32(bitPattern: UInt32(bitPattern: l) >> UInt32(r)) )
}

func gf() -> [Int64] {
	return gf([0])
}

func gf(_ ai: [Int64]) -> [Int64] {
	var r = [Int64](repeating: 0, count: 16)
	for i in 0..<ai.count {
		r[i] = ai[i]
	}
	return r
}

var _0 = [Int](repeating: 0, count: 16)


print("respuesas: R1=\(res == 1 ? "SI" : "NO") R2=\(res1 == 1 ? "SI" : "NO")")
print("msg2 = \(msg2)" )
    
