Block #469,136

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/1/2014, 12:25:32 AM · Difficulty 10.4293 · 6,340,961 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
76518d703b73b375140175887eb16f969de991d31f7f3f82fb671387cbb8c427

Height

#469,136

Difficulty

10.429293

Transactions

6

Size

2.41 KB

Version

2

Bits

0a6de61d

Nonce

15,956,773

Timestamp

4/1/2014, 12:25:32 AM

Confirmations

6,340,961

Merkle Root

0671c8bae5defdfdc39229c8ddd8b1eedee0815bcd34a335e8453ebd4f558dea
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.

5.543 × 10⁹⁴(95-digit number)
55433839776162726462…59916462010181105801
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
5.543 × 10⁹⁴(95-digit number)
55433839776162726462…59916462010181105801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.108 × 10⁹⁵(96-digit number)
11086767955232545292…19832924020362211601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.217 × 10⁹⁵(96-digit number)
22173535910465090584…39665848040724423201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.434 × 10⁹⁵(96-digit number)
44347071820930181169…79331696081448846401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.869 × 10⁹⁵(96-digit number)
88694143641860362339…58663392162897692801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.773 × 10⁹⁶(97-digit number)
17738828728372072467…17326784325795385601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.547 × 10⁹⁶(97-digit number)
35477657456744144935…34653568651590771201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.095 × 10⁹⁶(97-digit number)
70955314913488289871…69307137303181542401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.419 × 10⁹⁷(98-digit number)
14191062982697657974…38614274606363084801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.838 × 10⁹⁷(98-digit number)
28382125965395315948…77228549212726169601
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,724,851 XPM·at block #6,810,096 · 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