Block #432,098

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/6/2014, 3:41:07 PM · Difficulty 10.3458 · 6,385,004 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
212d560ead1b6c11b78180ee0f95bb636b827d8c06fda87acf04685455c29cbd

Height

#432,098

Difficulty

10.345772

Transactions

1

Size

971 B

Version

2

Bits

0a58847f

Nonce

2,821

Timestamp

3/6/2014, 3:41:07 PM

Confirmations

6,385,004

Merkle Root

6a33af57c8181ea7dd811446acb18ede48919e143528154d5638310b3a68b316
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.

9.967 × 10⁹⁸(99-digit number)
99672983890941655592…34872387826211596801
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
9.967 × 10⁹⁸(99-digit number)
99672983890941655592…34872387826211596801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.993 × 10⁹⁹(100-digit number)
19934596778188331118…69744775652423193601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.986 × 10⁹⁹(100-digit number)
39869193556376662237…39489551304846387201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.973 × 10⁹⁹(100-digit number)
79738387112753324474…78979102609692774401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.594 × 10¹⁰⁰(101-digit number)
15947677422550664894…57958205219385548801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.189 × 10¹⁰⁰(101-digit number)
31895354845101329789…15916410438771097601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.379 × 10¹⁰⁰(101-digit number)
63790709690202659579…31832820877542195201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.275 × 10¹⁰¹(102-digit number)
12758141938040531915…63665641755084390401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.551 × 10¹⁰¹(102-digit number)
25516283876081063831…27331283510168780801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.103 × 10¹⁰¹(102-digit number)
51032567752162127663…54662567020337561601
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,780,854 XPM·at block #6,817,101 · 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