Block #285,018

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/30/2013, 8:30:23 AM · Difficulty 9.9836 · 6,546,028 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a67b9a2c059a4ed75ec74b3baebe2b857e313b23a2fc6b8cbf5869bae253ef3e

Height

#285,018

Difficulty

9.983615

Transactions

9

Size

3.26 KB

Version

2

Bits

09fbce31

Nonce

32,611

Timestamp

11/30/2013, 8:30:23 AM

Confirmations

6,546,028

Merkle Root

8426e2996e3a318ad08b9053675bbac5e65c91a0a20e326487db50831513de57
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.234 × 10⁹²(93-digit number)
12340383327248244306…63785772078345881559
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.234 × 10⁹²(93-digit number)
12340383327248244306…63785772078345881559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.468 × 10⁹²(93-digit number)
24680766654496488612…27571544156691763119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.936 × 10⁹²(93-digit number)
49361533308992977225…55143088313383526239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.872 × 10⁹²(93-digit number)
98723066617985954450…10286176626767052479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.974 × 10⁹³(94-digit number)
19744613323597190890…20572353253534104959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.948 × 10⁹³(94-digit number)
39489226647194381780…41144706507068209919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.897 × 10⁹³(94-digit number)
78978453294388763560…82289413014136419839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.579 × 10⁹⁴(95-digit number)
15795690658877752712…64578826028272839679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.159 × 10⁹⁴(95-digit number)
31591381317755505424…29157652056545679359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.318 × 10⁹⁴(95-digit number)
63182762635511010848…58315304113091358719
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,892,506 XPM·at block #6,831,045 · 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