Block #490,329

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/13/2014, 7:25:18 PM · Difficulty 10.6759 · 6,319,172 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c950c276c569403894c2d57c89ead4ea1a0333d6b8c253ca62295e090cc26c28

Height

#490,329

Difficulty

10.675877

Transactions

1

Size

835 B

Version

2

Bits

0aad064b

Nonce

4,192

Timestamp

4/13/2014, 7:25:18 PM

Confirmations

6,319,172

Merkle Root

e12b1f7bbc30e89eeaa8648f2c4dea5a3242dec1586bfbaf77f28d5121303878
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.654 × 10⁹⁸(99-digit number)
36545498856339409991…03779779435333742399
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.654 × 10⁹⁸(99-digit number)
36545498856339409991…03779779435333742399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.309 × 10⁹⁸(99-digit number)
73090997712678819983…07559558870667484799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.461 × 10⁹⁹(100-digit number)
14618199542535763996…15119117741334969599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.923 × 10⁹⁹(100-digit number)
29236399085071527993…30238235482669939199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.847 × 10⁹⁹(100-digit number)
58472798170143055986…60476470965339878399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.169 × 10¹⁰⁰(101-digit number)
11694559634028611197…20952941930679756799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.338 × 10¹⁰⁰(101-digit number)
23389119268057222394…41905883861359513599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.677 × 10¹⁰⁰(101-digit number)
46778238536114444789…83811767722719027199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.355 × 10¹⁰⁰(101-digit number)
93556477072228889579…67623535445438054399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.871 × 10¹⁰¹(102-digit number)
18711295414445777915…35247070890876108799
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,720,081 XPM·at block #6,809,500 · 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.

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