Block #2,493,382

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/27/2018, 11:05:14 PM · Difficulty 10.9722 · 4,351,547 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d01c25533d8fd8a34c3f8e630b30bfee2810a520ee76960e9251308bfed939dc

Height

#2,493,382

Difficulty

10.972222

Transactions

42

Size

11.23 KB

Version

2

Bits

0af8e38e

Nonce

246,110,353

Timestamp

1/27/2018, 11:05:14 PM

Confirmations

4,351,547

Merkle Root

d4c1e30e7622683681a061646571fa266800bb46daaa1bffe0794d52bfdf8cd5
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.

6.049 × 10⁹⁵(96-digit number)
60499802376762183544…93418151576217301759
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
6.049 × 10⁹⁵(96-digit number)
60499802376762183544…93418151576217301759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.209 × 10⁹⁶(97-digit number)
12099960475352436708…86836303152434603519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.419 × 10⁹⁶(97-digit number)
24199920950704873417…73672606304869207039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.839 × 10⁹⁶(97-digit number)
48399841901409746835…47345212609738414079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.679 × 10⁹⁶(97-digit number)
96799683802819493670…94690425219476828159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.935 × 10⁹⁷(98-digit number)
19359936760563898734…89380850438953656319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.871 × 10⁹⁷(98-digit number)
38719873521127797468…78761700877907312639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.743 × 10⁹⁷(98-digit number)
77439747042255594936…57523401755814625279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.548 × 10⁹⁸(99-digit number)
15487949408451118987…15046803511629250559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.097 × 10⁹⁸(99-digit number)
30975898816902237974…30093607023258501119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.195 × 10⁹⁸(99-digit number)
61951797633804475949…60187214046517002239
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:58,003,849 XPM·at block #6,844,928 · 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