Block #2,663,452

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/16/2018, 9:26:24 AM · Difficulty 11.6478 · 4,179,729 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
555fd33046d220edeb7ae91ba6142c6f29e76c7b449e991d161ff15c07369bd7

Height

#2,663,452

Difficulty

11.647818

Transactions

6

Size

2.83 KB

Version

2

Bits

0ba5d763

Nonce

56,679,584

Timestamp

5/16/2018, 9:26:24 AM

Confirmations

4,179,729

Merkle Root

ce927c6167629583a6ba93f0c60ed25a8bf25318c2ae9141f4153105875ac2a9
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.092 × 10⁹⁴(95-digit number)
30922801269118029792…30532046969968558079
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.092 × 10⁹⁴(95-digit number)
30922801269118029792…30532046969968558079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.184 × 10⁹⁴(95-digit number)
61845602538236059584…61064093939937116159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.236 × 10⁹⁵(96-digit number)
12369120507647211916…22128187879874232319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.473 × 10⁹⁵(96-digit number)
24738241015294423833…44256375759748464639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.947 × 10⁹⁵(96-digit number)
49476482030588847667…88512751519496929279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.895 × 10⁹⁵(96-digit number)
98952964061177695335…77025503038993858559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.979 × 10⁹⁶(97-digit number)
19790592812235539067…54051006077987717119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.958 × 10⁹⁶(97-digit number)
39581185624471078134…08102012155975434239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.916 × 10⁹⁶(97-digit number)
79162371248942156268…16204024311950868479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.583 × 10⁹⁷(98-digit number)
15832474249788431253…32408048623901736959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.166 × 10⁹⁷(98-digit number)
31664948499576862507…64816097247803473919
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,989,816 XPM·at block #6,843,180 · 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