Block #415,131

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/22/2014, 12:23:01 PM · Difficulty 10.4008 · 6,397,743 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5892f17e55e329bbf1119daafb8886342cd2376e0f4e239b322caf95bef1ed47

Height

#415,131

Difficulty

10.400838

Transactions

2

Size

3.16 KB

Version

2

Bits

0a669d51

Nonce

100,665,995

Timestamp

2/22/2014, 12:23:01 PM

Confirmations

6,397,743

Merkle Root

edf9b3806dc4f628540419f561fa2a6585222b340a97f0a73d109b7294973fa8
Transactions (2)
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.

3.333 × 10⁹⁶(97-digit number)
33330556819126490838…76571807835482511999
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
3.333 × 10⁹⁶(97-digit number)
33330556819126490838…76571807835482511999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.666 × 10⁹⁶(97-digit number)
66661113638252981677…53143615670965023999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.333 × 10⁹⁷(98-digit number)
13332222727650596335…06287231341930047999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.666 × 10⁹⁷(98-digit number)
26664445455301192671…12574462683860095999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.332 × 10⁹⁷(98-digit number)
53328890910602385342…25148925367720191999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.066 × 10⁹⁸(99-digit number)
10665778182120477068…50297850735440383999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.133 × 10⁹⁸(99-digit number)
21331556364240954136…00595701470880767999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.266 × 10⁹⁸(99-digit number)
42663112728481908273…01191402941761535999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.532 × 10⁹⁸(99-digit number)
85326225456963816547…02382805883523071999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.706 × 10⁹⁹(100-digit number)
17065245091392763309…04765611767046143999
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,747,023 XPM·at block #6,812,873 · 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.

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