Block #3,354,436

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/14/2019, 10:33:46 AM · Difficulty 10.9960 · 3,472,322 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c532de3e28e8f4b500748602d4991ad168734fe8964d200302ec26d7db2b18e5

Height

#3,354,436

Difficulty

10.996039

Transactions

8

Size

4.05 KB

Version

2

Bits

0afefc70

Nonce

216,442,827

Timestamp

9/14/2019, 10:33:46 AM

Confirmations

3,472,322

Merkle Root

ffb2fb8d401a9096fac76076459cb7a90891d6f224862d24426ba124e2dc8bb5
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.

7.845 × 10⁹⁴(95-digit number)
78453352471583059733…41576569055690103041
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
7.845 × 10⁹⁴(95-digit number)
78453352471583059733…41576569055690103041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.569 × 10⁹⁵(96-digit number)
15690670494316611946…83153138111380206081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.138 × 10⁹⁵(96-digit number)
31381340988633223893…66306276222760412161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.276 × 10⁹⁵(96-digit number)
62762681977266447786…32612552445520824321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.255 × 10⁹⁶(97-digit number)
12552536395453289557…65225104891041648641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.510 × 10⁹⁶(97-digit number)
25105072790906579114…30450209782083297281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.021 × 10⁹⁶(97-digit number)
50210145581813158229…60900419564166594561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.004 × 10⁹⁷(98-digit number)
10042029116362631645…21800839128333189121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.008 × 10⁹⁷(98-digit number)
20084058232725263291…43601678256666378241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.016 × 10⁹⁷(98-digit number)
40168116465450526583…87203356513332756481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.033 × 10⁹⁷(98-digit number)
80336232930901053166…74406713026665512961
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,858,223 XPM·at block #6,826,757 · 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