Changes

Jump to: navigation, search

GPU610/Team AGC

372 bytes added, 03:06, 31 October 2014
xor_me
At first it seems impossible to do because of the data dependencies: hash, r[1], t[1], and o. But after doing some research, I have learned that the XOR operation is communicative and associative, meaning that we can simply calculate all of the dependencies in parallel first, then combine the results to achieve the same data.
Here is a non-formal proof to help make my point clear. The ability to achieve the same result vertically and horizontally will be the key to solving this task.
<pre>
Step 1:
 
101 ^ 001 ^ 111 = 001
111 ^ 100 ^ 001 = 010
100 ^ 010 ^ 001 = 111
|| || ||
110 111 111
 
Step 2: Operate with vertical and horizontal
 
001 ^ 010 ^ 111 = 110
110 ^ 111 ^ 111 = 110
</pre>
=== Assignment 3 ===

Navigation menu