Block #489,490

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/13/2014, 7:56:17 AM · Difficulty 10.6659 · 6,320,581 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0c57c2e4f0017ffa54b38120fe66e14552969b639f4351d97b6d29758bc4e57e

Height

#489,490

Difficulty

10.665918

Transactions

4

Size

1.01 KB

Version

2

Bits

0aaa7998

Nonce

10,091

Timestamp

4/13/2014, 7:56:17 AM

Confirmations

6,320,581

Merkle Root

b9471676804905a371b47b46dddb4e4cf92f6a48fd404a1726597818d55d09d4
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.006 × 10¹⁰⁰(101-digit number)
20066399343267889110…83193853483601592319
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.006 × 10¹⁰⁰(101-digit number)
20066399343267889110…83193853483601592319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.013 × 10¹⁰⁰(101-digit number)
40132798686535778221…66387706967203184639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.026 × 10¹⁰⁰(101-digit number)
80265597373071556442…32775413934406369279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.605 × 10¹⁰¹(102-digit number)
16053119474614311288…65550827868812738559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.210 × 10¹⁰¹(102-digit number)
32106238949228622577…31101655737625477119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.421 × 10¹⁰¹(102-digit number)
64212477898457245154…62203311475250954239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.284 × 10¹⁰²(103-digit number)
12842495579691449030…24406622950501908479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.568 × 10¹⁰²(103-digit number)
25684991159382898061…48813245901003816959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.136 × 10¹⁰²(103-digit number)
51369982318765796123…97626491802007633919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.027 × 10¹⁰³(104-digit number)
10273996463753159224…95252983604015267839
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,724,640 XPM·at block #6,810,070 · 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