Block #493,524

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/15/2014, 5:48:22 PM · Difficulty 10.7022 · 6,324,328 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1d72ec367d3c1e58ad8558e22d8b10e5023533063760edf67fa8c4fb4eb160b1

Height

#493,524

Difficulty

10.702187

Transactions

6

Size

1.30 KB

Version

2

Bits

0ab3c28e

Nonce

16,583,290

Timestamp

4/15/2014, 5:48:22 PM

Confirmations

6,324,328

Merkle Root

fb9c2114f1e7e3c36e7d27799869ae6259278d7399cd7933a3007a64a052f4f4
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.094 × 10⁹⁷(98-digit number)
30949770773133586961…85591411048931599379
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.094 × 10⁹⁷(98-digit number)
30949770773133586961…85591411048931599379
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.189 × 10⁹⁷(98-digit number)
61899541546267173923…71182822097863198759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.237 × 10⁹⁸(99-digit number)
12379908309253434784…42365644195726397519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.475 × 10⁹⁸(99-digit number)
24759816618506869569…84731288391452795039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.951 × 10⁹⁸(99-digit number)
49519633237013739138…69462576782905590079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.903 × 10⁹⁸(99-digit number)
99039266474027478277…38925153565811180159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.980 × 10⁹⁹(100-digit number)
19807853294805495655…77850307131622360319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.961 × 10⁹⁹(100-digit number)
39615706589610991311…55700614263244720639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.923 × 10⁹⁹(100-digit number)
79231413179221982622…11401228526489441279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.584 × 10¹⁰⁰(101-digit number)
15846282635844396524…22802457052978882559
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,786,882 XPM·at block #6,817,851 · 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