Block #493,357

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/15/2014, 4:02:52 PM · Difficulty 10.6985 · 6,333,218 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
939700b1cbcac64acac06c899e24a417e0c6f497dd489b9cb8e1b6c51a696439

Height

#493,357

Difficulty

10.698492

Transactions

3

Size

1.01 KB

Version

2

Bits

0ab2d057

Nonce

39,897,845

Timestamp

4/15/2014, 4:02:52 PM

Confirmations

6,333,218

Merkle Root

4630170c3189d7cde1d099c9c598dba7aa0497b0ef3bd46046522f80bb07e626
Transactions (3)
1 in → 1 out8.7400 XPM116 B
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.

1.269 × 10¹⁰⁰(101-digit number)
12697867322301983232…00634500517253468161
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
1.269 × 10¹⁰⁰(101-digit number)
12697867322301983232…00634500517253468161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.539 × 10¹⁰⁰(101-digit number)
25395734644603966464…01269001034506936321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.079 × 10¹⁰⁰(101-digit number)
50791469289207932928…02538002069013872641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.015 × 10¹⁰¹(102-digit number)
10158293857841586585…05076004138027745281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.031 × 10¹⁰¹(102-digit number)
20316587715683173171…10152008276055490561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.063 × 10¹⁰¹(102-digit number)
40633175431366346342…20304016552110981121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.126 × 10¹⁰¹(102-digit number)
81266350862732692685…40608033104221962241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.625 × 10¹⁰²(103-digit number)
16253270172546538537…81216066208443924481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.250 × 10¹⁰²(103-digit number)
32506540345093077074…62432132416887848961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.501 × 10¹⁰²(103-digit number)
65013080690186154148…24864264833775697921
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,749 XPM·at block #6,826,574 · 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