Block #2,138,897

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/31/2017, 7:16:37 AM · Difficulty 10.8804 · 4,703,181 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1ced89c331a1ba557e8f6fe4a3d0026a2729fa564c56eed0a59a5bbbc1ffdaad

Height

#2,138,897

Difficulty

10.880367

Transactions

2

Size

723 B

Version

2

Bits

0ae15fb6

Nonce

26,161,487

Timestamp

5/31/2017, 7:16:37 AM

Confirmations

4,703,181

Merkle Root

5f1515b806d2f57e9a40459e08ec161bed88d501a51830e9adb3e46b9be30230
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.

5.827 × 10⁹⁵(96-digit number)
58279326825596512248…37176681976192209919
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.827 × 10⁹⁵(96-digit number)
58279326825596512248…37176681976192209919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.165 × 10⁹⁶(97-digit number)
11655865365119302449…74353363952384419839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.331 × 10⁹⁶(97-digit number)
23311730730238604899…48706727904768839679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.662 × 10⁹⁶(97-digit number)
46623461460477209799…97413455809537679359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.324 × 10⁹⁶(97-digit number)
93246922920954419598…94826911619075358719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.864 × 10⁹⁷(98-digit number)
18649384584190883919…89653823238150717439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.729 × 10⁹⁷(98-digit number)
37298769168381767839…79307646476301434879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.459 × 10⁹⁷(98-digit number)
74597538336763535678…58615292952602869759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.491 × 10⁹⁸(99-digit number)
14919507667352707135…17230585905205739519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.983 × 10⁹⁸(99-digit number)
29839015334705414271…34461171810411479039
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,981,008 XPM·at block #6,842,077 · 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