Block #2,479,785

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/19/2018, 4:01:19 AM · Difficulty 10.9661 · 4,363,975 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d295959b73d5d02efd018b8e587385d098d1427b25821d9f4a8e8512ef598fe4

Height

#2,479,785

Difficulty

10.966123

Transactions

31

Size

7.16 KB

Version

2

Bits

0af753db

Nonce

159,849,723

Timestamp

1/19/2018, 4:01:19 AM

Confirmations

4,363,975

Merkle Root

3ffdbdc729494520d8da28e50323306917e6c9ac02b291ec566f5627c9c82b56
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.470 × 10⁹³(94-digit number)
44704878253654862807…34410224548254419321
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.470 × 10⁹³(94-digit number)
44704878253654862807…34410224548254419321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.940 × 10⁹³(94-digit number)
89409756507309725614…68820449096508838641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.788 × 10⁹⁴(95-digit number)
17881951301461945122…37640898193017677281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.576 × 10⁹⁴(95-digit number)
35763902602923890245…75281796386035354561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.152 × 10⁹⁴(95-digit number)
71527805205847780491…50563592772070709121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.430 × 10⁹⁵(96-digit number)
14305561041169556098…01127185544141418241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.861 × 10⁹⁵(96-digit number)
28611122082339112196…02254371088282836481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.722 × 10⁹⁵(96-digit number)
57222244164678224393…04508742176565672961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.144 × 10⁹⁶(97-digit number)
11444448832935644878…09017484353131345921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.288 × 10⁹⁶(97-digit number)
22888897665871289757…18034968706262691841
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,994,452 XPM·at block #6,843,759 · 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