Block #189,925

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/2/2013, 3:35:40 AM · Difficulty 9.8737 · 6,625,123 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8e69b5e5c0fa3539bd498f2acdc5e254dda7247c2a9365c3b631d1ea77ce8e0a

Height

#189,925

Difficulty

9.873694

Transactions

5

Size

1.22 KB

Version

2

Bits

09dfaa71

Nonce

70,702

Timestamp

10/2/2013, 3:35:40 AM

Confirmations

6,625,123

Merkle Root

27fe9c07d25a8d6ea02ffb68e43828ad339a65b8abf5a93c9e8a94c1d353b374
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.216 × 10⁹³(94-digit number)
72162626349948255045…34980429647705016001
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.216 × 10⁹³(94-digit number)
72162626349948255045…34980429647705016001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.443 × 10⁹⁴(95-digit number)
14432525269989651009…69960859295410032001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.886 × 10⁹⁴(95-digit number)
28865050539979302018…39921718590820064001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.773 × 10⁹⁴(95-digit number)
57730101079958604036…79843437181640128001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.154 × 10⁹⁵(96-digit number)
11546020215991720807…59686874363280256001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.309 × 10⁹⁵(96-digit number)
23092040431983441614…19373748726560512001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.618 × 10⁹⁵(96-digit number)
46184080863966883229…38747497453121024001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.236 × 10⁹⁵(96-digit number)
92368161727933766458…77494994906242048001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.847 × 10⁹⁶(97-digit number)
18473632345586753291…54989989812484096001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.694 × 10⁹⁶(97-digit number)
36947264691173506583…09979979624968192001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.389 × 10⁹⁶(97-digit number)
73894529382347013166…19959959249936384001
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,764,474 XPM·at block #6,815,047 · 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