Block #483,963

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/10/2014, 8:00:57 AM · Difficulty 10.5742 · 6,342,148 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9865fa3f209507010e9c33bc840d24e3c025386788ce73e6cd3587dd0d448a6c

Height

#483,963

Difficulty

10.574153

Transactions

8

Size

2.04 KB

Version

2

Bits

0a92fbaf

Nonce

36,102,857

Timestamp

4/10/2014, 8:00:57 AM

Confirmations

6,342,148

Merkle Root

406333f9dbe42428ef889282cd4c330d2eb269b2980716ba87196d9320105008
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.541 × 10⁹⁷(98-digit number)
85418830347014989691…88406729569505811441
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.541 × 10⁹⁷(98-digit number)
85418830347014989691…88406729569505811441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.708 × 10⁹⁸(99-digit number)
17083766069402997938…76813459139011622881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.416 × 10⁹⁸(99-digit number)
34167532138805995876…53626918278023245761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.833 × 10⁹⁸(99-digit number)
68335064277611991753…07253836556046491521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.366 × 10⁹⁹(100-digit number)
13667012855522398350…14507673112092983041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.733 × 10⁹⁹(100-digit number)
27334025711044796701…29015346224185966081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.466 × 10⁹⁹(100-digit number)
54668051422089593402…58030692448371932161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.093 × 10¹⁰⁰(101-digit number)
10933610284417918680…16061384896743864321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.186 × 10¹⁰⁰(101-digit number)
21867220568835837361…32122769793487728641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.373 × 10¹⁰⁰(101-digit number)
43734441137671674722…64245539586975457281
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,853,012 XPM·at block #6,826,110 · 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