Block #266,428

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/20/2013, 10:45:27 AM · Difficulty 9.9606 · 6,550,707 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c215432bbeddc32b6c31d1f2ecb56d0949d8bfae8d7cbccfc7322aa541c7903a

Height

#266,428

Difficulty

9.960579

Transactions

4

Size

1.44 KB

Version

2

Bits

09f5e889

Nonce

2,298

Timestamp

11/20/2013, 10:45:27 AM

Confirmations

6,550,707

Merkle Root

4ae500e592e7ceefe27a8b8995912232ed6d4ad7a8bb5f293f38fd9299518afb
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.

4.708 × 10⁹²(93-digit number)
47087521956061862788…13832838007257845759
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
4.708 × 10⁹²(93-digit number)
47087521956061862788…13832838007257845759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.417 × 10⁹²(93-digit number)
94175043912123725576…27665676014515691519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.883 × 10⁹³(94-digit number)
18835008782424745115…55331352029031383039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.767 × 10⁹³(94-digit number)
37670017564849490230…10662704058062766079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.534 × 10⁹³(94-digit number)
75340035129698980461…21325408116125532159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.506 × 10⁹⁴(95-digit number)
15068007025939796092…42650816232251064319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.013 × 10⁹⁴(95-digit number)
30136014051879592184…85301632464502128639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.027 × 10⁹⁴(95-digit number)
60272028103759184369…70603264929004257279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.205 × 10⁹⁵(96-digit number)
12054405620751836873…41206529858008514559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.410 × 10⁹⁵(96-digit number)
24108811241503673747…82413059716017029119
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,781,115 XPM·at block #6,817,134 · 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