Block #729,011

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/19/2014, 6:07:23 AM · Difficulty 10.9659 · 6,085,128 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4cc7e1e44a15f59ce025a11a2a52d3dc5aa44d9ee97ea571a5086df79d667840

Height

#729,011

Difficulty

10.965899

Transactions

8

Size

2.54 KB

Version

2

Bits

0af7452f

Nonce

485,795,938

Timestamp

9/19/2014, 6:07:23 AM

Confirmations

6,085,128

Merkle Root

5d5eb57cd20b61165bbe079503f6654e436c86e22f327916bf735c4f23c41613
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.

7.414 × 10⁹⁵(96-digit number)
74146541518149703534…01957723865305139201
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
7.414 × 10⁹⁵(96-digit number)
74146541518149703534…01957723865305139201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.482 × 10⁹⁶(97-digit number)
14829308303629940706…03915447730610278401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.965 × 10⁹⁶(97-digit number)
29658616607259881413…07830895461220556801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.931 × 10⁹⁶(97-digit number)
59317233214519762827…15661790922441113601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.186 × 10⁹⁷(98-digit number)
11863446642903952565…31323581844882227201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.372 × 10⁹⁷(98-digit number)
23726893285807905131…62647163689764454401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.745 × 10⁹⁷(98-digit number)
47453786571615810262…25294327379528908801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.490 × 10⁹⁷(98-digit number)
94907573143231620524…50588654759057817601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.898 × 10⁹⁸(99-digit number)
18981514628646324104…01177309518115635201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.796 × 10⁹⁸(99-digit number)
37963029257292648209…02354619036231270401
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,757,196 XPM·at block #6,814,138 · 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