Block #3,497,523

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/2/2020, 2:40:42 PM · Difficulty 10.9400 · 3,319,260 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d8988ba066d12d236586d01fd81c7c5d6f98e43961b6ee50cdcf47d9614aa9b9

Height

#3,497,523

Difficulty

10.939966

Transactions

9

Size

1.69 KB

Version

2

Bits

0af0a19a

Nonce

1,035,131,435

Timestamp

1/2/2020, 2:40:42 PM

Confirmations

3,319,260

Merkle Root

424c94619203cd5689ecb4d88f7e476e1b7ebc3de3562def16f6a9930376aaf4
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.755 × 10⁹⁵(96-digit number)
47558516048949143321…14870278607334933761
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.755 × 10⁹⁵(96-digit number)
47558516048949143321…14870278607334933761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.511 × 10⁹⁵(96-digit number)
95117032097898286643…29740557214669867521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.902 × 10⁹⁶(97-digit number)
19023406419579657328…59481114429339735041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.804 × 10⁹⁶(97-digit number)
38046812839159314657…18962228858679470081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.609 × 10⁹⁶(97-digit number)
76093625678318629314…37924457717358940161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.521 × 10⁹⁷(98-digit number)
15218725135663725862…75848915434717880321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.043 × 10⁹⁷(98-digit number)
30437450271327451725…51697830869435760641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.087 × 10⁹⁷(98-digit number)
60874900542654903451…03395661738871521281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.217 × 10⁹⁸(99-digit number)
12174980108530980690…06791323477743042561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.434 × 10⁹⁸(99-digit number)
24349960217061961380…13582646955486085121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.869 × 10⁹⁸(99-digit number)
48699920434123922761…27165293910972170241
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,778,299 XPM·at block #6,816,782 · 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