Block #269,115

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/22/2013, 6:46:14 PM · Difficulty 9.9552 · 6,545,969 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5ed19cf4ce29dbc997c7b51b4a61344668fd389cb02560e365d83aa85761ca79

Height

#269,115

Difficulty

9.955170

Transactions

6

Size

2.41 KB

Version

2

Bits

09f48604

Nonce

7,363

Timestamp

11/22/2013, 6:46:14 PM

Confirmations

6,545,969

Merkle Root

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

8.825 × 10¹⁰¹(102-digit number)
88257042375269635394…11687663447933392019
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
8.825 × 10¹⁰¹(102-digit number)
88257042375269635394…11687663447933392019
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.765 × 10¹⁰²(103-digit number)
17651408475053927078…23375326895866784039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.530 × 10¹⁰²(103-digit number)
35302816950107854157…46750653791733568079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.060 × 10¹⁰²(103-digit number)
70605633900215708315…93501307583467136159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.412 × 10¹⁰³(104-digit number)
14121126780043141663…87002615166934272319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.824 × 10¹⁰³(104-digit number)
28242253560086283326…74005230333868544639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.648 × 10¹⁰³(104-digit number)
56484507120172566652…48010460667737089279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.129 × 10¹⁰⁴(105-digit number)
11296901424034513330…96020921335474178559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.259 × 10¹⁰⁴(105-digit number)
22593802848069026660…92041842670948357119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.518 × 10¹⁰⁴(105-digit number)
45187605696138053321…84083685341896714239
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,764,759 XPM·at block #6,815,083 · 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