Abstract: A method of implementing challenges in single-player games starts with a server receiving a challenge from a first mobile device and transmitting the challenge to a second mobile device. The challenge may include a high score or an achievement of a single-player game obtained on the first mobile device. The server may determine that a new high score is obtained on the second mobile device that is equal or greater than the high score included in the challenge or that the achievement is completed on the second mobile device. The server may then transmit a notification to the first mobile device that the challenge has been completed. If the server determines that the new high score is obtained, the notification may include a new challenge from the second mobile device to the first mobile device and the new challenge may include the new high score. Other embodiments are also described.

Abstract: A method of implementing challenges in single-player games starts with a server receiving a challenge from a first mobile device and transmitting the challenge to a second mobile device. The challenge may include a high score or an achievement of a single-player game obtained on the first mobile device. The server may determine that a new high score is obtained on the second mobile device that is equal or greater than the high score included in the challenge or that the achievement is completed on the second mobile device. The server may then transmit a notification to the first mobile device that the challenge has been completed. If the server determines that the new high score is obtained, the notification may include a new challenge from the second mobile device to the first mobile device and the new challenge may include the new high score. Other embodiments are also described.

Abstract: An apparatus, method, and machine-readable medium are described for managing data within a friend service. In one embodiment, a key/value data store can be used to provide an efficient and highly-scalable friend service database. Various techniques can be used to ensure data consistency between friend service data records. For example, in one embodiment, operations are detected which require updates to a plurality of related friend state records. A key may be generated to represent each of the operations and then used to create an entry in a write-ahead log database. In one embodiment, each entry in the write-ahead log database may specify the operation to be performed on the friend state records. If the plurality of friend state records are successfully updated, then the entry in the write-ahead log database may be deleted. However, if the plurality of friend state records are not successfully completed, then the entry is not deleted from the write-ahead log database.

Abstract: An apparatus, method, and machine-readable medium are described for managing data within a friend service. In one embodiment, a key/value data store can be used to provide an efficient and highly-scalable friend service database. Various techniques can be used to ensure data consistency between friend service data records. For example, in one embodiment, operations are detected which require updates to a plurality of related friend state records. A key may be generated to represent each of the operations and then used to create an entry in a write-ahead log database. In one embodiment, each entry in the write-ahead log database may specify the operation to be performed on the friend state records. If the plurality of friend state records are successfully updated, then the entry in the write-ahead log database may be deleted. However, if the plurality of friend state records are not successfully completed, then the entry is not deleted from the write-ahead log database.