Block #313,732

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/15/2013, 2:54:55 PM · Difficulty 10.0245 · 6,493,345 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c207296ec187b65f77f94a2313e3bf55d4dd759b6771e41855324fba23ce0da3

Height

#313,732

Difficulty

10.024456

Transactions

1

Size

1.15 KB

Version

2

Bits

0a0642c6

Nonce

571,090

Timestamp

12/15/2013, 2:54:55 PM

Confirmations

6,493,345

Merkle Root

34e1bc7bc2a03b367034ae5af99529407174a163e1c39a4ef57349c3c26a820f
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.

5.613 × 10⁹⁷(98-digit number)
56132793594813673058…99579929787395966081
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
5.613 × 10⁹⁷(98-digit number)
56132793594813673058…99579929787395966081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.122 × 10⁹⁸(99-digit number)
11226558718962734611…99159859574791932161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.245 × 10⁹⁸(99-digit number)
22453117437925469223…98319719149583864321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.490 × 10⁹⁸(99-digit number)
44906234875850938447…96639438299167728641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.981 × 10⁹⁸(99-digit number)
89812469751701876894…93278876598335457281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.796 × 10⁹⁹(100-digit number)
17962493950340375378…86557753196670914561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.592 × 10⁹⁹(100-digit number)
35924987900680750757…73115506393341829121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.184 × 10⁹⁹(100-digit number)
71849975801361501515…46231012786683658241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.436 × 10¹⁰⁰(101-digit number)
14369995160272300303…92462025573367316481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.873 × 10¹⁰⁰(101-digit number)
28739990320544600606…84924051146734632961
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,700,712 XPM·at block #6,807,076 · 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.

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