Block #3,243,412

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/27/2019, 4:15:56 PM · Difficulty 11.0011 · 3,596,261 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6891b16c97df557782c0ada773a62fabc42c1b8d0130acc346d4bb25d8cbdfee

Height

#3,243,412

Difficulty

11.001076

Transactions

4

Size

1.73 KB

Version

2

Bits

0b004688

Nonce

1,591,883,650

Timestamp

6/27/2019, 4:15:56 PM

Confirmations

3,596,261

Merkle Root

58d19d733907b692f1b8ed96452e2aa9c2171e3c7d752f8c0c4faf5212998f7b
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.251 × 10⁹⁴(95-digit number)
32510552209311270591…45936434324618289921
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.251 × 10⁹⁴(95-digit number)
32510552209311270591…45936434324618289921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.502 × 10⁹⁴(95-digit number)
65021104418622541183…91872868649236579841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.300 × 10⁹⁵(96-digit number)
13004220883724508236…83745737298473159681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.600 × 10⁹⁵(96-digit number)
26008441767449016473…67491474596946319361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.201 × 10⁹⁵(96-digit number)
52016883534898032946…34982949193892638721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.040 × 10⁹⁶(97-digit number)
10403376706979606589…69965898387785277441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.080 × 10⁹⁶(97-digit number)
20806753413959213178…39931796775570554881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.161 × 10⁹⁶(97-digit number)
41613506827918426357…79863593551141109761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.322 × 10⁹⁶(97-digit number)
83227013655836852714…59727187102282219521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.664 × 10⁹⁷(98-digit number)
16645402731167370542…19454374204564439041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.329 × 10⁹⁷(98-digit number)
33290805462334741085…38908748409128878081
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,961,673 XPM·at block #6,839,672 · 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