Block #457,079

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/23/2014, 3:50:08 PM · Difficulty 10.4201 · 6,350,835 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7e5c73ce1d2f863dda7fa87949b33f842d0af2b249343f34093480a55afcefac

Height

#457,079

Difficulty

10.420132

Transactions

2

Size

2.99 KB

Version

2

Bits

0a6b8dc4

Nonce

65,512

Timestamp

3/23/2014, 3:50:08 PM

Confirmations

6,350,835

Merkle Root

d040a42a977a1fd468758627c2c3f452322853be967733178c5c728c3b13bd6b
Transactions (2)
1 in → 1 out9.2300 XPM116 B
19 in → 1 out5.4640 XPM2.79 KB
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.418 × 10⁹⁹(100-digit number)
94184993101102489459…98800169745885486601
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.418 × 10⁹⁹(100-digit number)
94184993101102489459…98800169745885486601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.883 × 10¹⁰⁰(101-digit number)
18836998620220497891…97600339491770973201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.767 × 10¹⁰⁰(101-digit number)
37673997240440995783…95200678983541946401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.534 × 10¹⁰⁰(101-digit number)
75347994480881991567…90401357967083892801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.506 × 10¹⁰¹(102-digit number)
15069598896176398313…80802715934167785601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.013 × 10¹⁰¹(102-digit number)
30139197792352796627…61605431868335571201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.027 × 10¹⁰¹(102-digit number)
60278395584705593254…23210863736671142401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.205 × 10¹⁰²(103-digit number)
12055679116941118650…46421727473342284801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.411 × 10¹⁰²(103-digit number)
24111358233882237301…92843454946684569601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.822 × 10¹⁰²(103-digit number)
48222716467764474603…85686909893369139201
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,707,347 XPM·at block #6,807,913 · 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