Block #455,406

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/22/2014, 1:20:41 PM · Difficulty 10.4089 · 6,370,708 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
574f7e7d7ecf6bfebe936f9f1b7678f8d87edad57a93194a371da1f8e496d330

Height

#455,406

Difficulty

10.408939

Transactions

2

Size

723 B

Version

2

Bits

0a68b042

Nonce

14,954,472

Timestamp

3/22/2014, 1:20:41 PM

Confirmations

6,370,708

Merkle Root

70bf9d965353b34f2aa21227ccd17b91ebd4f75cb731e5578d20849652babd3f
Transactions (2)
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.

2.145 × 10⁹⁴(95-digit number)
21452289803399503303…74519126890041826051
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
2.145 × 10⁹⁴(95-digit number)
21452289803399503303…74519126890041826051
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.290 × 10⁹⁴(95-digit number)
42904579606799006607…49038253780083652101
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.580 × 10⁹⁴(95-digit number)
85809159213598013215…98076507560167304201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.716 × 10⁹⁵(96-digit number)
17161831842719602643…96153015120334608401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.432 × 10⁹⁵(96-digit number)
34323663685439205286…92306030240669216801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.864 × 10⁹⁵(96-digit number)
68647327370878410572…84612060481338433601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.372 × 10⁹⁶(97-digit number)
13729465474175682114…69224120962676867201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.745 × 10⁹⁶(97-digit number)
27458930948351364228…38448241925353734401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.491 × 10⁹⁶(97-digit number)
54917861896702728457…76896483850707468801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.098 × 10⁹⁷(98-digit number)
10983572379340545691…53792967701414937601
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,853,037 XPM·at block #6,826,113 · 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