Block #81,841

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/25/2013, 1:00:49 AM · Difficulty 9.2702 · 6,732,326 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
efb555f92b7d19bd3398d6f89141637a2b7bd677a38b1da1b2d34907a2e54cd8

Height

#81,841

Difficulty

9.270168

Transactions

2

Size

877 B

Version

2

Bits

094529c1

Nonce

436

Timestamp

7/25/2013, 1:00:49 AM

Confirmations

6,732,326

Merkle Root

c946375bc98d3561791b02cca7bbf3881764e73a48c720713efe43c07f0a8b7e
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.

4.032 × 10¹¹²(113-digit number)
40322801328352177898…15963469919313033741
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
4.032 × 10¹¹²(113-digit number)
40322801328352177898…15963469919313033741
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.064 × 10¹¹²(113-digit number)
80645602656704355796…31926939838626067481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.612 × 10¹¹³(114-digit number)
16129120531340871159…63853879677252134961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.225 × 10¹¹³(114-digit number)
32258241062681742318…27707759354504269921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.451 × 10¹¹³(114-digit number)
64516482125363484637…55415518709008539841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.290 × 10¹¹⁴(115-digit number)
12903296425072696927…10831037418017079681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.580 × 10¹¹⁴(115-digit number)
25806592850145393854…21662074836034159361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.161 × 10¹¹⁴(115-digit number)
51613185700290787709…43324149672068318721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.032 × 10¹¹⁵(116-digit number)
10322637140058157541…86648299344136637441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.064 × 10¹¹⁵(116-digit number)
20645274280116315083…73296598688273274881
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,757,417 XPM·at block #6,814,166 · 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