Block #3,517,468

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/16/2020, 7:23:26 PM · Difficulty 10.9343 · 3,316,153 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b0bf5afce5da9ff01be7f6dcb28a849a2792760b24da34db6f6944366cadbb37

Height

#3,517,468

Difficulty

10.934304

Transactions

3

Size

880 B

Version

2

Bits

0aef2e94

Nonce

92,018,936

Timestamp

1/16/2020, 7:23:26 PM

Confirmations

3,316,153

Merkle Root

1c6be23d17b17dac6d7a5eccb424cf1c1bad0e2791ad846932af6156339f5122
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.

3.094 × 10⁹⁴(95-digit number)
30940253701352363430…55140754412992215041
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
3.094 × 10⁹⁴(95-digit number)
30940253701352363430…55140754412992215041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.188 × 10⁹⁴(95-digit number)
61880507402704726861…10281508825984430081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.237 × 10⁹⁵(96-digit number)
12376101480540945372…20563017651968860161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.475 × 10⁹⁵(96-digit number)
24752202961081890744…41126035303937720321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.950 × 10⁹⁵(96-digit number)
49504405922163781489…82252070607875440641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.900 × 10⁹⁵(96-digit number)
99008811844327562978…64504141215750881281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.980 × 10⁹⁶(97-digit number)
19801762368865512595…29008282431501762561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.960 × 10⁹⁶(97-digit number)
39603524737731025191…58016564863003525121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.920 × 10⁹⁶(97-digit number)
79207049475462050383…16033129726007050241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.584 × 10⁹⁷(98-digit number)
15841409895092410076…32066259452014100481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.168 × 10⁹⁷(98-digit number)
31682819790184820153…64132518904028200961
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,913,177 XPM·at block #6,833,620 · 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