Find JSRs
Submit this Search


Ad Banner
 
 
 
 
What's New
Java Community Process EC Elections
 
2023 Executive Committee (EC) Election

The 2023 Fall Executive Committee Elections process is now complete. The EC Elections process was launched in June 2000. This election was hosted by Votenet and closed on 20 November 2023 at 11:59 PM Pacific Standard Time.

The elections results are published. Congratulations to the newly elected and re-elected EC Members, and thank you to all the nominees and JCP Members for participating in this year's election!


As of 2021, the JCP Executive Committee is composed of 11 Ratified Seats, 4 Elected Seats, 2 Associate Seats and the permanent seat held by Oracle America. The 2-year terms for the seats are staggered so that 8 or 9 of the seats are up for election each year. This year, there are 5 Ratified, 2 Elected, and 1 Associate Seat up for election. Please refer to the 2023 Executive Committee Elections Nominees page for this year's candidates' details.

The recording of the Meet the JCP EC Candidates Zoom webinar from October 26 is now available.

Please refer to the Executive Committee Information page for more information about the EC.


TIMELINE FOR 2023 EC ELECTION
19 September - 2 October 2023 Nominations open for Elected and Associate Seats
26 September 2023 Voter eligibility deadline
26 October 2023 Meet the JCP EC Candidates Zoom webinar (EC nominees should attend)
7 - 20 November 2023 Ballot open for voting
21 November 2023 Election results available
5 December 2023 New EC members take office



ELECTION TIEBREAKER

In the Java Community Process document version 2.11, section 3.7.6 mentions a method of deciding the winner in case of a tie. In greater detail, this is the process which will be used in the case of any ties in this year's election:

In the case of a tie in the Executive Committee Elections, the JCP Program Management Office will use the SHA-512 algorithm to determine the winner. In order for the drawing to be as random as possible, the PMO will take the following steps:

1. At 10 AM PST on the Tuesday following the last day of the ballot, the PMO will assign a number (1, 2, 3, etc) to each of the tied candidates based on the closing value of the NASDAQ Composite Index as shown on http:/quotes.wsj.com/index/NASDAQ/historical-prices for the last day of the ballot. If the closing value's whole number (ignoring any fractional part of the number) is even, the PMO will assign the numbers to the tied candidates alphabetically by name (last name in the case of an individual). If the closing value's whole number is odd, the PMO will assign the numbers to the candidates in reverse alphabetical order by name (last name for an individual).

2. At 10 AM PST on the first day following the last day of the ballot that we have all of the input numbers (described below), the PMO will use the SHA-512 algorithm, in the form of sha512sum. First, the PMO will determine the three "random" (unknown in advance) whole number values, as described below:
a) First, the closing value of the S&P 500 Index (ignoring any fractional part of the number) as shown on http:/quotes.wsj.com/index/SPX/historical-prices for the Tuesday following the last day of the ballot
b) Second, the closing value of the Dow Jones Industrial Average (ignoring any fractional part of the number) as shown on http://quotes.wsj.com/index/DJIA/historical-prices for the Tuesday following the last day of the ballot
c) Third, the final, winning score of the first basketball game played (started and completed) by the NBA's Golden State Warriors following the last day of the ballot, as shown on http://www.nba.com/scores#/

3. The output (hashed result) of the sha512sum command will be a sequence of 128 characters. The first number that corresponds to a tied candidate that appears in the sequence will determine the winner. If more than one candidate is to be chosen as a winner, then the first numbers that correspond to the tied candidates that appear in the sequence will determine the winners.

If the input values are to be read from a file, the values must be on a single line, in the order specified, each separated by a single space with no leading or trailing spaces, the line ending with a single newline (\n) character (ASCII decimal value: 10) only.

Example: Magacorp, S-Mart, and Samuel Johnson are all tied, each receiving an equal number of votes for one seat in the 2022 election's final tally. The 2022 ballot closed on 14 November. The NASDAQ Composite Index closed at 11196 on 14 November: an even number. Numbers are thus assigned to the candidates in alphabetic order, thus: Samuel Johnson (1), Megacorp (2), and S-Mart (3).

Our three numbers are:
- 3991 (the SPX closing value from 15 November 2022)
- 33592 (the DJIA closing value from 15 November 2022)
- 130 (the winning score of the Phoenix Suns, who beat the Golden State Warriors on 16 November 2022)

Therefore, at 10 AM PST on 17 November 2022, those three numbers would be used to determine the winner. As is commonly available on Unix/Linux systems, sha512sum (or its algorithmic equivalent) will be used with the input numbers to determine the outcome of the tiebreaker:

$ echo 3991 33592 130 | sha512sum

which gives the hashed result of:

446baf2f0ac9288b6e8dc3842ead609a79346d75944076202a86651c2a9c6150ff8f64caf10717fcc4810827742ee208346c0fb216d6ffa8ac17b73756c3a87a

In our example, we're looking for 1, 2, or 3. The number 2 appears first in the above hash result, therefore Megacorp would have won the seat.

The above example showing the sha512sum hash result should be repeatable using the same rules and input values and comparable against other sha512sum implementations.

PAST EC ELECTIONS RESULTS