Block #485,299

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/10/2014, 11:46:42 PM · Difficulty 10.6060 · 6,331,175 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f50bcf66624a351661b5718260052eae947c89e5050f9c398c54b188a607c895

Height

#485,299

Difficulty

10.606050

Transactions

9

Size

2.14 KB

Version

2

Bits

0a9b2617

Nonce

225,877,463

Timestamp

4/10/2014, 11:46:42 PM

Confirmations

6,331,175

Merkle Root

acc08ed7c96623ea267bbeb346064bb586beddafd9a4726dc2640e2a91f4d22f
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.135 × 10⁹⁸(99-digit number)
21353984518983895062…59398284656724028639
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.135 × 10⁹⁸(99-digit number)
21353984518983895062…59398284656724028639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.270 × 10⁹⁸(99-digit number)
42707969037967790124…18796569313448057279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.541 × 10⁹⁸(99-digit number)
85415938075935580249…37593138626896114559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.708 × 10⁹⁹(100-digit number)
17083187615187116049…75186277253792229119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.416 × 10⁹⁹(100-digit number)
34166375230374232099…50372554507584458239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.833 × 10⁹⁹(100-digit number)
68332750460748464199…00745109015168916479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.366 × 10¹⁰⁰(101-digit number)
13666550092149692839…01490218030337832959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.733 × 10¹⁰⁰(101-digit number)
27333100184299385679…02980436060675665919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.466 × 10¹⁰⁰(101-digit number)
54666200368598771359…05960872121351331839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.093 × 10¹⁰¹(102-digit number)
10933240073719754271…11921744242702663679
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,775,922 XPM·at block #6,816,473 · 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