Block #2,784,427

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/8/2018, 5:42:52 AM · Difficulty 11.6682 · 4,054,745 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7ce9d643ec78d023b7eb7e5e21d09722f3e177f1b8573f808cfbe328c39e1298

Height

#2,784,427

Difficulty

11.668210

Transactions

17

Size

3.71 KB

Version

2

Bits

0bab0fd0

Nonce

262,961,910

Timestamp

8/8/2018, 5:42:52 AM

Confirmations

4,054,745

Merkle Root

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

5.332 × 10⁹⁴(95-digit number)
53323279759987199827…65029775814511966081
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
5.332 × 10⁹⁴(95-digit number)
53323279759987199827…65029775814511966081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.066 × 10⁹⁵(96-digit number)
10664655951997439965…30059551629023932161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.132 × 10⁹⁵(96-digit number)
21329311903994879930…60119103258047864321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.265 × 10⁹⁵(96-digit number)
42658623807989759861…20238206516095728641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.531 × 10⁹⁵(96-digit number)
85317247615979519723…40476413032191457281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.706 × 10⁹⁶(97-digit number)
17063449523195903944…80952826064382914561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.412 × 10⁹⁶(97-digit number)
34126899046391807889…61905652128765829121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.825 × 10⁹⁶(97-digit number)
68253798092783615778…23811304257531658241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.365 × 10⁹⁷(98-digit number)
13650759618556723155…47622608515063316481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.730 × 10⁹⁷(98-digit number)
27301519237113446311…95245217030126632961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.460 × 10⁹⁷(98-digit number)
54603038474226892623…90490434060253265921
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,957,657 XPM·at block #6,839,171 · 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