Block #481,140

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/8/2014, 5:08:14 PM · Difficulty 10.5295 · 6,345,334 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9920891d67d91c94008cc707c8931e340ca0701dee6c6f0d29ed48bda1f9eac2

Height

#481,140

Difficulty

10.529502

Transactions

2

Size

727 B

Version

2

Bits

0a878d6c

Nonce

449

Timestamp

4/8/2014, 5:08:14 PM

Confirmations

6,345,334

Merkle Root

8fd4e2e1dca521dfcd77e25f3882c82c144b7b67e022d3149fe581408a961a15
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.559 × 10⁹³(94-digit number)
35595516007741868143…01691865278466433171
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.559 × 10⁹³(94-digit number)
35595516007741868143…01691865278466433171
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.119 × 10⁹³(94-digit number)
71191032015483736286…03383730556932866341
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.423 × 10⁹⁴(95-digit number)
14238206403096747257…06767461113865732681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.847 × 10⁹⁴(95-digit number)
28476412806193494514…13534922227731465361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.695 × 10⁹⁴(95-digit number)
56952825612386989029…27069844455462930721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.139 × 10⁹⁵(96-digit number)
11390565122477397805…54139688910925861441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.278 × 10⁹⁵(96-digit number)
22781130244954795611…08279377821851722881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.556 × 10⁹⁵(96-digit number)
45562260489909591223…16558755643703445761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.112 × 10⁹⁵(96-digit number)
91124520979819182446…33117511287406891521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.822 × 10⁹⁶(97-digit number)
18224904195963836489…66235022574813783041
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,855,929 XPM·at block #6,826,473 · 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