Block #3,238,537

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/24/2019, 6:32:30 AM · Difficulty 10.9961 · 3,601,799 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3ec3d0f3752b86232a36eab7e3deb2523d0d416df17134b142e74bb54abff34b

Height

#3,238,537

Difficulty

10.996068

Transactions

38

Size

8.36 KB

Version

2

Bits

0afefe54

Nonce

546,197,656

Timestamp

6/24/2019, 6:32:30 AM

Confirmations

3,601,799

Merkle Root

269613a4239d4821a915c5c2e9bb8d43a4aaec5b46a0c8ca07bf7f62834d0ec2
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.495 × 10⁹⁶(97-digit number)
44957662146681823096…19878628886656450561
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.495 × 10⁹⁶(97-digit number)
44957662146681823096…19878628886656450561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.991 × 10⁹⁶(97-digit number)
89915324293363646193…39757257773312901121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.798 × 10⁹⁷(98-digit number)
17983064858672729238…79514515546625802241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.596 × 10⁹⁷(98-digit number)
35966129717345458477…59029031093251604481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.193 × 10⁹⁷(98-digit number)
71932259434690916954…18058062186503208961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.438 × 10⁹⁸(99-digit number)
14386451886938183390…36116124373006417921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.877 × 10⁹⁸(99-digit number)
28772903773876366781…72232248746012835841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.754 × 10⁹⁸(99-digit number)
57545807547752733563…44464497492025671681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.150 × 10⁹⁹(100-digit number)
11509161509550546712…88928994984051343361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.301 × 10⁹⁹(100-digit number)
23018323019101093425…77857989968102686721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.603 × 10⁹⁹(100-digit number)
46036646038202186850…55715979936205373441
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,967,009 XPM·at block #6,840,335 · 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