Block #493,868

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/15/2014, 9:28:41 PM · Difficulty 10.7094 · 6,332,717 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
04c9822077bcc703c5220d811469d7efd60f9224f4de0539301e3000a976f952

Height

#493,868

Difficulty

10.709437

Transactions

1

Size

970 B

Version

2

Bits

0ab59dac

Nonce

202,765

Timestamp

4/15/2014, 9:28:41 PM

Confirmations

6,332,717

Merkle Root

91b661a49449c5519a9e858fb956e3e7a1bf54dd9ed84e7447297377b3352aba
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.315 × 10⁹⁸(99-digit number)
23150050777781893153…73566125263748935681
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.315 × 10⁹⁸(99-digit number)
23150050777781893153…73566125263748935681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.630 × 10⁹⁸(99-digit number)
46300101555563786307…47132250527497871361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.260 × 10⁹⁸(99-digit number)
92600203111127572614…94264501054995742721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.852 × 10⁹⁹(100-digit number)
18520040622225514522…88529002109991485441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.704 × 10⁹⁹(100-digit number)
37040081244451029045…77058004219982970881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.408 × 10⁹⁹(100-digit number)
74080162488902058091…54116008439965941761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.481 × 10¹⁰⁰(101-digit number)
14816032497780411618…08232016879931883521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.963 × 10¹⁰⁰(101-digit number)
29632064995560823236…16464033759863767041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.926 × 10¹⁰⁰(101-digit number)
59264129991121646473…32928067519727534081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.185 × 10¹⁰¹(102-digit number)
11852825998224329294…65856135039455068161
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,856,830 XPM·at block #6,826,584 · 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