Block #545,126

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/15/2014, 5:37:29 AM · Difficulty 10.9525 · 6,297,317 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
92b8253491c9f61a1cd303af1464c0985015b90d759ab9c056cb9f8cc63aaaa1

Height

#545,126

Difficulty

10.952525

Transactions

1

Size

732 B

Version

2

Bits

0af3d8ae

Nonce

575

Timestamp

5/15/2014, 5:37:29 AM

Confirmations

6,297,317

Merkle Root

b200bbc3b7e87483cffda6d184c7b4077afca47a86059d44a7a2db9df0a8a8ed
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.476 × 10⁹⁶(97-digit number)
14769824425690857344…62358648838047744001
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.476 × 10⁹⁶(97-digit number)
14769824425690857344…62358648838047744001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.953 × 10⁹⁶(97-digit number)
29539648851381714688…24717297676095488001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.907 × 10⁹⁶(97-digit number)
59079297702763429376…49434595352190976001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.181 × 10⁹⁷(98-digit number)
11815859540552685875…98869190704381952001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.363 × 10⁹⁷(98-digit number)
23631719081105371750…97738381408763904001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.726 × 10⁹⁷(98-digit number)
47263438162210743501…95476762817527808001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.452 × 10⁹⁷(98-digit number)
94526876324421487002…90953525635055616001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.890 × 10⁹⁸(99-digit number)
18905375264884297400…81907051270111232001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.781 × 10⁹⁸(99-digit number)
37810750529768594801…63814102540222464001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.562 × 10⁹⁸(99-digit number)
75621501059537189602…27628205080444928001
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,983,960 XPM·at block #6,842,442 · 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