Block #189,524

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/1/2013, 9:06:09 PM · Difficulty 9.8733 · 6,637,585 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
61123e01e8136ad607d9acd60a5125240fa749fe76aeae6a270e8ef5738d690f

Height

#189,524

Difficulty

9.873269

Transactions

2

Size

425 B

Version

2

Bits

09df8e8a

Nonce

219,583

Timestamp

10/1/2013, 9:06:09 PM

Confirmations

6,637,585

Merkle Root

4e739d49f1a05d727851f4bc31c195e816046134c697d19baf996cbef6e8ac0d
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.

1.011 × 10⁹²(93-digit number)
10118486493403404532…04739136337480984001
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
1.011 × 10⁹²(93-digit number)
10118486493403404532…04739136337480984001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.023 × 10⁹²(93-digit number)
20236972986806809064…09478272674961968001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.047 × 10⁹²(93-digit number)
40473945973613618128…18956545349923936001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.094 × 10⁹²(93-digit number)
80947891947227236256…37913090699847872001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.618 × 10⁹³(94-digit number)
16189578389445447251…75826181399695744001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.237 × 10⁹³(94-digit number)
32379156778890894502…51652362799391488001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.475 × 10⁹³(94-digit number)
64758313557781789005…03304725598782976001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.295 × 10⁹⁴(95-digit number)
12951662711556357801…06609451197565952001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.590 × 10⁹⁴(95-digit number)
25903325423112715602…13218902395131904001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.180 × 10⁹⁴(95-digit number)
51806650846225431204…26437804790263808001
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,861,051 XPM·at block #6,827,108 · 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