Block #500,483

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/19/2014, 4:37:47 AM · Difficulty 10.8001 · 6,316,933 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
030a2c486d322a5444f8ee7986a958c000b089150bccbc74ccc08741252c0719

Height

#500,483

Difficulty

10.800148

Transactions

2

Size

1.75 KB

Version

2

Bits

0accd67f

Nonce

16,703

Timestamp

4/19/2014, 4:37:47 AM

Confirmations

6,316,933

Merkle Root

dcadb834eae9c8637a715e37129c6965c3f4b32f0e3a805adc6a1f0bf3fdabe7
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.512 × 10⁹⁵(96-digit number)
15124642815045938299…12563320283223749941
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.512 × 10⁹⁵(96-digit number)
15124642815045938299…12563320283223749941
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.024 × 10⁹⁵(96-digit number)
30249285630091876599…25126640566447499881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.049 × 10⁹⁵(96-digit number)
60498571260183753199…50253281132894999761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.209 × 10⁹⁶(97-digit number)
12099714252036750639…00506562265789999521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.419 × 10⁹⁶(97-digit number)
24199428504073501279…01013124531579999041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.839 × 10⁹⁶(97-digit number)
48398857008147002559…02026249063159998081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.679 × 10⁹⁶(97-digit number)
96797714016294005119…04052498126319996161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.935 × 10⁹⁷(98-digit number)
19359542803258801023…08104996252639992321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.871 × 10⁹⁷(98-digit number)
38719085606517602047…16209992505279984641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.743 × 10⁹⁷(98-digit number)
77438171213035204095…32419985010559969281
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,783,372 XPM·at block #6,817,415 · 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