Block #493,956

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/15/2014, 10:35:40 PM · Difficulty 10.7107 · 6,337,697 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b64727c1d065f172c3290d70b0ab44cb7a94601254b7fa1c7eb78a6854c83281

Height

#493,956

Difficulty

10.710716

Transactions

5

Size

3.56 KB

Version

2

Bits

0ab5f178

Nonce

10,961,434

Timestamp

4/15/2014, 10:35:40 PM

Confirmations

6,337,697

Merkle Root

afd5e5c1aed2689edb7cadb4f264dbd1c3d8816fd2bdcff67d43e7ec850b2149
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.

5.532 × 10⁹⁴(95-digit number)
55325997003422104520…32653226630155242101
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
5.532 × 10⁹⁴(95-digit number)
55325997003422104520…32653226630155242101
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.106 × 10⁹⁵(96-digit number)
11065199400684420904…65306453260310484201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.213 × 10⁹⁵(96-digit number)
22130398801368841808…30612906520620968401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.426 × 10⁹⁵(96-digit number)
44260797602737683616…61225813041241936801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.852 × 10⁹⁵(96-digit number)
88521595205475367233…22451626082483873601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.770 × 10⁹⁶(97-digit number)
17704319041095073446…44903252164967747201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.540 × 10⁹⁶(97-digit number)
35408638082190146893…89806504329935494401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.081 × 10⁹⁶(97-digit number)
70817276164380293786…79613008659870988801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.416 × 10⁹⁷(98-digit number)
14163455232876058757…59226017319741977601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.832 × 10⁹⁷(98-digit number)
28326910465752117514…18452034639483955201
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,897,331 XPM·at block #6,831,652 · 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