Block #491,734

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/14/2014, 4:29:17 PM · Difficulty 10.6850 · 6,318,450 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
dddcfb7502d6d6ddf687c59bb736cd9c2a030efd69d05272d5b97b9f8eb37282

Height

#491,734

Difficulty

10.685040

Transactions

15

Size

44.00 KB

Version

2

Bits

0aaf5ecc

Nonce

305,220,211

Timestamp

4/14/2014, 4:29:17 PM

Confirmations

6,318,450

Merkle Root

25d94c95f5ddc9e5ab1dd8fb2f858c2925e7767d1fe9ff6e01aefa79bb8dcb80
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.

1.534 × 10⁹⁸(99-digit number)
15347356384520369966…53790558849243870079
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
1.534 × 10⁹⁸(99-digit number)
15347356384520369966…53790558849243870079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.069 × 10⁹⁸(99-digit number)
30694712769040739933…07581117698487740159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.138 × 10⁹⁸(99-digit number)
61389425538081479866…15162235396975480319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.227 × 10⁹⁹(100-digit number)
12277885107616295973…30324470793950960639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.455 × 10⁹⁹(100-digit number)
24555770215232591946…60648941587901921279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.911 × 10⁹⁹(100-digit number)
49111540430465183893…21297883175803842559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.822 × 10⁹⁹(100-digit number)
98223080860930367786…42595766351607685119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.964 × 10¹⁰⁰(101-digit number)
19644616172186073557…85191532703215370239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.928 × 10¹⁰⁰(101-digit number)
39289232344372147114…70383065406430740479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.857 × 10¹⁰⁰(101-digit number)
78578464688744294229…40766130812861480959
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,725,541 XPM·at block #6,810,183 · 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