Block #904,976

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/22/2015, 8:01:08 AM · Difficulty 10.9364 · 5,904,912 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
520a0d2224f1f449aaf2c26df92f987dbbe55321131904eca031081479b631fe

Height

#904,976

Difficulty

10.936408

Transactions

3

Size

1.21 KB

Version

2

Bits

0aefb873

Nonce

724,800,318

Timestamp

1/22/2015, 8:01:08 AM

Confirmations

5,904,912

Merkle Root

c3cc30325f9ac7bff105a4bfa3f56351bfb3ac62298f2cafc63ff04daac52e27
Transactions (3)
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.631 × 10⁹⁵(96-digit number)
46311357772249615519…24598993533274286079
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.631 × 10⁹⁵(96-digit number)
46311357772249615519…24598993533274286079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.262 × 10⁹⁵(96-digit number)
92622715544499231038…49197987066548572159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.852 × 10⁹⁶(97-digit number)
18524543108899846207…98395974133097144319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.704 × 10⁹⁶(97-digit number)
37049086217799692415…96791948266194288639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.409 × 10⁹⁶(97-digit number)
74098172435599384830…93583896532388577279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.481 × 10⁹⁷(98-digit number)
14819634487119876966…87167793064777154559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.963 × 10⁹⁷(98-digit number)
29639268974239753932…74335586129554309119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.927 × 10⁹⁷(98-digit number)
59278537948479507864…48671172259108618239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.185 × 10⁹⁸(99-digit number)
11855707589695901572…97342344518217236479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.371 × 10⁹⁸(99-digit number)
23711415179391803145…94684689036434472959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.742 × 10⁹⁸(99-digit number)
47422830358783606291…89369378072868945919
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,723,192 XPM·at block #6,809,887 · 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