Block #889,649

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/10/2015, 11:44:25 AM · Difficulty 10.9545 · 5,937,236 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
21cc34d24858473aafb63329ab5fab67d5acbddcbf0a73c1aceff72cf6db2695

Height

#889,649

Difficulty

10.954468

Transactions

6

Size

2.56 KB

Version

2

Bits

0af45804

Nonce

1,138,382,347

Timestamp

1/10/2015, 11:44:25 AM

Confirmations

5,937,236

Merkle Root

64c00e19a33c9d6e35fe265d0557ad46e3d86c6cb728037dbc9f3f0b33649f34
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.

4.259 × 10⁹⁵(96-digit number)
42599357832888452019…74958540319681454719
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
4.259 × 10⁹⁵(96-digit number)
42599357832888452019…74958540319681454719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.519 × 10⁹⁵(96-digit number)
85198715665776904039…49917080639362909439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.703 × 10⁹⁶(97-digit number)
17039743133155380807…99834161278725818879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.407 × 10⁹⁶(97-digit number)
34079486266310761615…99668322557451637759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.815 × 10⁹⁶(97-digit number)
68158972532621523231…99336645114903275519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.363 × 10⁹⁷(98-digit number)
13631794506524304646…98673290229806551039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.726 × 10⁹⁷(98-digit number)
27263589013048609292…97346580459613102079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.452 × 10⁹⁷(98-digit number)
54527178026097218585…94693160919226204159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.090 × 10⁹⁸(99-digit number)
10905435605219443717…89386321838452408319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.181 × 10⁹⁸(99-digit number)
21810871210438887434…78772643676904816639
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,859,245 XPM·at block #6,826,884 · 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