Block #472,830

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/3/2014, 12:35:11 PM · Difficulty 10.4409 · 6,343,916 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9e99479a095bf24468359ba18e82893b040a820b538a4ced4632590fb5e3bc82

Height

#472,830

Difficulty

10.440908

Transactions

1

Size

867 B

Version

2

Bits

0a70df56

Nonce

18,173

Timestamp

4/3/2014, 12:35:11 PM

Confirmations

6,343,916

Merkle Root

6296eaf4ba8192dfebb13c8dc304a7805be2acda972fe9f81577a6001cbf8170
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.

8.129 × 10⁹⁵(96-digit number)
81294502709300218682…22717853223983710401
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
8.129 × 10⁹⁵(96-digit number)
81294502709300218682…22717853223983710401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.625 × 10⁹⁶(97-digit number)
16258900541860043736…45435706447967420801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.251 × 10⁹⁶(97-digit number)
32517801083720087473…90871412895934841601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.503 × 10⁹⁶(97-digit number)
65035602167440174946…81742825791869683201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.300 × 10⁹⁷(98-digit number)
13007120433488034989…63485651583739366401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.601 × 10⁹⁷(98-digit number)
26014240866976069978…26971303167478732801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.202 × 10⁹⁷(98-digit number)
52028481733952139956…53942606334957465601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.040 × 10⁹⁸(99-digit number)
10405696346790427991…07885212669914931201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.081 × 10⁹⁸(99-digit number)
20811392693580855982…15770425339829862401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.162 × 10⁹⁸(99-digit number)
41622785387161711965…31540850679659724801
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,778,005 XPM·at block #6,816,745 · 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