Block #3,239,846

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/25/2019, 4:15:31 AM · Difficulty 11.0017 · 3,593,599 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1cdd9be7c2627efdaba595a12b919f6656d99532452a5c398e8dcba9e6c3f406

Height

#3,239,846

Difficulty

11.001687

Transactions

10

Size

4.04 KB

Version

2

Bits

0b006e94

Nonce

334,306,352

Timestamp

6/25/2019, 4:15:31 AM

Confirmations

3,593,599

Merkle Root

4f45f096150827a599223be3891ee3c7cf65fb97521357df6ade2730d2a966ba
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.

2.329 × 10⁹⁴(95-digit number)
23292352277516736528…48785619108681948161
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
2.329 × 10⁹⁴(95-digit number)
23292352277516736528…48785619108681948161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.658 × 10⁹⁴(95-digit number)
46584704555033473057…97571238217363896321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.316 × 10⁹⁴(95-digit number)
93169409110066946114…95142476434727792641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.863 × 10⁹⁵(96-digit number)
18633881822013389222…90284952869455585281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.726 × 10⁹⁵(96-digit number)
37267763644026778445…80569905738911170561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.453 × 10⁹⁵(96-digit number)
74535527288053556891…61139811477822341121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.490 × 10⁹⁶(97-digit number)
14907105457610711378…22279622955644682241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.981 × 10⁹⁶(97-digit number)
29814210915221422756…44559245911289364481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.962 × 10⁹⁶(97-digit number)
59628421830442845513…89118491822578728961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.192 × 10⁹⁷(98-digit number)
11925684366088569102…78236983645157457921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.385 × 10⁹⁷(98-digit number)
23851368732177138205…56473967290314915841
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,911,758 XPM·at block #6,833,444 · 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