Block #138,441

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/28/2013, 9:59:30 AM · Difficulty 9.8264 · 6,672,162 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7e60ee812d851c99a75b0cb00f42a5c1d64622acb82a189f31bded87fa25a670

Height

#138,441

Difficulty

9.826420

Transactions

2

Size

424 B

Version

2

Bits

09d3903c

Nonce

4,262

Timestamp

8/28/2013, 9:59:30 AM

Confirmations

6,672,162

Merkle Root

4b00931ebcd13f3f3c266a84f0842d5cbd43760316a7528e83e661c786419b33
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.650 × 10⁹³(94-digit number)
16503547313085397184…88786768209868894721
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.650 × 10⁹³(94-digit number)
16503547313085397184…88786768209868894721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.300 × 10⁹³(94-digit number)
33007094626170794369…77573536419737789441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.601 × 10⁹³(94-digit number)
66014189252341588738…55147072839475578881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.320 × 10⁹⁴(95-digit number)
13202837850468317747…10294145678951157761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.640 × 10⁹⁴(95-digit number)
26405675700936635495…20588291357902315521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.281 × 10⁹⁴(95-digit number)
52811351401873270990…41176582715804631041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.056 × 10⁹⁵(96-digit number)
10562270280374654198…82353165431609262081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.112 × 10⁹⁵(96-digit number)
21124540560749308396…64706330863218524161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.224 × 10⁹⁵(96-digit number)
42249081121498616792…29412661726437048321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.449 × 10⁹⁵(96-digit number)
84498162242997233585…58825323452874096641
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,912 XPM·at block #6,810,602 · 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