Block #477,199

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/6/2014, 7:59:59 AM · Difficulty 10.4781 · 6,333,322 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
891ddda4d15cbe1d60ea0bf2a0775de14c5e7e36f0bc97c78053e3ebfc0a23c4

Height

#477,199

Difficulty

10.478050

Transactions

4

Size

1.80 KB

Version

2

Bits

0a7a6180

Nonce

24,917

Timestamp

4/6/2014, 7:59:59 AM

Confirmations

6,333,322

Merkle Root

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

9.336 × 10¹⁰⁰(101-digit number)
93364387645778810918…32497125931624980481
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
9.336 × 10¹⁰⁰(101-digit number)
93364387645778810918…32497125931624980481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.867 × 10¹⁰¹(102-digit number)
18672877529155762183…64994251863249960961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.734 × 10¹⁰¹(102-digit number)
37345755058311524367…29988503726499921921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.469 × 10¹⁰¹(102-digit number)
74691510116623048734…59977007452999843841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.493 × 10¹⁰²(103-digit number)
14938302023324609746…19954014905999687681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.987 × 10¹⁰²(103-digit number)
29876604046649219493…39908029811999375361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.975 × 10¹⁰²(103-digit number)
59753208093298438987…79816059623998750721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.195 × 10¹⁰³(104-digit number)
11950641618659687797…59632119247997501441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.390 × 10¹⁰³(104-digit number)
23901283237319375595…19264238495995002881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.780 × 10¹⁰³(104-digit number)
47802566474638751190…38528476991990005761
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,728,254 XPM·at block #6,810,520 · 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