Block #286,876

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/1/2013, 2:02:56 AM · Difficulty 9.9861 · 6,530,805 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a546b5cf58bd17e975a660af046fa612aa4ac8a12a72883c7d06caafc8a64624

Height

#286,876

Difficulty

9.986089

Transactions

4

Size

1.00 KB

Version

2

Bits

09fc7056

Nonce

77,497

Timestamp

12/1/2013, 2:02:56 AM

Confirmations

6,530,805

Merkle Root

a36ea6a79cba535a06ff8d086ec7a696eacb2a46a6b65217c33d1c489b4bb06f
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.113 × 10⁹⁶(97-digit number)
41135386629580760642…07999063774009574399
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.113 × 10⁹⁶(97-digit number)
41135386629580760642…07999063774009574399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.227 × 10⁹⁶(97-digit number)
82270773259161521284…15998127548019148799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.645 × 10⁹⁷(98-digit number)
16454154651832304256…31996255096038297599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.290 × 10⁹⁷(98-digit number)
32908309303664608513…63992510192076595199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.581 × 10⁹⁷(98-digit number)
65816618607329217027…27985020384153190399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.316 × 10⁹⁸(99-digit number)
13163323721465843405…55970040768306380799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.632 × 10⁹⁸(99-digit number)
26326647442931686810…11940081536612761599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.265 × 10⁹⁸(99-digit number)
52653294885863373621…23880163073225523199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.053 × 10⁹⁹(100-digit number)
10530658977172674724…47760326146451046399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.106 × 10⁹⁹(100-digit number)
21061317954345349448…95520652292902092799
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,785,505 XPM·at block #6,817,680 · 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