Block #477,935

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/6/2014, 6:31:42 PM · Difficulty 10.4888 · 6,332,828 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a4fd801260b6aa39f67b490eab672c49f9230861bdb9668c3e09e2e1e9d03828

Height

#477,935

Difficulty

10.488794

Transactions

2

Size

434 B

Version

2

Bits

0a7d2193

Nonce

29,116

Timestamp

4/6/2014, 6:31:42 PM

Confirmations

6,332,828

Merkle Root

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

2.831 × 10⁹⁸(99-digit number)
28319103076422671125…20026736288062081551
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
2.831 × 10⁹⁸(99-digit number)
28319103076422671125…20026736288062081551
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.663 × 10⁹⁸(99-digit number)
56638206152845342251…40053472576124163101
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.132 × 10⁹⁹(100-digit number)
11327641230569068450…80106945152248326201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.265 × 10⁹⁹(100-digit number)
22655282461138136900…60213890304496652401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.531 × 10⁹⁹(100-digit number)
45310564922276273801…20427780608993304801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.062 × 10⁹⁹(100-digit number)
90621129844552547602…40855561217986609601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.812 × 10¹⁰⁰(101-digit number)
18124225968910509520…81711122435973219201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.624 × 10¹⁰⁰(101-digit number)
36248451937821019041…63422244871946438401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.249 × 10¹⁰⁰(101-digit number)
72496903875642038082…26844489743892876801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.449 × 10¹⁰¹(102-digit number)
14499380775128407616…53688979487785753601
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,730,198 XPM·at block #6,810,762 · 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