Block #264,835

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/19/2013, 1:05:07 AM · Difficulty 9.9637 · 6,552,417 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5145d6131a9cd80817002d037a2e64682db20b7532acd57c8b6b28be7dba9919

Height

#264,835

Difficulty

9.963724

Transactions

3

Size

826 B

Version

2

Bits

09f6b69d

Nonce

20,808

Timestamp

11/19/2013, 1:05:07 AM

Confirmations

6,552,417

Merkle Root

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

6.555 × 10⁹⁴(95-digit number)
65552169687812693074…08984800987612065101
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
6.555 × 10⁹⁴(95-digit number)
65552169687812693074…08984800987612065101
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.311 × 10⁹⁵(96-digit number)
13110433937562538614…17969601975224130201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.622 × 10⁹⁵(96-digit number)
26220867875125077229…35939203950448260401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.244 × 10⁹⁵(96-digit number)
52441735750250154459…71878407900896520801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.048 × 10⁹⁶(97-digit number)
10488347150050030891…43756815801793041601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.097 × 10⁹⁶(97-digit number)
20976694300100061783…87513631603586083201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.195 × 10⁹⁶(97-digit number)
41953388600200123567…75027263207172166401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.390 × 10⁹⁶(97-digit number)
83906777200400247135…50054526414344332801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.678 × 10⁹⁷(98-digit number)
16781355440080049427…00109052828688665601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.356 × 10⁹⁷(98-digit number)
33562710880160098854…00218105657377331201
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,782,050 XPM·at block #6,817,251 · 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