Block #491,050

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/14/2014, 6:25:33 AM · Difficulty 10.6800 · 6,322,863 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bbb195f7949293007701a20907836f0a752f2515172b087546c6d743e40ead71

Height

#491,050

Difficulty

10.679999

Transactions

3

Size

1.15 KB

Version

2

Bits

0aae1468

Nonce

241,767,301

Timestamp

4/14/2014, 6:25:33 AM

Confirmations

6,322,863

Merkle Root

0e47e24891642ba9e806931bf1820f5e7da2ab76a19aab971dcd1e1e707c83f7
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.

7.769 × 10⁹⁹(100-digit number)
77696003597642422488…67701555300987043839
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
7.769 × 10⁹⁹(100-digit number)
77696003597642422488…67701555300987043839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.553 × 10¹⁰⁰(101-digit number)
15539200719528484497…35403110601974087679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.107 × 10¹⁰⁰(101-digit number)
31078401439056968995…70806221203948175359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.215 × 10¹⁰⁰(101-digit number)
62156802878113937990…41612442407896350719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.243 × 10¹⁰¹(102-digit number)
12431360575622787598…83224884815792701439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.486 × 10¹⁰¹(102-digit number)
24862721151245575196…66449769631585402879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.972 × 10¹⁰¹(102-digit number)
49725442302491150392…32899539263170805759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.945 × 10¹⁰¹(102-digit number)
99450884604982300785…65799078526341611519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.989 × 10¹⁰²(103-digit number)
19890176920996460157…31598157052683223039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.978 × 10¹⁰²(103-digit number)
39780353841992920314…63196314105366446079
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,755,376 XPM·at block #6,813,912 · 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