Block #3,278,434

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/23/2019, 3:01:44 PM · Difficulty 10.9949 · 3,538,855 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5476bb182f0d45d8cebb3d93e77c93d5f8299902a3ba6150f4fe3c3d1dc1aee9

Height

#3,278,434

Difficulty

10.994903

Transactions

3

Size

19.25 KB

Version

2

Bits

0afeb1f1

Nonce

18,729,607

Timestamp

7/23/2019, 3:01:44 PM

Confirmations

3,538,855

Merkle Root

382228a684c27f2871687af65def1536ed253eb1bb8e8698fc9318258c16f33c
Transactions (3)
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.094 × 10⁹³(94-digit number)
10944772848669554784…09422915640673699361
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.094 × 10⁹³(94-digit number)
10944772848669554784…09422915640673699361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.188 × 10⁹³(94-digit number)
21889545697339109568…18845831281347398721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.377 × 10⁹³(94-digit number)
43779091394678219136…37691662562694797441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.755 × 10⁹³(94-digit number)
87558182789356438273…75383325125389594881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.751 × 10⁹⁴(95-digit number)
17511636557871287654…50766650250779189761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.502 × 10⁹⁴(95-digit number)
35023273115742575309…01533300501558379521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.004 × 10⁹⁴(95-digit number)
70046546231485150618…03066601003116759041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.400 × 10⁹⁵(96-digit number)
14009309246297030123…06133202006233518081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.801 × 10⁹⁵(96-digit number)
28018618492594060247…12266404012467036161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.603 × 10⁹⁵(96-digit number)
56037236985188120494…24532808024934072321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.120 × 10⁹⁶(97-digit number)
11207447397037624098…49065616049868144641
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,782,353 XPM·at block #6,817,288 · 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