Block #454,173

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/21/2014, 6:36:07 PM · Difficulty 10.3953 · 6,355,162 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ba9274e364aad0bbb717b67847f4b083888f1d5eb0c421a89e7a73048e3a9bf8

Height

#454,173

Difficulty

10.395285

Transactions

10

Size

3.56 KB

Version

2

Bits

0a653163

Nonce

41,856

Timestamp

3/21/2014, 6:36:07 PM

Confirmations

6,355,162

Merkle Root

8e6774a9bf0ed6d40694a74e7e26cd74fa1dcdc29a9fcf77e87d2d1ed2c66a3f
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.481 × 10⁹³(94-digit number)
54819475265417488091…20434132512006784001
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.481 × 10⁹³(94-digit number)
54819475265417488091…20434132512006784001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.096 × 10⁹⁴(95-digit number)
10963895053083497618…40868265024013568001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.192 × 10⁹⁴(95-digit number)
21927790106166995236…81736530048027136001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.385 × 10⁹⁴(95-digit number)
43855580212333990473…63473060096054272001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.771 × 10⁹⁴(95-digit number)
87711160424667980946…26946120192108544001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.754 × 10⁹⁵(96-digit number)
17542232084933596189…53892240384217088001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.508 × 10⁹⁵(96-digit number)
35084464169867192378…07784480768434176001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.016 × 10⁹⁵(96-digit number)
70168928339734384757…15568961536868352001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.403 × 10⁹⁶(97-digit number)
14033785667946876951…31137923073736704001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.806 × 10⁹⁶(97-digit number)
28067571335893753902…62275846147473408001
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,718,747 XPM·at block #6,809,334 · 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