Block #604,713

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/28/2014, 12:17:34 AM · Difficulty 10.9101 · 6,220,560 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d0920d847fe415e23cf65e5da1dcd4e5cc76ffb5840d1aa66dad85210e5901ae

Height

#604,713

Difficulty

10.910074

Transactions

4

Size

887 B

Version

2

Bits

0ae8fa9c

Nonce

569,531,977

Timestamp

6/28/2014, 12:17:34 AM

Confirmations

6,220,560

Merkle Root

2c9fe71d82a922c9ed9156e98f9f190d94ae9389eb73f6b6a7a1917e27d59440
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.885 × 10⁹⁸(99-digit number)
28854326951902137769…58593859691840108479
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.885 × 10⁹⁸(99-digit number)
28854326951902137769…58593859691840108479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.770 × 10⁹⁸(99-digit number)
57708653903804275539…17187719383680216959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.154 × 10⁹⁹(100-digit number)
11541730780760855107…34375438767360433919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.308 × 10⁹⁹(100-digit number)
23083461561521710215…68750877534720867839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.616 × 10⁹⁹(100-digit number)
46166923123043420431…37501755069441735679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.233 × 10⁹⁹(100-digit number)
92333846246086840863…75003510138883471359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.846 × 10¹⁰⁰(101-digit number)
18466769249217368172…50007020277766942719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.693 × 10¹⁰⁰(101-digit number)
36933538498434736345…00014040555533885439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.386 × 10¹⁰⁰(101-digit number)
73867076996869472690…00028081111067770879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.477 × 10¹⁰¹(102-digit number)
14773415399373894538…00056162222135541759
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,846,281 XPM·at block #6,825,272 · 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