Block #3,508,689

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/10/2020, 11:18:18 PM · Difficulty 10.9290 · 3,309,197 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c79578ac622bc72838061dcc2cacb44e6dfa419443813eda84a851b6a25e88db

Height

#3,508,689

Difficulty

10.928995

Transactions

20

Size

6.20 KB

Version

2

Bits

0aedd298

Nonce

487,131,127

Timestamp

1/10/2020, 11:18:18 PM

Confirmations

3,309,197

Merkle Root

a86fd4b4e96590f4a318325941880ec700266b0e79d20576221690208f1fa6b2
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.267 × 10⁹⁷(98-digit number)
12672289537407753985…58763773115168089601
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.267 × 10⁹⁷(98-digit number)
12672289537407753985…58763773115168089601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.534 × 10⁹⁷(98-digit number)
25344579074815507970…17527546230336179201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.068 × 10⁹⁷(98-digit number)
50689158149631015940…35055092460672358401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.013 × 10⁹⁸(99-digit number)
10137831629926203188…70110184921344716801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.027 × 10⁹⁸(99-digit number)
20275663259852406376…40220369842689433601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.055 × 10⁹⁸(99-digit number)
40551326519704812752…80440739685378867201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.110 × 10⁹⁸(99-digit number)
81102653039409625504…60881479370757734401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.622 × 10⁹⁹(100-digit number)
16220530607881925100…21762958741515468801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.244 × 10⁹⁹(100-digit number)
32441061215763850201…43525917483030937601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.488 × 10⁹⁹(100-digit number)
64882122431527700403…87051834966061875201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.297 × 10¹⁰⁰(101-digit number)
12976424486305540080…74103669932123750401
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,787,148 XPM·at block #6,817,885 · 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