Block #263,734

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/18/2013, 2:16:10 AM · Difficulty 9.9656 · 6,561,108 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
07ee5e0e2e784423994fd68027baf9581d8cb8d50609b8960d89edb35f857bf0

Height

#263,734

Difficulty

9.965563

Transactions

5

Size

5.34 KB

Version

2

Bits

09f72f1c

Nonce

115

Timestamp

11/18/2013, 2:16:10 AM

Confirmations

6,561,108

Merkle Root

99e94426e5eccfa3ee9de358c8b2c18019bcfe985f15408c6b76b862fcce664e
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.

7.096 × 10⁹⁶(97-digit number)
70966350156848024818…16391287339450744321
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
7.096 × 10⁹⁶(97-digit number)
70966350156848024818…16391287339450744321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.419 × 10⁹⁷(98-digit number)
14193270031369604963…32782574678901488641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.838 × 10⁹⁷(98-digit number)
28386540062739209927…65565149357802977281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.677 × 10⁹⁷(98-digit number)
56773080125478419855…31130298715605954561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.135 × 10⁹⁸(99-digit number)
11354616025095683971…62260597431211909121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.270 × 10⁹⁸(99-digit number)
22709232050191367942…24521194862423818241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.541 × 10⁹⁸(99-digit number)
45418464100382735884…49042389724847636481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.083 × 10⁹⁸(99-digit number)
90836928200765471768…98084779449695272961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.816 × 10⁹⁹(100-digit number)
18167385640153094353…96169558899390545921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.633 × 10⁹⁹(100-digit number)
36334771280306188707…92339117798781091841
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,842,816 XPM·at block #6,824,841 · 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