Skip to main content

Thank you for visiting You are using a browser version with limited support for CSS. To obtain the best experience, we recommend you use a more up to date browser (or turn off compatibility mode in Internet Explorer). In the meantime, to ensure continued support, we are displaying the site without styles and JavaScript.


Proof at a roll of the dice

The PCP theorem encapsulates the idea that randomization allows the immediate verification of any mathematical proof. A simple route to this striking result was proposed earlier this year.

This is a preview of subscription content

Access options

Rent or Buy article

Get time limited or full article access on ReadCube.


All prices are NET prices.

Figure 1: Probabilistically checkable colouring.


  1. 1

    Arora, S. & Safra, S. J. Assoc. Comput. Machin. 45, 70–122 (1998).

    Article  Google Scholar 

  2. 2

    Arora, S., Lund, C., Motwani, R., Sudan, M. & Szegedy, M. J. Assoc. Comput. Machin. 45, 501–555 (1998).

    Article  Google Scholar 

  3. 3

    Dinur, I. Proc. 38th Annu. ACM Symp. Theor. Comput. 241–250 (2006).

  4. 4

    Håstad, J. J. Assoc. Comput. Machin. 48, 798–859 (2001).

    Article  Google Scholar 

  5. 5

    Appel, K., Haken, W. & Koch, J. J. Math. 21, 439–567 (1977).

    Google Scholar 

Download references

Author information



Rights and permissions

Reprints and Permissions

About this article

Cite this article

Chazelle, B. Proof at a roll of the dice. Nature 444, 1018–1019 (2006).

Download citation


Quick links