Block #3,337,974

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/2/2019, 4:11:29 PM · Difficulty 11.0010 · 3,506,049 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f2680ee01f3f738259d5fc58e93ae6f05fbbc36e79cf27ed892d1e7b19ebb5c8

Height

#3,337,974

Difficulty

11.000969

Transactions

2

Size

573 B

Version

2

Bits

0b003f86

Nonce

417,256,916

Timestamp

9/2/2019, 4:11:29 PM

Confirmations

3,506,049

Merkle Root

1d5c0c52d55c878d66bc0ff4f385b01f1a8fc9c846bc65dab6b251d9f3b2f87c
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.

4.306 × 10⁹³(94-digit number)
43066827588998176444…22190978879074162481
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.306 × 10⁹³(94-digit number)
43066827588998176444…22190978879074162481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.613 × 10⁹³(94-digit number)
86133655177996352889…44381957758148324961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.722 × 10⁹⁴(95-digit number)
17226731035599270577…88763915516296649921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.445 × 10⁹⁴(95-digit number)
34453462071198541155…77527831032593299841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.890 × 10⁹⁴(95-digit number)
68906924142397082311…55055662065186599681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.378 × 10⁹⁵(96-digit number)
13781384828479416462…10111324130373199361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.756 × 10⁹⁵(96-digit number)
27562769656958832924…20222648260746398721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.512 × 10⁹⁵(96-digit number)
55125539313917665849…40445296521492797441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.102 × 10⁹⁶(97-digit number)
11025107862783533169…80890593042985594881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.205 × 10⁹⁶(97-digit number)
22050215725567066339…61781186085971189761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.410 × 10⁹⁶(97-digit number)
44100431451134132679…23562372171942379521
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,996,566 XPM·at block #6,844,022 · 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