Block #2,870,651

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/7/2018, 4:11:37 AM · Difficulty 11.6658 · 3,974,180 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ffce40feecec7bf6d8e3837f43acc61364bf92947fa6be74846aaae673dff2eb

Height

#2,870,651

Difficulty

11.665807

Transactions

2

Size

574 B

Version

2

Bits

0baa724f

Nonce

708,999,258

Timestamp

10/7/2018, 4:11:37 AM

Confirmations

3,974,180

Merkle Root

97ea5aee4641a0d64e3ede200f9462faea43ef0ad5e8d3f9509113c62a9af02f
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.

3.636 × 10⁹⁴(95-digit number)
36364826471138801414…86905098953259322941
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
3.636 × 10⁹⁴(95-digit number)
36364826471138801414…86905098953259322941
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.272 × 10⁹⁴(95-digit number)
72729652942277602829…73810197906518645881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.454 × 10⁹⁵(96-digit number)
14545930588455520565…47620395813037291761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.909 × 10⁹⁵(96-digit number)
29091861176911041131…95240791626074583521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.818 × 10⁹⁵(96-digit number)
58183722353822082263…90481583252149167041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.163 × 10⁹⁶(97-digit number)
11636744470764416452…80963166504298334081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.327 × 10⁹⁶(97-digit number)
23273488941528832905…61926333008596668161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.654 × 10⁹⁶(97-digit number)
46546977883057665810…23852666017193336321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.309 × 10⁹⁶(97-digit number)
93093955766115331621…47705332034386672641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.861 × 10⁹⁷(98-digit number)
18618791153223066324…95410664068773345281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.723 × 10⁹⁷(98-digit number)
37237582306446132648…90821328137546690561
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:58,003,057 XPM·at block #6,844,830 · 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