Block #2,081,627

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/21/2017, 8:16:05 PM · Difficulty 10.8669 · 4,745,487 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c29e2fac656c46c8ce2f7f414485ceffcb7ab9053c6f55f1e860834a6513c26b

Height

#2,081,627

Difficulty

10.866915

Transactions

2

Size

3.59 KB

Version

2

Bits

0addee26

Nonce

1,015,357,119

Timestamp

4/21/2017, 8:16:05 PM

Confirmations

4,745,487

Merkle Root

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

2.870 × 10⁹⁶(97-digit number)
28700473341996813543…88930329644968878081
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
2.870 × 10⁹⁶(97-digit number)
28700473341996813543…88930329644968878081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.740 × 10⁹⁶(97-digit number)
57400946683993627086…77860659289937756161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.148 × 10⁹⁷(98-digit number)
11480189336798725417…55721318579875512321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.296 × 10⁹⁷(98-digit number)
22960378673597450834…11442637159751024641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.592 × 10⁹⁷(98-digit number)
45920757347194901669…22885274319502049281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.184 × 10⁹⁷(98-digit number)
91841514694389803338…45770548639004098561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.836 × 10⁹⁸(99-digit number)
18368302938877960667…91541097278008197121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.673 × 10⁹⁸(99-digit number)
36736605877755921335…83082194556016394241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.347 × 10⁹⁸(99-digit number)
73473211755511842670…66164389112032788481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.469 × 10⁹⁹(100-digit number)
14694642351102368534…32328778224065576961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.938 × 10⁹⁹(100-digit number)
29389284702204737068…64657556448131153921
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,861,091 XPM·at block #6,827,113 · 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