Block #3,643,040

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/14/2020, 7:51:30 AM · Difficulty 10.9087 · 3,200,013 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c10430f7c367d8dcb8e9988c71631b48225e4eb1b84d9759cf64c334112b40ac

Height

#3,643,040

Difficulty

10.908728

Transactions

4

Size

2.05 KB

Version

2

Bits

0ae8a264

Nonce

305,769,864

Timestamp

4/14/2020, 7:51:30 AM

Confirmations

3,200,013

Merkle Root

7bd612c088e790b3fc1ff512c10c855028c55023e280a34069ae8287f4a5c05b
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.686 × 10⁹⁷(98-digit number)
36860793331212548392…64918062839466864641
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.686 × 10⁹⁷(98-digit number)
36860793331212548392…64918062839466864641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.372 × 10⁹⁷(98-digit number)
73721586662425096784…29836125678933729281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.474 × 10⁹⁸(99-digit number)
14744317332485019356…59672251357867458561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.948 × 10⁹⁸(99-digit number)
29488634664970038713…19344502715734917121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.897 × 10⁹⁸(99-digit number)
58977269329940077427…38689005431469834241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.179 × 10⁹⁹(100-digit number)
11795453865988015485…77378010862939668481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.359 × 10⁹⁹(100-digit number)
23590907731976030970…54756021725879336961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.718 × 10⁹⁹(100-digit number)
47181815463952061941…09512043451758673921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.436 × 10⁹⁹(100-digit number)
94363630927904123883…19024086903517347841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.887 × 10¹⁰⁰(101-digit number)
18872726185580824776…38048173807034695681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.774 × 10¹⁰⁰(101-digit number)
37745452371161649553…76096347614069391361
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,988,782 XPM·at block #6,843,052 · 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