Block #2,149,929

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/7/2017, 9:45:05 AM · Difficulty 10.8983 · 4,689,133 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3c6b7fc787c0bf5efdaa532f2ee83afc1142183da1bdc4e9d68902ac63bbdab7

Height

#2,149,929

Difficulty

10.898329

Transactions

5

Size

1.08 KB

Version

2

Bits

0ae5f8e5

Nonce

1,297,525,301

Timestamp

6/7/2017, 9:45:05 AM

Confirmations

4,689,133

Merkle Root

4ab76452d92e725adaceaf44efd72470e28cd869912604e6bb003756c2e5f3cc
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.542 × 10⁹⁴(95-digit number)
35423367138867800524…59489954251392624239
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.542 × 10⁹⁴(95-digit number)
35423367138867800524…59489954251392624239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.084 × 10⁹⁴(95-digit number)
70846734277735601048…18979908502785248479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.416 × 10⁹⁵(96-digit number)
14169346855547120209…37959817005570496959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.833 × 10⁹⁵(96-digit number)
28338693711094240419…75919634011140993919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.667 × 10⁹⁵(96-digit number)
56677387422188480838…51839268022281987839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.133 × 10⁹⁶(97-digit number)
11335477484437696167…03678536044563975679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.267 × 10⁹⁶(97-digit number)
22670954968875392335…07357072089127951359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.534 × 10⁹⁶(97-digit number)
45341909937750784671…14714144178255902719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.068 × 10⁹⁶(97-digit number)
90683819875501569342…29428288356511805439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.813 × 10⁹⁷(98-digit number)
18136763975100313868…58856576713023610879
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,956,764 XPM·at block #6,839,061 · 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