Block #2,210,665

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/17/2017, 2:26:23 PM · Difficulty 10.9439 · 4,631,669 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
262a0b708befb4fad0622094245346791cfdf1bb83c9c6e1313ed4abcafb1326

Height

#2,210,665

Difficulty

10.943856

Transactions

10

Size

5.07 KB

Version

2

Bits

0af1a08c

Nonce

1,698,014,298

Timestamp

7/17/2017, 2:26:23 PM

Confirmations

4,631,669

Merkle Root

12c22b5bca8b2ebe16e42dc2d26345a93d34f0cf8376424aaf14971027511f00
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.

7.138 × 10⁹⁴(95-digit number)
71383355813908472163…88891973241168426879
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
7.138 × 10⁹⁴(95-digit number)
71383355813908472163…88891973241168426879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.427 × 10⁹⁵(96-digit number)
14276671162781694432…77783946482336853759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.855 × 10⁹⁵(96-digit number)
28553342325563388865…55567892964673707519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.710 × 10⁹⁵(96-digit number)
57106684651126777730…11135785929347415039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.142 × 10⁹⁶(97-digit number)
11421336930225355546…22271571858694830079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.284 × 10⁹⁶(97-digit number)
22842673860450711092…44543143717389660159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.568 × 10⁹⁶(97-digit number)
45685347720901422184…89086287434779320319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.137 × 10⁹⁶(97-digit number)
91370695441802844369…78172574869558640639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.827 × 10⁹⁷(98-digit number)
18274139088360568873…56345149739117281279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.654 × 10⁹⁷(98-digit number)
36548278176721137747…12690299478234562559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.309 × 10⁹⁷(98-digit number)
73096556353442275495…25380598956469125119
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,983,078 XPM·at block #6,842,333 · 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