Block #1,493,180

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/12/2016, 2:05:30 AM · Difficulty 10.6674 · 5,348,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
db9f24391794f98907d427efc87ec03c5510785db58e989eb77d3ee5dcc9bcf2

Height

#1,493,180

Difficulty

10.667360

Transactions

2

Size

1.11 KB

Version

2

Bits

0aaad81d

Nonce

1,501,109,989

Timestamp

3/12/2016, 2:05:30 AM

Confirmations

5,348,729

Merkle Root

14843718c093f89bc2db9a8a1e82c59035dd2e31f6d8a882352d0004c9468e6e
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.

2.643 × 10⁹⁴(95-digit number)
26431772388805960247…61457051073271696959
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
2.643 × 10⁹⁴(95-digit number)
26431772388805960247…61457051073271696959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.286 × 10⁹⁴(95-digit number)
52863544777611920494…22914102146543393919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.057 × 10⁹⁵(96-digit number)
10572708955522384098…45828204293086787839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.114 × 10⁹⁵(96-digit number)
21145417911044768197…91656408586173575679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.229 × 10⁹⁵(96-digit number)
42290835822089536395…83312817172347151359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.458 × 10⁹⁵(96-digit number)
84581671644179072791…66625634344694302719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.691 × 10⁹⁶(97-digit number)
16916334328835814558…33251268689388605439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.383 × 10⁹⁶(97-digit number)
33832668657671629116…66502537378777210879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.766 × 10⁹⁶(97-digit number)
67665337315343258233…33005074757554421759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.353 × 10⁹⁷(98-digit number)
13533067463068651646…66010149515108843519
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,979,647 XPM·at block #6,841,908 · 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