Block #410,566

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/19/2014, 4:01:27 AM · Difficulty 10.4287 · 6,405,780 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e22587bace22a747ec1c18ccb0968e6b37d872766a67eda8633d865b1ba27166

Height

#410,566

Difficulty

10.428736

Transactions

1

Size

901 B

Version

2

Bits

0a6dc1a2

Nonce

124,147

Timestamp

2/19/2014, 4:01:27 AM

Confirmations

6,405,780

Merkle Root

eb9b65c84c31670c37b44f0ac60e2eca26edb45aaa111e2fb6d609e1111f2512
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.

7.582 × 10⁹⁵(96-digit number)
75824176222863124803…63838896330293048319
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
7.582 × 10⁹⁵(96-digit number)
75824176222863124803…63838896330293048319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.516 × 10⁹⁶(97-digit number)
15164835244572624960…27677792660586096639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.032 × 10⁹⁶(97-digit number)
30329670489145249921…55355585321172193279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.065 × 10⁹⁶(97-digit number)
60659340978290499842…10711170642344386559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.213 × 10⁹⁷(98-digit number)
12131868195658099968…21422341284688773119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.426 × 10⁹⁷(98-digit number)
24263736391316199937…42844682569377546239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.852 × 10⁹⁷(98-digit number)
48527472782632399874…85689365138755092479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.705 × 10⁹⁷(98-digit number)
97054945565264799748…71378730277510184959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.941 × 10⁹⁸(99-digit number)
19410989113052959949…42757460555020369919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.882 × 10⁹⁸(99-digit number)
38821978226105919899…85514921110040739839
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,774,892 XPM·at block #6,816,345 · 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