Block #2,847,160

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/20/2018, 1:58:10 AM · Difficulty 11.7319 · 3,986,683 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ea57e6be5461d59110ff9160cf630051e6caad482360f65f3e5372e30b8477de

Height

#2,847,160

Difficulty

11.731892

Transactions

9

Size

2.50 KB

Version

2

Bits

0bbb5d4b

Nonce

183,824,152

Timestamp

9/20/2018, 1:58:10 AM

Confirmations

3,986,683

Merkle Root

bbaae658e5a76ccc7ebe007753742b5f4174b42c8ca509d91af6ccfde99424e6
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.458 × 10⁹⁴(95-digit number)
14584847134672657869…11728721750964289341
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.458 × 10⁹⁴(95-digit number)
14584847134672657869…11728721750964289341
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.916 × 10⁹⁴(95-digit number)
29169694269345315739…23457443501928578681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.833 × 10⁹⁴(95-digit number)
58339388538690631479…46914887003857157361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.166 × 10⁹⁵(96-digit number)
11667877707738126295…93829774007714314721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.333 × 10⁹⁵(96-digit number)
23335755415476252591…87659548015428629441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.667 × 10⁹⁵(96-digit number)
46671510830952505183…75319096030857258881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.334 × 10⁹⁵(96-digit number)
93343021661905010367…50638192061714517761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.866 × 10⁹⁶(97-digit number)
18668604332381002073…01276384123429035521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.733 × 10⁹⁶(97-digit number)
37337208664762004146…02552768246858071041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.467 × 10⁹⁶(97-digit number)
74674417329524008293…05105536493716142081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.493 × 10⁹⁷(98-digit number)
14934883465904801658…10211072987432284161
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,914,974 XPM·at block #6,833,842 · 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