Block #279,791

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/28/2013, 11:23:11 AM · Difficulty 9.9728 · 6,550,660 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5146de278eb70d9b3e77ea53f7552c723d0f9f1581411d889547b74d1f8fc211

Height

#279,791

Difficulty

9.972775

Transactions

6

Size

6.82 KB

Version

2

Bits

09f907ca

Nonce

3,443

Timestamp

11/28/2013, 11:23:11 AM

Confirmations

6,550,660

Merkle Root

0bdb5276e4bed978b232d2d9fab8e556b84e5d742f2368f73d707c9aaa3220b0
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.

1.510 × 10¹⁰¹(102-digit number)
15104247434403580917…70407316874638615039
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
1.510 × 10¹⁰¹(102-digit number)
15104247434403580917…70407316874638615039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.020 × 10¹⁰¹(102-digit number)
30208494868807161834…40814633749277230079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.041 × 10¹⁰¹(102-digit number)
60416989737614323668…81629267498554460159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.208 × 10¹⁰²(103-digit number)
12083397947522864733…63258534997108920319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.416 × 10¹⁰²(103-digit number)
24166795895045729467…26517069994217840639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.833 × 10¹⁰²(103-digit number)
48333591790091458934…53034139988435681279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.666 × 10¹⁰²(103-digit number)
96667183580182917869…06068279976871362559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.933 × 10¹⁰³(104-digit number)
19333436716036583573…12136559953742725119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.866 × 10¹⁰³(104-digit number)
38666873432073167147…24273119907485450239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.733 × 10¹⁰³(104-digit number)
77333746864146334295…48546239814970900479
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,887,853 XPM·at block #6,830,450 · 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