Overview

This applet displays colorings {0, ..., n-1}^2 that can be used in a protocol that solves the 3-party exactly-N problem in fewer than log N bits.

Operation

Enter a value of N (16, 32, 64, and 128 are valid) and click "Load". Move the mouse pointer over the table to examine the colors of the ordered pairs.