Block #169,459

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/18/2013, 1:05:40 AM · Difficulty 9.8674 · 6,641,042 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0cef180c32c6df9c91383a71aa203ceec0b6124353460331f5878f1fcbd5c395

Height

#169,459

Difficulty

9.867448

Transactions

3

Size

1.72 KB

Version

2

Bits

09de1114

Nonce

17,660

Timestamp

9/18/2013, 1:05:40 AM

Confirmations

6,641,042

Merkle Root

c1085b2c4b2fe8a4b3e1cfbd591e086d5f8ddd23d2c1ce20503db0ea61f4164f
Transactions (3)
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.372 × 10⁹⁴(95-digit number)
93728226833030246559…67401848777868584321
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.372 × 10⁹⁴(95-digit number)
93728226833030246559…67401848777868584321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.874 × 10⁹⁵(96-digit number)
18745645366606049311…34803697555737168641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.749 × 10⁹⁵(96-digit number)
37491290733212098623…69607395111474337281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.498 × 10⁹⁵(96-digit number)
74982581466424197247…39214790222948674561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.499 × 10⁹⁶(97-digit number)
14996516293284839449…78429580445897349121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.999 × 10⁹⁶(97-digit number)
29993032586569678898…56859160891794698241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.998 × 10⁹⁶(97-digit number)
59986065173139357797…13718321783589396481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.199 × 10⁹⁷(98-digit number)
11997213034627871559…27436643567178792961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.399 × 10⁹⁷(98-digit number)
23994426069255743119…54873287134357585921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.798 × 10⁹⁷(98-digit number)
47988852138511486238…09746574268715171841
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,728,091 XPM·at block #6,810,500 · 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