Block #264,294

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/18/2013, 1:44:24 PM · Difficulty 9.9647 · 6,545,534 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a5a54f1e8f077bc58623679a9a8d248a04a453b1ddd3f0ca049a15c7dfdda3ea

Height

#264,294

Difficulty

9.964693

Transactions

17

Size

6.12 KB

Version

2

Bits

09f6f623

Nonce

98,190

Timestamp

11/18/2013, 1:44:24 PM

Confirmations

6,545,534

Merkle Root

4bc3829300441f8e36e2e1d5e86bef3202130cad1d5c9212925ab2691a12db48
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.725 × 10⁹²(93-digit number)
77259342009492932526…96478052199758865601
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.725 × 10⁹²(93-digit number)
77259342009492932526…96478052199758865601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.545 × 10⁹³(94-digit number)
15451868401898586505…92956104399517731201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.090 × 10⁹³(94-digit number)
30903736803797173010…85912208799035462401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.180 × 10⁹³(94-digit number)
61807473607594346020…71824417598070924801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.236 × 10⁹⁴(95-digit number)
12361494721518869204…43648835196141849601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.472 × 10⁹⁴(95-digit number)
24722989443037738408…87297670392283699201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.944 × 10⁹⁴(95-digit number)
49445978886075476816…74595340784567398401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.889 × 10⁹⁴(95-digit number)
98891957772150953633…49190681569134796801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.977 × 10⁹⁵(96-digit number)
19778391554430190726…98381363138269593601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.955 × 10⁹⁵(96-digit number)
39556783108860381453…96762726276539187201
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,722,709 XPM·at block #6,809,827 · 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.

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