Block #546,185

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/15/2014, 6:08:46 PM · Difficulty 10.9554 · 6,271,837 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b5abace842ad9db00ae28aeb867ad7ca45390cfaaa07fddcb58ccd8a9072f29e

Height

#546,185

Difficulty

10.955379

Transactions

3

Size

655 B

Version

2

Bits

0af493b0

Nonce

3,839

Timestamp

5/15/2014, 6:08:46 PM

Confirmations

6,271,837

Merkle Root

5405d23501aa3270073c8849eb2794e5a7e935a7a8f92b083ad75a8df27d2e87
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.741 × 10¹⁰⁰(101-digit number)
17417884250590416904…82737615167851006801
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.741 × 10¹⁰⁰(101-digit number)
17417884250590416904…82737615167851006801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.483 × 10¹⁰⁰(101-digit number)
34835768501180833808…65475230335702013601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.967 × 10¹⁰⁰(101-digit number)
69671537002361667617…30950460671404027201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.393 × 10¹⁰¹(102-digit number)
13934307400472333523…61900921342808054401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.786 × 10¹⁰¹(102-digit number)
27868614800944667046…23801842685616108801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.573 × 10¹⁰¹(102-digit number)
55737229601889334093…47603685371232217601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.114 × 10¹⁰²(103-digit number)
11147445920377866818…95207370742464435201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.229 × 10¹⁰²(103-digit number)
22294891840755733637…90414741484928870401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.458 × 10¹⁰²(103-digit number)
44589783681511467275…80829482969857740801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.917 × 10¹⁰²(103-digit number)
89179567363022934550…61658965939715481601
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,788,243 XPM·at block #6,818,021 · 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