Block #560,334

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/24/2014, 6:26:06 PM · Difficulty 10.9650 · 6,266,334 confirmations

1CC
Cunningham Chain of the First Kind

A sequence where each prime is double the previous prime plus one.

Block Header
Block Hash
7f13585ca172e0db320f9ae9cde65f340de8d93078b4356ce47b153d1090871e

Height

#560,334

Difficulty

10.965044

Transactions

6

Size

14.46 KB

Version

2

Bits

0af70d20

Nonce

473,777,658

Timestamp

5/24/2014, 6:26:06 PM

Confirmations

6,266,334

Merkle Root

35825255a36e052b28c35d4da6356ac3416c70f03362b743a203d020a6f74d3c
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

1.296 × 10⁹⁷(98-digit number)
12960659442407301170…58610986451628046639
Discovered Prime Numbers
p_k = 2^k × origin − 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin − 1
1.296 × 10⁹⁷(98-digit number)
12960659442407301170…58610986451628046639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.592 × 10⁹⁷(98-digit number)
25921318884814602341…17221972903256093279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.184 × 10⁹⁷(98-digit number)
51842637769629204683…34443945806512186559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.036 × 10⁹⁸(99-digit number)
10368527553925840936…68887891613024373119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.073 × 10⁹⁸(99-digit number)
20737055107851681873…37775783226048746239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.147 × 10⁹⁸(99-digit number)
41474110215703363746…75551566452097492479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.294 × 10⁹⁸(99-digit number)
82948220431406727492…51103132904194984959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.658 × 10⁹⁹(100-digit number)
16589644086281345498…02206265808389969919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.317 × 10⁹⁹(100-digit number)
33179288172562690997…04412531616779939839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.635 × 10⁹⁹(100-digit number)
66358576345125381994…08825063233559879679
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Cunningham Chain of the First Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★☆☆☆
Rarity
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,857,491 XPM·at block #6,826,667 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.
Privacy Policy·

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy