Block #2,151,468

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/8/2017, 9:50:53 AM · Difficulty 10.9002 · 4,690,178 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
afb5da1bbd1a8b985f01cf55003448254c06239f12fc962f6960168edd141abf

Height

#2,151,468

Difficulty

10.900239

Transactions

4

Size

2.07 KB

Version

2

Bits

0ae67614

Nonce

582,666,234

Timestamp

6/8/2017, 9:50:53 AM

Confirmations

4,690,178

Merkle Root

6c839d25c23a410418f82c502d37d59396620cc1d81a3e4c98101910f9b4b818
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.755 × 10⁹⁷(98-digit number)
17559880923589061176…49871342208845168639
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.755 × 10⁹⁷(98-digit number)
17559880923589061176…49871342208845168639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.511 × 10⁹⁷(98-digit number)
35119761847178122353…99742684417690337279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.023 × 10⁹⁷(98-digit number)
70239523694356244707…99485368835380674559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.404 × 10⁹⁸(99-digit number)
14047904738871248941…98970737670761349119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.809 × 10⁹⁸(99-digit number)
28095809477742497883…97941475341522698239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.619 × 10⁹⁸(99-digit number)
56191618955484995766…95882950683045396479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.123 × 10⁹⁹(100-digit number)
11238323791096999153…91765901366090792959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.247 × 10⁹⁹(100-digit number)
22476647582193998306…83531802732181585919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.495 × 10⁹⁹(100-digit number)
44953295164387996612…67063605464363171839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.990 × 10⁹⁹(100-digit number)
89906590328775993225…34127210928726343679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.798 × 10¹⁰⁰(101-digit number)
17981318065755198645…68254421857452687359
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,977,555 XPM·at block #6,841,645 · 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