Block #485,023

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/10/2014, 8:26:05 PM · Difficulty 10.6004 · 6,332,909 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a66b7aac7428a48d24507501131574c4362817b297696fa7704fe86ece032cac

Height

#485,023

Difficulty

10.600357

Transactions

9

Size

2.11 KB

Version

2

Bits

0a99b103

Nonce

115,612

Timestamp

4/10/2014, 8:26:05 PM

Confirmations

6,332,909

Merkle Root

0156dddaf658b50306b50f65a356edbb35e1a74d27bd31a17de725e012e97947
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.

3.300 × 10⁹³(94-digit number)
33004575658656154496…13363671335792952801
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
3.300 × 10⁹³(94-digit number)
33004575658656154496…13363671335792952801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.600 × 10⁹³(94-digit number)
66009151317312308992…26727342671585905601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.320 × 10⁹⁴(95-digit number)
13201830263462461798…53454685343171811201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.640 × 10⁹⁴(95-digit number)
26403660526924923597…06909370686343622401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.280 × 10⁹⁴(95-digit number)
52807321053849847194…13818741372687244801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.056 × 10⁹⁵(96-digit number)
10561464210769969438…27637482745374489601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.112 × 10⁹⁵(96-digit number)
21122928421539938877…55274965490748979201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.224 × 10⁹⁵(96-digit number)
42245856843079877755…10549930981497958401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.449 × 10⁹⁵(96-digit number)
84491713686159755511…21099861962995916801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.689 × 10⁹⁶(97-digit number)
16898342737231951102…42199723925991833601
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,787,523 XPM·at block #6,817,931 · 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