Block #264,144

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/18/2013, 10:45:15 AM · Difficulty 9.9649 · 6,545,989 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bb5df1c4a252e86bc50d7e9f3eb3768eebdee85d2350aa786f0534b3e02db676

Height

#264,144

Difficulty

9.964898

Transactions

6

Size

1.62 KB

Version

2

Bits

09f70390

Nonce

49,228

Timestamp

11/18/2013, 10:45:15 AM

Confirmations

6,545,989

Merkle Root

77f7f1d88dcc0507958fa1702dd8db30de4a26c18679047478042873890c13cc
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.723 × 10⁹⁰(91-digit number)
77235986900735760745…68150357151285460571
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.723 × 10⁹⁰(91-digit number)
77235986900735760745…68150357151285460571
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.544 × 10⁹¹(92-digit number)
15447197380147152149…36300714302570921141
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.089 × 10⁹¹(92-digit number)
30894394760294304298…72601428605141842281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.178 × 10⁹¹(92-digit number)
61788789520588608596…45202857210283684561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.235 × 10⁹²(93-digit number)
12357757904117721719…90405714420567369121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.471 × 10⁹²(93-digit number)
24715515808235443438…80811428841134738241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.943 × 10⁹²(93-digit number)
49431031616470886877…61622857682269476481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.886 × 10⁹²(93-digit number)
98862063232941773754…23245715364538952961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.977 × 10⁹³(94-digit number)
19772412646588354750…46491430729077905921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.954 × 10⁹³(94-digit number)
39544825293176709501…92982861458155811841
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,725,131 XPM·at block #6,810,132 · 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