Block #3,227,421

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/16/2019, 6:22:26 AM · Difficulty 11.0073 · 3,604,660 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d9b90ab930e3095231a3b2bbe3d2de6e1750e47ef6c79f86065c7e2d2bb2c556

Height

#3,227,421

Difficulty

11.007285

Transactions

2

Size

1.28 KB

Version

2

Bits

0b01dd71

Nonce

408,665,501

Timestamp

6/16/2019, 6:22:26 AM

Confirmations

3,604,660

Merkle Root

7a111175d5c986d760b0371c373c21448ab67df32c17e3bd74f8a040b22abb15
Transactions (2)
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.440 × 10⁹³(94-digit number)
14408518961934538369…19831304101677681601
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.440 × 10⁹³(94-digit number)
14408518961934538369…19831304101677681601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.881 × 10⁹³(94-digit number)
28817037923869076739…39662608203355363201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.763 × 10⁹³(94-digit number)
57634075847738153478…79325216406710726401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.152 × 10⁹⁴(95-digit number)
11526815169547630695…58650432813421452801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.305 × 10⁹⁴(95-digit number)
23053630339095261391…17300865626842905601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.610 × 10⁹⁴(95-digit number)
46107260678190522782…34601731253685811201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.221 × 10⁹⁴(95-digit number)
92214521356381045565…69203462507371622401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.844 × 10⁹⁵(96-digit number)
18442904271276209113…38406925014743244801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.688 × 10⁹⁵(96-digit number)
36885808542552418226…76813850029486489601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.377 × 10⁹⁵(96-digit number)
73771617085104836452…53627700058972979201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.475 × 10⁹⁶(97-digit number)
14754323417020967290…07255400117945958401
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,900,775 XPM·at block #6,832,080 · 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