Block #3,701,138

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/25/2020, 1:33:53 PM · Difficulty 10.8841 · 3,115,223 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0a44ce1c2e988c433e33f78139c6557201e9fdf97c55b0d6466a0d34077420b6

Height

#3,701,138

Difficulty

10.884095

Transactions

5

Size

1.81 KB

Version

2

Bits

0ae25413

Nonce

1,079,604,511

Timestamp

5/25/2020, 1:33:53 PM

Confirmations

3,115,223

Merkle Root

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

6.237 × 10⁹¹(92-digit number)
62378574964638546052…06748583393047868081
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
6.237 × 10⁹¹(92-digit number)
62378574964638546052…06748583393047868081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.247 × 10⁹²(93-digit number)
12475714992927709210…13497166786095736161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.495 × 10⁹²(93-digit number)
24951429985855418420…26994333572191472321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.990 × 10⁹²(93-digit number)
49902859971710836841…53988667144382944641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.980 × 10⁹²(93-digit number)
99805719943421673683…07977334288765889281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.996 × 10⁹³(94-digit number)
19961143988684334736…15954668577531778561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.992 × 10⁹³(94-digit number)
39922287977368669473…31909337155063557121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.984 × 10⁹³(94-digit number)
79844575954737338947…63818674310127114241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.596 × 10⁹⁴(95-digit number)
15968915190947467789…27637348620254228481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.193 × 10⁹⁴(95-digit number)
31937830381894935578…55274697240508456961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.387 × 10⁹⁴(95-digit number)
63875660763789871157…10549394481016913921
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,775,014 XPM·at block #6,816,360 · 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