<s>
The	O
lockstep	B-Protocol
protocol	I-Protocol
is	O
a	O
partial	O
solution	O
to	O
the	O
look-ahead	O
cheating	O
problem	O
in	O
peer-to-peer	O
architecture	O
multiplayer	O
games	O
,	O
in	O
which	O
a	O
cheating	O
client	O
delays	O
their	O
own	O
actions	O
to	O
await	O
the	O
messages	O
of	O
other	O
players	O
.	O
</s>
<s>
To	O
avoid	O
this	O
method	O
of	O
cheating	O
,	O
the	O
lockstep	B-Protocol
protocol	I-Protocol
requires	O
each	O
player	O
to	O
first	O
announce	O
a	O
"	O
commitment	O
"	O
(	O
e.g.	O
</s>
<s>
hash	B-Algorithm
value	O
of	O
the	O
action	O
)	O
;	O
this	O
commitment	O
is	O
a	O
representation	O
of	O
an	O
action	O
that	O
:	O
</s>
<s>
To	O
overcome	O
the	O
obvious	O
drawback	O
of	O
the	O
simple	O
lockstep	B-Protocol
protocol	I-Protocol
,	O
an	O
asynchronous	O
variant	O
of	O
the	O
protocol	O
exists	O
wherein	O
players	O
advance	O
in	O
time	O
free	O
of	O
any	O
negotiations	O
with	O
other	O
players	O
until	O
interaction	O
between	O
players	O
exists	O
,	O
known	O
as	O
a	O
"	O
lockstep	O
mode.	O
"	O
</s>
