Block #485,857

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/11/2014, 7:24:38 AM · Difficulty 10.6139 · 6,321,349 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
465693e919ae05f358e39a4b326d7245bd2030dd184f8e53d5751516656d947b

Height

#485,857

Difficulty

10.613882

Transactions

6

Size

1.74 KB

Version

2

Bits

0a9d2760

Nonce

6,007

Timestamp

4/11/2014, 7:24:38 AM

Confirmations

6,321,349

Merkle Root

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

1.470 × 10⁹⁹(100-digit number)
14702804292592655478…61946658058232633121
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
1.470 × 10⁹⁹(100-digit number)
14702804292592655478…61946658058232633121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.940 × 10⁹⁹(100-digit number)
29405608585185310956…23893316116465266241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.881 × 10⁹⁹(100-digit number)
58811217170370621912…47786632232930532481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.176 × 10¹⁰⁰(101-digit number)
11762243434074124382…95573264465861064961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.352 × 10¹⁰⁰(101-digit number)
23524486868148248765…91146528931722129921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.704 × 10¹⁰⁰(101-digit number)
47048973736296497530…82293057863444259841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.409 × 10¹⁰⁰(101-digit number)
94097947472592995060…64586115726888519681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.881 × 10¹⁰¹(102-digit number)
18819589494518599012…29172231453777039361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.763 × 10¹⁰¹(102-digit number)
37639178989037198024…58344462907554078721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.527 × 10¹⁰¹(102-digit number)
75278357978074396048…16688925815108157441
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,701,663 XPM·at block #6,807,205 · 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