Block #480,507

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/8/2014, 8:38:22 AM · Difficulty 10.5176 · 6,326,842 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1c2ccdb127f160d5f1f34074454e02cd651fe1ae67cdde3444760269b3e9ff60

Height

#480,507

Difficulty

10.517632

Transactions

4

Size

2.17 KB

Version

2

Bits

0a84838a

Nonce

133,333

Timestamp

4/8/2014, 8:38:22 AM

Confirmations

6,326,842

Merkle Root

5da7e5874a7c93ba468d1a3798a64be61e68db8ea44ecd46c028c7e9378aebde
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.

6.660 × 10⁹⁸(99-digit number)
66604837502252972547…46052161543516481599
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
6.660 × 10⁹⁸(99-digit number)
66604837502252972547…46052161543516481599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.332 × 10⁹⁹(100-digit number)
13320967500450594509…92104323087032963199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.664 × 10⁹⁹(100-digit number)
26641935000901189019…84208646174065926399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.328 × 10⁹⁹(100-digit number)
53283870001802378038…68417292348131852799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.065 × 10¹⁰⁰(101-digit number)
10656774000360475607…36834584696263705599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.131 × 10¹⁰⁰(101-digit number)
21313548000720951215…73669169392527411199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.262 × 10¹⁰⁰(101-digit number)
42627096001441902430…47338338785054822399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.525 × 10¹⁰⁰(101-digit number)
85254192002883804861…94676677570109644799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.705 × 10¹⁰¹(102-digit number)
17050838400576760972…89353355140219289599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.410 × 10¹⁰¹(102-digit number)
34101676801153521944…78706710280438579199
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,702,812 XPM·at block #6,807,348 · 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