Block #519,619

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/1/2014, 8:28:42 AM · Difficulty 10.8568 · 6,325,007 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
48cc860d489ca8b002b7e244f7cf4587239ca4b0b13af6f5a60387e77534e9c4

Height

#519,619

Difficulty

10.856753

Transactions

1

Size

662 B

Version

2

Bits

0adb542f

Nonce

185,148

Timestamp

5/1/2014, 8:28:42 AM

Confirmations

6,325,007

Merkle Root

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

2.049 × 10⁹⁴(95-digit number)
20495700627203182547…14085494261812457679
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
2.049 × 10⁹⁴(95-digit number)
20495700627203182547…14085494261812457679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.099 × 10⁹⁴(95-digit number)
40991401254406365095…28170988523624915359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.198 × 10⁹⁴(95-digit number)
81982802508812730191…56341977047249830719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.639 × 10⁹⁵(96-digit number)
16396560501762546038…12683954094499661439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.279 × 10⁹⁵(96-digit number)
32793121003525092076…25367908188999322879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.558 × 10⁹⁵(96-digit number)
65586242007050184153…50735816377998645759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.311 × 10⁹⁶(97-digit number)
13117248401410036830…01471632755997291519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.623 × 10⁹⁶(97-digit number)
26234496802820073661…02943265511994583039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.246 × 10⁹⁶(97-digit number)
52468993605640147322…05886531023989166079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.049 × 10⁹⁷(98-digit number)
10493798721128029464…11773062047978332159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.098 × 10⁹⁷(98-digit number)
20987597442256058928…23546124095956664319
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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:58,001,413 XPM·at block #6,844,625 · 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