Block #1,993,669

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/22/2017, 2:28:08 AM · Difficulty 10.7344 · 4,831,253 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b8f197ee7bb06bc16c33c8a7003d11ca10705526e811d51ac6fbe41fcb9e569d

Height

#1,993,669

Difficulty

10.734419

Transactions

2

Size

833 B

Version

2

Bits

0abc02e5

Nonce

1,368,272,448

Timestamp

2/22/2017, 2:28:08 AM

Confirmations

4,831,253

Merkle Root

3a560b068d8971a3a3cda31ae12f4be03f1f8d994cff38c9df69de736a4137d8
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.849 × 10⁹⁵(96-digit number)
38497367905025672650…87708031667914604159
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.849 × 10⁹⁵(96-digit number)
38497367905025672650…87708031667914604159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.699 × 10⁹⁵(96-digit number)
76994735810051345301…75416063335829208319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.539 × 10⁹⁶(97-digit number)
15398947162010269060…50832126671658416639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.079 × 10⁹⁶(97-digit number)
30797894324020538120…01664253343316833279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.159 × 10⁹⁶(97-digit number)
61595788648041076241…03328506686633666559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.231 × 10⁹⁷(98-digit number)
12319157729608215248…06657013373267333119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.463 × 10⁹⁷(98-digit number)
24638315459216430496…13314026746534666239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.927 × 10⁹⁷(98-digit number)
49276630918432860992…26628053493069332479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.855 × 10⁹⁷(98-digit number)
98553261836865721985…53256106986138664959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.971 × 10⁹⁸(99-digit number)
19710652367373144397…06512213972277329919
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,843,453 XPM·at block #6,824,921 · 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