Block #495,706

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/16/2014, 6:10:16 PM · Difficulty 10.7422 · 6,329,850 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6e214eb7893826619555f1801077ae0206253016ca77656044c4f10a550b6b48

Height

#495,706

Difficulty

10.742241

Transactions

5

Size

1.08 KB

Version

2

Bits

0abe0389

Nonce

7,074,815

Timestamp

4/16/2014, 6:10:16 PM

Confirmations

6,329,850

Merkle Root

ab4dc7387667bb047483d57e4274fc4d7fbf8c38ea77cc4565f8991b50ac5a68
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.780 × 10⁹⁷(98-digit number)
17805657028712267875…12721209050172211199
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.780 × 10⁹⁷(98-digit number)
17805657028712267875…12721209050172211199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.561 × 10⁹⁷(98-digit number)
35611314057424535750…25442418100344422399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.122 × 10⁹⁷(98-digit number)
71222628114849071500…50884836200688844799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.424 × 10⁹⁸(99-digit number)
14244525622969814300…01769672401377689599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.848 × 10⁹⁸(99-digit number)
28489051245939628600…03539344802755379199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.697 × 10⁹⁸(99-digit number)
56978102491879257200…07078689605510758399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.139 × 10⁹⁹(100-digit number)
11395620498375851440…14157379211021516799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.279 × 10⁹⁹(100-digit number)
22791240996751702880…28314758422043033599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.558 × 10⁹⁹(100-digit number)
45582481993503405760…56629516844086067199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.116 × 10⁹⁹(100-digit number)
91164963987006811521…13259033688172134399
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,848,548 XPM·at block #6,825,555 · 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